./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d551f1abb3218eb8b1d4d4572d230d291d7b92b1901f2a1ff958c149ef6299de --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:40:22,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:40:22,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:40:22,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:40:22,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:40:22,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:40:22,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:40:22,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:40:22,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:40:22,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:40:22,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:40:22,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:40:22,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:40:22,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:40:22,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:40:22,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:40:22,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:40:22,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:40:22,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:40:22,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:40:22,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:40:22,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:40:22,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:40:22,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:40:22,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:40:22,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:40:22,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:40:22,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:40:22,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:40:22,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:40:22,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:40:22,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:40:22,452 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d551f1abb3218eb8b1d4d4572d230d291d7b92b1901f2a1ff958c149ef6299de [2025-03-08 09:40:22,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:40:22,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:40:22,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:40:22,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:40:22,685 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:40:22,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-03-08 09:40:23,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671070f3a/5848e761af9f48f1955f2641fd1e3f70/FLAG9913ded87 [2025-03-08 09:40:24,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:40:24,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-03-08 09:40:24,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671070f3a/5848e761af9f48f1955f2641fd1e3f70/FLAG9913ded87 [2025-03-08 09:40:24,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671070f3a/5848e761af9f48f1955f2641fd1e3f70 [2025-03-08 09:40:24,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:40:24,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:40:24,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:40:24,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:40:24,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:40:24,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f100305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24, skipping insertion in model container [2025-03-08 09:40:24,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:40:24,492 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c[1258,1271] [2025-03-08 09:40:24,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:40:24,536 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:40:24,542 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c[1258,1271] [2025-03-08 09:40:24,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:40:24,578 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:40:24,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24 WrapperNode [2025-03-08 09:40:24,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:40:24,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:40:24,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:40:24,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:40:24,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,625 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 318 [2025-03-08 09:40:24,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:40:24,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:40:24,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:40:24,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:40:24,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,659 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 09:40:24,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:40:24,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:40:24,691 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:40:24,691 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:40:24,692 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (1/1) ... [2025-03-08 09:40:24,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:40:24,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:40:24,722 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 09:40:24,727 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 09:40:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:40:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:40:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:40:24,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:40:24,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:40:24,822 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:40:25,210 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-03-08 09:40:25,210 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:40:25,239 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:40:25,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:40:25,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:40:25 BoogieIcfgContainer [2025-03-08 09:40:25,240 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:40:25,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:40:25,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:40:25,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:40:25,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:40:24" (1/3) ... [2025-03-08 09:40:25,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b0ed94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:40:25, skipping insertion in model container [2025-03-08 09:40:25,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:24" (2/3) ... [2025-03-08 09:40:25,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b0ed94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:40:25, skipping insertion in model container [2025-03-08 09:40:25,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:40:25" (3/3) ... [2025-03-08 09:40:25,249 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-03-08 09:40:25,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:40:25,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c that has 1 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:40:25,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:40:25,310 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;@39f5f784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:40:25,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:40:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 0 states have call successors, (0), 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 09:40:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 09:40:25,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:25,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:40:25,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:25,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:25,327 INFO L85 PathProgramCache]: Analyzing trace with hash -406527163, now seen corresponding path program 1 times [2025-03-08 09:40:25,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962864379] [2025-03-08 09:40:25,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:25,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 09:40:25,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 09:40:25,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:25,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:25,745 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 09:40:25,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:25,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962864379] [2025-03-08 09:40:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962864379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:25,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:25,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:40:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046993911] [2025-03-08 09:40:25,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:25,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:40:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:25,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:40:25,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:40:25,764 INFO L87 Difference]: Start difference. First operand has 90 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 0 states have call successors, (0), 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 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 09:40:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:25,846 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2025-03-08 09:40:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:40:25,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-08 09:40:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:25,853 INFO L225 Difference]: With dead ends: 169 [2025-03-08 09:40:25,853 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 09:40:25,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:40:25,859 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:25,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 09:40:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 09:40:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 88 states have internal predecessors, (129), 0 states have call successors, (0), 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 09:40:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-03-08 09:40:25,888 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 13 [2025-03-08 09:40:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:25,888 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-03-08 09:40:25,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 09:40:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-03-08 09:40:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 09:40:25,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:25,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:40:25,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:40:25,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:25,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:25,891 INFO L85 PathProgramCache]: Analyzing trace with hash 287239092, now seen corresponding path program 1 times [2025-03-08 09:40:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:25,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312370343] [2025-03-08 09:40:25,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:25,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:25,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 09:40:25,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 09:40:25,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:25,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:26,038 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 09:40:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312370343] [2025-03-08 09:40:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312370343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:26,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:26,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:40:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64425565] [2025-03-08 09:40:26,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:26,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:40:26,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:26,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:40:26,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:40:26,042 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 09:40:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:26,121 INFO L93 Difference]: Finished difference Result 170 states and 247 transitions. [2025-03-08 09:40:26,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:40:26,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-08 09:40:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:26,123 INFO L225 Difference]: With dead ends: 170 [2025-03-08 09:40:26,124 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 09:40:26,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:40:26,125 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:26,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 09:40:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 09:40:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 0 states have call successors, (0), 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 09:40:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-03-08 09:40:26,135 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 14 [2025-03-08 09:40:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:26,135 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-03-08 09:40:26,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 09:40:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-03-08 09:40:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 09:40:26,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:26,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:40:26,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:40:26,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:26,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2048980704, now seen corresponding path program 1 times [2025-03-08 09:40:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71300297] [2025-03-08 09:40:26,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:26,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:26,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 09:40:26,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 09:40:26,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:26,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:26,440 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 09:40:26,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71300297] [2025-03-08 09:40:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71300297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:26,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:40:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330282730] [2025-03-08 09:40:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:26,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:40:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:26,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:40:26,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:40:26,445 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 09:40:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:26,553 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2025-03-08 09:40:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:40:26,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-08 09:40:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:26,554 INFO L225 Difference]: With dead ends: 174 [2025-03-08 09:40:26,554 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 09:40:26,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:40:26,554 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:26,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 498 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 09:40:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 09:40:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 0 states have call successors, (0), 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 09:40:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-08 09:40:26,562 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 15 [2025-03-08 09:40:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:26,562 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-08 09:40:26,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 09:40:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-08 09:40:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 09:40:26,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:26,563 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:26,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:40:26,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:26,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:26,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1460913900, now seen corresponding path program 1 times [2025-03-08 09:40:26,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406386726] [2025-03-08 09:40:26,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:26,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 09:40:26,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 09:40:26,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:26,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:27,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406386726] [2025-03-08 09:40:27,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406386726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:40:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586539551] [2025-03-08 09:40:27,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:27,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:40:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:40:27,049 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 09:40:27,051 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 09:40:27,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 09:40:27,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 09:40:27,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:27,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:27,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 09:40:27,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:40:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 09:40:27,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:40:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:28,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586539551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:40:28,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:40:28,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 10] total 20 [2025-03-08 09:40:28,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075029007] [2025-03-08 09:40:28,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:40:28,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:28,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:28,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:28,748 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 0 states have call successors, (0), 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 09:40:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:29,005 INFO L93 Difference]: Finished difference Result 177 states and 254 transitions. [2025-03-08 09:40:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:40:29,006 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 0 states have call successors, (0), 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 54 [2025-03-08 09:40:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:29,007 INFO L225 Difference]: With dead ends: 177 [2025-03-08 09:40:29,007 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 09:40:29,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:40:29,008 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 342 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:29,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 609 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 09:40:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-03-08 09:40:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 0 states have call successors, (0), 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 09:40:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2025-03-08 09:40:29,011 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 54 [2025-03-08 09:40:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:29,011 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2025-03-08 09:40:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 0 states have call successors, (0), 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 09:40:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2025-03-08 09:40:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 09:40:29,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:29,015 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:29,023 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 09:40:29,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:40:29,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:29,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2039846026, now seen corresponding path program 1 times [2025-03-08 09:40:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:29,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196750135] [2025-03-08 09:40:29,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:29,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:29,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 09:40:29,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 09:40:29,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:29,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:30,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196750135] [2025-03-08 09:40:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196750135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 09:40:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629330309] [2025-03-08 09:40:30,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:30,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 09:40:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:30,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 09:40:30,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:40:30,314 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 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 09:40:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:30,703 INFO L93 Difference]: Finished difference Result 333 states and 481 transitions. [2025-03-08 09:40:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 09:40:30,703 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-08 09:40:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:30,708 INFO L225 Difference]: With dead ends: 333 [2025-03-08 09:40:30,708 INFO L226 Difference]: Without dead ends: 249 [2025-03-08 09:40:30,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:40:30,709 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 205 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:30,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1121 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:40:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-08 09:40:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 153. [2025-03-08 09:40:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 152 states have internal predecessors, (219), 0 states have call successors, (0), 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 09:40:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2025-03-08 09:40:30,723 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 55 [2025-03-08 09:40:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:30,723 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2025-03-08 09:40:30,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 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 09:40:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2025-03-08 09:40:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 09:40:30,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:30,724 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:40:30,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2101074409, now seen corresponding path program 1 times [2025-03-08 09:40:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566275367] [2025-03-08 09:40:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:30,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 09:40:30,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 09:40:30,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:30,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:31,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:31,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566275367] [2025-03-08 09:40:31,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566275367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:31,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:31,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 09:40:31,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358781533] [2025-03-08 09:40:31,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:31,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 09:40:31,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:31,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 09:40:31,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:40:31,761 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:32,152 INFO L93 Difference]: Finished difference Result 363 states and 525 transitions. [2025-03-08 09:40:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 09:40:32,153 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 09:40:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:32,154 INFO L225 Difference]: With dead ends: 363 [2025-03-08 09:40:32,154 INFO L226 Difference]: Without dead ends: 279 [2025-03-08 09:40:32,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:32,156 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 205 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:32,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1178 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:40:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-08 09:40:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 201. [2025-03-08 09:40:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.455) internal successors, (291), 200 states have internal predecessors, (291), 0 states have call successors, (0), 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 09:40:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 291 transitions. [2025-03-08 09:40:32,169 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 291 transitions. Word has length 56 [2025-03-08 09:40:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:32,169 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 291 transitions. [2025-03-08 09:40:32,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 291 transitions. [2025-03-08 09:40:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 09:40:32,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:32,170 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:32,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:40:32,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:32,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -282770291, now seen corresponding path program 1 times [2025-03-08 09:40:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:32,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046919848] [2025-03-08 09:40:32,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:32,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:32,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 09:40:32,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 09:40:32,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:32,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046919848] [2025-03-08 09:40:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046919848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:40:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244144548] [2025-03-08 09:40:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:33,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:33,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:33,026 INFO L87 Difference]: Start difference. First operand 201 states and 291 transitions. Second operand has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:33,355 INFO L93 Difference]: Finished difference Result 453 states and 660 transitions. [2025-03-08 09:40:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:40:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 09:40:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:33,357 INFO L225 Difference]: With dead ends: 453 [2025-03-08 09:40:33,357 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 09:40:33,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:33,358 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 233 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:33,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 975 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:40:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 09:40:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 231. [2025-03-08 09:40:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4565217391304348) internal successors, (335), 230 states have internal predecessors, (335), 0 states have call successors, (0), 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 09:40:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 335 transitions. [2025-03-08 09:40:33,366 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 335 transitions. Word has length 56 [2025-03-08 09:40:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:33,366 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 335 transitions. [2025-03-08 09:40:33,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 335 transitions. [2025-03-08 09:40:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 09:40:33,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:33,368 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:33,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:40:33,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash -706024188, now seen corresponding path program 1 times [2025-03-08 09:40:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508342942] [2025-03-08 09:40:33,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:33,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 09:40:33,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 09:40:33,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:33,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:34,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508342942] [2025-03-08 09:40:34,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508342942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:34,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:34,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 09:40:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397266672] [2025-03-08 09:40:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:34,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 09:40:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:34,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 09:40:34,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:40:34,149 INFO L87 Difference]: Start difference. First operand 231 states and 335 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:34,401 INFO L93 Difference]: Finished difference Result 421 states and 611 transitions. [2025-03-08 09:40:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 09:40:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 09:40:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:34,403 INFO L225 Difference]: With dead ends: 421 [2025-03-08 09:40:34,403 INFO L226 Difference]: Without dead ends: 336 [2025-03-08 09:40:34,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:40:34,404 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 220 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:34,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1113 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-08 09:40:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 249. [2025-03-08 09:40:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4556451612903225) internal successors, (361), 248 states have internal predecessors, (361), 0 states have call successors, (0), 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 09:40:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 361 transitions. [2025-03-08 09:40:34,415 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 361 transitions. Word has length 56 [2025-03-08 09:40:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:34,415 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 361 transitions. [2025-03-08 09:40:34,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2025-03-08 09:40:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 09:40:34,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:34,416 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:34,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:40:34,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:34,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 731123203, now seen corresponding path program 1 times [2025-03-08 09:40:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897087992] [2025-03-08 09:40:34,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:34,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 09:40:34,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 09:40:34,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:34,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:35,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897087992] [2025-03-08 09:40:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897087992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:35,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:40:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719533209] [2025-03-08 09:40:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:35,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:35,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:35,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:35,196 INFO L87 Difference]: Start difference. First operand 249 states and 361 transitions. Second operand has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:35,576 INFO L93 Difference]: Finished difference Result 537 states and 782 transitions. [2025-03-08 09:40:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:40:35,577 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 09:40:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:35,579 INFO L225 Difference]: With dead ends: 537 [2025-03-08 09:40:35,579 INFO L226 Difference]: Without dead ends: 415 [2025-03-08 09:40:35,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:35,582 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 232 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:35,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 977 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:40:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-08 09:40:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 275. [2025-03-08 09:40:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.4562043795620438) internal successors, (399), 274 states have internal predecessors, (399), 0 states have call successors, (0), 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 09:40:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 399 transitions. [2025-03-08 09:40:35,590 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 399 transitions. Word has length 56 [2025-03-08 09:40:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:35,590 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 399 transitions. [2025-03-08 09:40:35,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2025-03-08 09:40:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 09:40:35,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:35,591 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:35,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 09:40:35,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:35,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1609393176, now seen corresponding path program 1 times [2025-03-08 09:40:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:35,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612857128] [2025-03-08 09:40:35,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:35,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 09:40:35,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 09:40:35,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:35,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612857128] [2025-03-08 09:40:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612857128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-08 09:40:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203061463] [2025-03-08 09:40:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 09:40:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:36,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 09:40:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:40:36,242 INFO L87 Difference]: Start difference. First operand 275 states and 399 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:36,568 INFO L93 Difference]: Finished difference Result 629 states and 918 transitions. [2025-03-08 09:40:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 09:40:36,568 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 09:40:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:36,570 INFO L225 Difference]: With dead ends: 629 [2025-03-08 09:40:36,571 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 09:40:36,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:40:36,572 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 142 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:36,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1070 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:40:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 09:40:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 346. [2025-03-08 09:40:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.4521739130434783) internal successors, (501), 345 states have internal predecessors, (501), 0 states have call successors, (0), 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 09:40:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 501 transitions. [2025-03-08 09:40:36,586 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 501 transitions. Word has length 56 [2025-03-08 09:40:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:36,586 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 501 transitions. [2025-03-08 09:40:36,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 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 09:40:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 501 transitions. [2025-03-08 09:40:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:36,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:36,587 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:36,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 09:40:36,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:36,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 197715104, now seen corresponding path program 1 times [2025-03-08 09:40:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648145263] [2025-03-08 09:40:36,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:36,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:36,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:37,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648145263] [2025-03-08 09:40:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648145263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:37,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:37,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 09:40:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878933227] [2025-03-08 09:40:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:37,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 09:40:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 09:40:37,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:40:37,254 INFO L87 Difference]: Start difference. First operand 346 states and 501 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 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 09:40:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:37,880 INFO L93 Difference]: Finished difference Result 657 states and 952 transitions. [2025-03-08 09:40:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 09:40:37,880 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 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 57 [2025-03-08 09:40:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:37,883 INFO L225 Difference]: With dead ends: 657 [2025-03-08 09:40:37,883 INFO L226 Difference]: Without dead ends: 573 [2025-03-08 09:40:37,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:37,884 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 415 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:37,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1117 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:40:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-08 09:40:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 406. [2025-03-08 09:40:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.4567901234567902) internal successors, (590), 405 states have internal predecessors, (590), 0 states have call successors, (0), 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 09:40:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 590 transitions. [2025-03-08 09:40:37,897 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 590 transitions. Word has length 57 [2025-03-08 09:40:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:37,898 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 590 transitions. [2025-03-08 09:40:37,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 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 09:40:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 590 transitions. [2025-03-08 09:40:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:37,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:37,899 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:37,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 09:40:37,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash 801579620, now seen corresponding path program 1 times [2025-03-08 09:40:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60190522] [2025-03-08 09:40:37,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:37,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:37,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:37,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:37,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:37,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60190522] [2025-03-08 09:40:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60190522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:38,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 09:40:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804273614] [2025-03-08 09:40:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 09:40:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:38,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 09:40:38,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:40:38,366 INFO L87 Difference]: Start difference. First operand 406 states and 590 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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 09:40:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:38,590 INFO L93 Difference]: Finished difference Result 817 states and 1193 transitions. [2025-03-08 09:40:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 09:40:38,590 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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 57 [2025-03-08 09:40:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:38,592 INFO L225 Difference]: With dead ends: 817 [2025-03-08 09:40:38,592 INFO L226 Difference]: Without dead ends: 647 [2025-03-08 09:40:38,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:40:38,594 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 147 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:38,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 842 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-08 09:40:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 526. [2025-03-08 09:40:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.457142857142857) internal successors, (765), 525 states have internal predecessors, (765), 0 states have call successors, (0), 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 09:40:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 765 transitions. [2025-03-08 09:40:38,611 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 765 transitions. Word has length 57 [2025-03-08 09:40:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:38,611 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 765 transitions. [2025-03-08 09:40:38,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 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 09:40:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 765 transitions. [2025-03-08 09:40:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:38,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:38,615 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:38,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 09:40:38,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:38,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:38,616 INFO L85 PathProgramCache]: Analyzing trace with hash -225538793, now seen corresponding path program 1 times [2025-03-08 09:40:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:38,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932400624] [2025-03-08 09:40:38,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:38,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:38,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:38,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:38,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:39,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932400624] [2025-03-08 09:40:39,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932400624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:39,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:39,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:40:39,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484780635] [2025-03-08 09:40:39,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:39,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:39,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:39,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:39,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:39,218 INFO L87 Difference]: Start difference. First operand 526 states and 765 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 09:40:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:39,529 INFO L93 Difference]: Finished difference Result 825 states and 1194 transitions. [2025-03-08 09:40:39,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:40:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 57 [2025-03-08 09:40:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:39,532 INFO L225 Difference]: With dead ends: 825 [2025-03-08 09:40:39,532 INFO L226 Difference]: Without dead ends: 689 [2025-03-08 09:40:39,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:39,533 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 177 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:39,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1528 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:40:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-08 09:40:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 547. [2025-03-08 09:40:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.456043956043956) internal successors, (795), 546 states have internal predecessors, (795), 0 states have call successors, (0), 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 09:40:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 795 transitions. [2025-03-08 09:40:39,545 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 795 transitions. Word has length 57 [2025-03-08 09:40:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:39,546 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 795 transitions. [2025-03-08 09:40:39,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 09:40:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 795 transitions. [2025-03-08 09:40:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:39,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:39,547 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:39,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 09:40:39,548 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:39,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1211608598, now seen corresponding path program 1 times [2025-03-08 09:40:39,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:39,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658824109] [2025-03-08 09:40:39,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:39,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:39,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:39,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:39,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:39,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658824109] [2025-03-08 09:40:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658824109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:40,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:40:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723497505] [2025-03-08 09:40:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:40,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:40,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:40,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:40,347 INFO L87 Difference]: Start difference. First operand 547 states and 795 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 09:40:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:40,700 INFO L93 Difference]: Finished difference Result 894 states and 1297 transitions. [2025-03-08 09:40:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 09:40:40,701 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 57 [2025-03-08 09:40:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:40,703 INFO L225 Difference]: With dead ends: 894 [2025-03-08 09:40:40,703 INFO L226 Difference]: Without dead ends: 761 [2025-03-08 09:40:40,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:40:40,704 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 161 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:40,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 972 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:40:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-08 09:40:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 573. [2025-03-08 09:40:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.4580419580419581) internal successors, (834), 572 states have internal predecessors, (834), 0 states have call successors, (0), 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 09:40:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 834 transitions. [2025-03-08 09:40:40,716 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 834 transitions. Word has length 57 [2025-03-08 09:40:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:40,716 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 834 transitions. [2025-03-08 09:40:40,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 09:40:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 834 transitions. [2025-03-08 09:40:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:40,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:40,717 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:40,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 09:40:40,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:40,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1128907781, now seen corresponding path program 1 times [2025-03-08 09:40:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:40,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344993013] [2025-03-08 09:40:40,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:40,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:40,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:40,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:40,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:40,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:41,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:41,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344993013] [2025-03-08 09:40:41,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344993013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:41,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:41,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:40:41,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084479320] [2025-03-08 09:40:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:41,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:40:41,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:41,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:40:41,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:40:41,499 INFO L87 Difference]: Start difference. First operand 573 states and 834 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 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 09:40:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:41,900 INFO L93 Difference]: Finished difference Result 1045 states and 1518 transitions. [2025-03-08 09:40:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:40:41,901 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 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 57 [2025-03-08 09:40:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:41,903 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 09:40:41,903 INFO L226 Difference]: Without dead ends: 861 [2025-03-08 09:40:41,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:40:41,904 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 173 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:41,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1095 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:40:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-08 09:40:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 620. [2025-03-08 09:40:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4588045234248788) internal successors, (903), 619 states have internal predecessors, (903), 0 states have call successors, (0), 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 09:40:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 903 transitions. [2025-03-08 09:40:41,914 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 903 transitions. Word has length 57 [2025-03-08 09:40:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:41,914 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 903 transitions. [2025-03-08 09:40:41,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 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 09:40:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 903 transitions. [2025-03-08 09:40:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:41,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:41,915 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:41,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 09:40:41,916 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:41,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash -522979323, now seen corresponding path program 1 times [2025-03-08 09:40:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:41,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439759183] [2025-03-08 09:40:41,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:41,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:41,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:41,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:41,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:41,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:42,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439759183] [2025-03-08 09:40:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439759183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:42,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:40:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441095049] [2025-03-08 09:40:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:42,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:42,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:42,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:42,635 INFO L87 Difference]: Start difference. First operand 620 states and 903 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 09:40:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:42,983 INFO L93 Difference]: Finished difference Result 984 states and 1429 transitions. [2025-03-08 09:40:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 09:40:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 57 [2025-03-08 09:40:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:42,986 INFO L225 Difference]: With dead ends: 984 [2025-03-08 09:40:42,986 INFO L226 Difference]: Without dead ends: 831 [2025-03-08 09:40:42,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:40:42,988 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 143 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:42,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1245 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:40:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-08 09:40:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 689. [2025-03-08 09:40:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.4607558139534884) internal successors, (1005), 688 states have internal predecessors, (1005), 0 states have call successors, (0), 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 09:40:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1005 transitions. [2025-03-08 09:40:42,999 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1005 transitions. Word has length 57 [2025-03-08 09:40:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:42,999 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1005 transitions. [2025-03-08 09:40:42,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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 09:40:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1005 transitions. [2025-03-08 09:40:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:43,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:43,000 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:43,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 09:40:43,001 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:43,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 662714919, now seen corresponding path program 1 times [2025-03-08 09:40:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661915853] [2025-03-08 09:40:43,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:43,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:43,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:43,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:43,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661915853] [2025-03-08 09:40:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661915853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:40:43,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577743473] [2025-03-08 09:40:43,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:43,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:40:43,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:43,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:40:43,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:40:43,274 INFO L87 Difference]: Start difference. First operand 689 states and 1005 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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 09:40:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:43,413 INFO L93 Difference]: Finished difference Result 1048 states and 1527 transitions. [2025-03-08 09:40:43,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:40:43,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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 57 [2025-03-08 09:40:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:43,416 INFO L225 Difference]: With dead ends: 1048 [2025-03-08 09:40:43,416 INFO L226 Difference]: Without dead ends: 820 [2025-03-08 09:40:43,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:40:43,417 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 98 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:43,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 661 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-08 09:40:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 751. [2025-03-08 09:40:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4546666666666668) internal successors, (1091), 750 states have internal predecessors, (1091), 0 states have call successors, (0), 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 09:40:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1091 transitions. [2025-03-08 09:40:43,428 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1091 transitions. Word has length 57 [2025-03-08 09:40:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:43,428 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1091 transitions. [2025-03-08 09:40:43,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 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 09:40:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1091 transitions. [2025-03-08 09:40:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:43,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:43,430 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:43,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 09:40:43,430 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:43,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash -689980222, now seen corresponding path program 1 times [2025-03-08 09:40:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448694965] [2025-03-08 09:40:43,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:43,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:43,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:43,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:43,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448694965] [2025-03-08 09:40:43,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448694965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:43,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:43,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 09:40:43,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050690943] [2025-03-08 09:40:43,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:43,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 09:40:43,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:43,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 09:40:43,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:40:43,739 INFO L87 Difference]: Start difference. First operand 751 states and 1091 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 09:40:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:43,869 INFO L93 Difference]: Finished difference Result 1030 states and 1493 transitions. [2025-03-08 09:40:43,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:40:43,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 57 [2025-03-08 09:40:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:43,872 INFO L225 Difference]: With dead ends: 1030 [2025-03-08 09:40:43,872 INFO L226 Difference]: Without dead ends: 811 [2025-03-08 09:40:43,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:40:43,875 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 84 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:43,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 785 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-08 09:40:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 739. [2025-03-08 09:40:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.4390243902439024) internal successors, (1062), 738 states have internal predecessors, (1062), 0 states have call successors, (0), 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 09:40:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1062 transitions. [2025-03-08 09:40:43,886 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1062 transitions. Word has length 57 [2025-03-08 09:40:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:43,886 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1062 transitions. [2025-03-08 09:40:43,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 09:40:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1062 transitions. [2025-03-08 09:40:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:43,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:43,888 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:43,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 09:40:43,889 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:43,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1385252832, now seen corresponding path program 1 times [2025-03-08 09:40:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:43,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452917198] [2025-03-08 09:40:43,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:43,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:43,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:43,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:43,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452917198] [2025-03-08 09:40:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452917198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:43,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:40:43,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584891536] [2025-03-08 09:40:43,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:43,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:40:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:43,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:40:43,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:40:43,981 INFO L87 Difference]: Start difference. First operand 739 states and 1062 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 09:40:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:44,046 INFO L93 Difference]: Finished difference Result 1039 states and 1491 transitions. [2025-03-08 09:40:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:40:44,047 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 57 [2025-03-08 09:40:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:44,048 INFO L225 Difference]: With dead ends: 1039 [2025-03-08 09:40:44,049 INFO L226 Difference]: Without dead ends: 746 [2025-03-08 09:40:44,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:40:44,050 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 39 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:44,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 494 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-08 09:40:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2025-03-08 09:40:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 1.414535666218035) internal successors, (1051), 743 states have internal predecessors, (1051), 0 states have call successors, (0), 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 09:40:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1051 transitions. [2025-03-08 09:40:44,060 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1051 transitions. Word has length 57 [2025-03-08 09:40:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:44,060 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1051 transitions. [2025-03-08 09:40:44,060 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 09:40:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1051 transitions. [2025-03-08 09:40:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:44,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:44,061 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 09:40:44,062 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:44,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1195507845, now seen corresponding path program 1 times [2025-03-08 09:40:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449467131] [2025-03-08 09:40:44,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:44,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:44,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:44,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:44,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449467131] [2025-03-08 09:40:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449467131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:44,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:40:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854945308] [2025-03-08 09:40:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:44,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:40:44,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:44,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:40:44,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:40:44,184 INFO L87 Difference]: Start difference. First operand 744 states and 1051 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 09:40:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:44,256 INFO L93 Difference]: Finished difference Result 972 states and 1374 transitions. [2025-03-08 09:40:44,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:40:44,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 57 [2025-03-08 09:40:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:44,259 INFO L225 Difference]: With dead ends: 972 [2025-03-08 09:40:44,259 INFO L226 Difference]: Without dead ends: 666 [2025-03-08 09:40:44,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:40:44,259 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:44,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 389 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-08 09:40:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2025-03-08 09:40:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.392156862745098) internal successors, (923), 663 states have internal predecessors, (923), 0 states have call successors, (0), 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 09:40:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 923 transitions. [2025-03-08 09:40:44,269 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 923 transitions. Word has length 57 [2025-03-08 09:40:44,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:44,269 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 923 transitions. [2025-03-08 09:40:44,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 09:40:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 923 transitions. [2025-03-08 09:40:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:44,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:44,270 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:44,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 09:40:44,271 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:44,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:44,271 INFO L85 PathProgramCache]: Analyzing trace with hash 643680566, now seen corresponding path program 1 times [2025-03-08 09:40:44,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:44,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647329467] [2025-03-08 09:40:44,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:44,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:44,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:44,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:44,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:44,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:44,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:44,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647329467] [2025-03-08 09:40:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647329467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:44,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:44,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:40:44,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752849745] [2025-03-08 09:40:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:44,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:40:44,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:44,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:40:44,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:40:44,455 INFO L87 Difference]: Start difference. First operand 664 states and 923 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 09:40:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:44,522 INFO L93 Difference]: Finished difference Result 954 states and 1323 transitions. [2025-03-08 09:40:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:40:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 57 [2025-03-08 09:40:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:44,524 INFO L225 Difference]: With dead ends: 954 [2025-03-08 09:40:44,524 INFO L226 Difference]: Without dead ends: 678 [2025-03-08 09:40:44,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:40:44,526 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:44,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 450 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-03-08 09:40:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2025-03-08 09:40:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 1.3555555555555556) internal successors, (915), 675 states have internal predecessors, (915), 0 states have call successors, (0), 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 09:40:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 915 transitions. [2025-03-08 09:40:44,534 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 915 transitions. Word has length 57 [2025-03-08 09:40:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:44,534 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 915 transitions. [2025-03-08 09:40:44,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 09:40:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 915 transitions. [2025-03-08 09:40:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:44,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:44,535 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:44,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 09:40:44,535 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1052018257, now seen corresponding path program 1 times [2025-03-08 09:40:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895023299] [2025-03-08 09:40:44,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:44,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:44,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:44,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:44,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895023299] [2025-03-08 09:40:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895023299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:44,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:44,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:40:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890305867] [2025-03-08 09:40:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:44,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:40:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:44,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:40:44,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:40:44,719 INFO L87 Difference]: Start difference. First operand 676 states and 915 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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 09:40:44,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:44,780 INFO L93 Difference]: Finished difference Result 926 states and 1267 transitions. [2025-03-08 09:40:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:40:44,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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 57 [2025-03-08 09:40:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:44,782 INFO L225 Difference]: With dead ends: 926 [2025-03-08 09:40:44,782 INFO L226 Difference]: Without dead ends: 673 [2025-03-08 09:40:44,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:40:44,784 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 31 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:44,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 553 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-08 09:40:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 671. [2025-03-08 09:40:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 1.3388059701492536) internal successors, (897), 670 states have internal predecessors, (897), 0 states have call successors, (0), 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 09:40:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 897 transitions. [2025-03-08 09:40:44,791 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 897 transitions. Word has length 57 [2025-03-08 09:40:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:44,791 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 897 transitions. [2025-03-08 09:40:44,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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 09:40:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 897 transitions. [2025-03-08 09:40:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:44,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:44,792 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:44,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 09:40:44,793 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:44,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:44,793 INFO L85 PathProgramCache]: Analyzing trace with hash -421295245, now seen corresponding path program 1 times [2025-03-08 09:40:44,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:44,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737818250] [2025-03-08 09:40:44,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:44,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:44,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:44,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:44,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:44,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737818250] [2025-03-08 09:40:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737818250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:45,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:45,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 09:40:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990247922] [2025-03-08 09:40:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:45,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 09:40:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:45,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 09:40:45,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:40:45,151 INFO L87 Difference]: Start difference. First operand 671 states and 897 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 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 09:40:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:45,295 INFO L93 Difference]: Finished difference Result 1003 states and 1376 transitions. [2025-03-08 09:40:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 09:40:45,296 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 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 57 [2025-03-08 09:40:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:45,297 INFO L225 Difference]: With dead ends: 1003 [2025-03-08 09:40:45,298 INFO L226 Difference]: Without dead ends: 802 [2025-03-08 09:40:45,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:40:45,298 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 57 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:45,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 937 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-08 09:40:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 742. [2025-03-08 09:40:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.3346828609986505) internal successors, (989), 741 states have internal predecessors, (989), 0 states have call successors, (0), 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 09:40:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 989 transitions. [2025-03-08 09:40:45,307 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 989 transitions. Word has length 57 [2025-03-08 09:40:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:45,307 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 989 transitions. [2025-03-08 09:40:45,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 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 09:40:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 989 transitions. [2025-03-08 09:40:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:40:45,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:45,308 INFO L218 NwaCegarLoop]: trace histogram [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 09:40:45,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 09:40:45,308 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:45,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash -29588648, now seen corresponding path program 1 times [2025-03-08 09:40:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440420365] [2025-03-08 09:40:45,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:45,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:40:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:40:45,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:45,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440420365] [2025-03-08 09:40:45,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440420365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:45,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:45,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 09:40:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942140897] [2025-03-08 09:40:45,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:45,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 09:40:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:45,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 09:40:45,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:40:45,698 INFO L87 Difference]: Start difference. First operand 742 states and 989 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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 09:40:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:45,868 INFO L93 Difference]: Finished difference Result 945 states and 1272 transitions. [2025-03-08 09:40:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 09:40:45,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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 57 [2025-03-08 09:40:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:45,870 INFO L225 Difference]: With dead ends: 945 [2025-03-08 09:40:45,870 INFO L226 Difference]: Without dead ends: 780 [2025-03-08 09:40:45,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:40:45,871 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 69 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:45,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 928 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-08 09:40:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 746. [2025-03-08 09:40:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.3288590604026846) internal successors, (990), 745 states have internal predecessors, (990), 0 states have call successors, (0), 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 09:40:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 990 transitions. [2025-03-08 09:40:45,879 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 990 transitions. Word has length 57 [2025-03-08 09:40:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:45,880 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 990 transitions. [2025-03-08 09:40:45,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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 09:40:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 990 transitions. [2025-03-08 09:40:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:45,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:45,881 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 09:40:45,881 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:45,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -950389509, now seen corresponding path program 1 times [2025-03-08 09:40:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82603261] [2025-03-08 09:40:45,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:45,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:45,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:45,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:45,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:46,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:46,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82603261] [2025-03-08 09:40:46,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82603261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:46,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:46,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 09:40:46,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846810036] [2025-03-08 09:40:46,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:46,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:40:46,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:46,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:40:46,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:40:46,163 INFO L87 Difference]: Start difference. First operand 746 states and 990 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:46,405 INFO L93 Difference]: Finished difference Result 1303 states and 1752 transitions. [2025-03-08 09:40:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:40:46,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:46,408 INFO L225 Difference]: With dead ends: 1303 [2025-03-08 09:40:46,408 INFO L226 Difference]: Without dead ends: 1170 [2025-03-08 09:40:46,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:40:46,409 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 183 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:46,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 611 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-03-08 09:40:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1021. [2025-03-08 09:40:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 1.3372549019607842) internal successors, (1364), 1020 states have internal predecessors, (1364), 0 states have call successors, (0), 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 09:40:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1364 transitions. [2025-03-08 09:40:46,419 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1364 transitions. Word has length 58 [2025-03-08 09:40:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:46,419 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1364 transitions. [2025-03-08 09:40:46,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1364 transitions. [2025-03-08 09:40:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:46,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:46,420 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:46,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 09:40:46,421 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:46,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1977507922, now seen corresponding path program 1 times [2025-03-08 09:40:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:46,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081776405] [2025-03-08 09:40:46,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:46,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:46,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:46,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:46,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:46,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:46,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:46,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081776405] [2025-03-08 09:40:46,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081776405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:46,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 09:40:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388243692] [2025-03-08 09:40:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:46,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 09:40:46,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:46,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 09:40:46,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:40:46,881 INFO L87 Difference]: Start difference. First operand 1021 states and 1364 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:47,039 INFO L93 Difference]: Finished difference Result 1408 states and 1916 transitions. [2025-03-08 09:40:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 09:40:47,040 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:47,042 INFO L225 Difference]: With dead ends: 1408 [2025-03-08 09:40:47,042 INFO L226 Difference]: Without dead ends: 1185 [2025-03-08 09:40:47,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:40:47,043 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 62 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:47,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 918 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-03-08 09:40:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1063. [2025-03-08 09:40:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.3427495291902072) internal successors, (1426), 1062 states have internal predecessors, (1426), 0 states have call successors, (0), 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 09:40:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1426 transitions. [2025-03-08 09:40:47,053 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1426 transitions. Word has length 58 [2025-03-08 09:40:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:47,053 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1426 transitions. [2025-03-08 09:40:47,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1426 transitions. [2025-03-08 09:40:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:47,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:47,055 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:47,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 09:40:47,055 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:47,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash -439438171, now seen corresponding path program 1 times [2025-03-08 09:40:47,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:47,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756091423] [2025-03-08 09:40:47,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:47,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:47,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:47,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:47,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:47,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:47,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756091423] [2025-03-08 09:40:47,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756091423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:47,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:47,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 09:40:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138649913] [2025-03-08 09:40:47,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:47,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 09:40:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:47,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 09:40:47,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:40:47,456 INFO L87 Difference]: Start difference. First operand 1063 states and 1426 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:47,596 INFO L93 Difference]: Finished difference Result 1410 states and 1904 transitions. [2025-03-08 09:40:47,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 09:40:47,596 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:47,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:47,598 INFO L225 Difference]: With dead ends: 1410 [2025-03-08 09:40:47,598 INFO L226 Difference]: Without dead ends: 1174 [2025-03-08 09:40:47,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:40:47,599 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 97 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:47,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 881 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-03-08 09:40:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1079. [2025-03-08 09:40:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.3376623376623376) internal successors, (1442), 1078 states have internal predecessors, (1442), 0 states have call successors, (0), 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 09:40:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1442 transitions. [2025-03-08 09:40:47,609 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1442 transitions. Word has length 58 [2025-03-08 09:40:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:47,609 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1442 transitions. [2025-03-08 09:40:47,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1442 transitions. [2025-03-08 09:40:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:47,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:47,610 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:47,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 09:40:47,610 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:47,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash -611580680, now seen corresponding path program 1 times [2025-03-08 09:40:47,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:47,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649806026] [2025-03-08 09:40:47,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:47,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:47,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:47,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:48,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649806026] [2025-03-08 09:40:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649806026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:48,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:40:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887458449] [2025-03-08 09:40:48,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:48,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:40:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:48,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:40:48,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:40:48,152 INFO L87 Difference]: Start difference. First operand 1079 states and 1442 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:48,343 INFO L93 Difference]: Finished difference Result 1513 states and 2046 transitions. [2025-03-08 09:40:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:40:48,343 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:48,346 INFO L225 Difference]: With dead ends: 1513 [2025-03-08 09:40:48,346 INFO L226 Difference]: Without dead ends: 1292 [2025-03-08 09:40:48,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:40:48,347 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 134 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:48,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1074 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-08 09:40:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1138. [2025-03-08 09:40:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.3421284080914688) internal successors, (1526), 1137 states have internal predecessors, (1526), 0 states have call successors, (0), 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 09:40:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1526 transitions. [2025-03-08 09:40:48,356 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1526 transitions. Word has length 58 [2025-03-08 09:40:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:48,356 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1526 transitions. [2025-03-08 09:40:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1526 transitions. [2025-03-08 09:40:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:48,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:48,358 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:48,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 09:40:48,358 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash 919621756, now seen corresponding path program 1 times [2025-03-08 09:40:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136073013] [2025-03-08 09:40:48,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:48,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:48,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:48,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:48,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:48,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:48,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136073013] [2025-03-08 09:40:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136073013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:40:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718559213] [2025-03-08 09:40:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:48,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:40:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:48,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:40:48,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:40:48,587 INFO L87 Difference]: Start difference. First operand 1138 states and 1526 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:48,680 INFO L93 Difference]: Finished difference Result 1431 states and 1935 transitions. [2025-03-08 09:40:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:40:48,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:48,683 INFO L225 Difference]: With dead ends: 1431 [2025-03-08 09:40:48,683 INFO L226 Difference]: Without dead ends: 1111 [2025-03-08 09:40:48,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:40:48,684 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 41 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:48,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 768 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-03-08 09:40:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1069. [2025-03-08 09:40:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1068 states have (on average 1.3398876404494382) internal successors, (1431), 1068 states have internal predecessors, (1431), 0 states have call successors, (0), 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 09:40:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1431 transitions. [2025-03-08 09:40:48,691 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1431 transitions. Word has length 58 [2025-03-08 09:40:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:48,691 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1431 transitions. [2025-03-08 09:40:48,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1431 transitions. [2025-03-08 09:40:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:48,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:48,693 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:48,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 09:40:48,693 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 663620049, now seen corresponding path program 1 times [2025-03-08 09:40:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:48,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559393518] [2025-03-08 09:40:48,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:48,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:48,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:48,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:48,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559393518] [2025-03-08 09:40:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559393518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:49,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:49,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:40:49,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586209370] [2025-03-08 09:40:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:49,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:49,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:49,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:49,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:49,234 INFO L87 Difference]: Start difference. First operand 1069 states and 1431 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:49,449 INFO L93 Difference]: Finished difference Result 1348 states and 1828 transitions. [2025-03-08 09:40:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:40:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:49,451 INFO L225 Difference]: With dead ends: 1348 [2025-03-08 09:40:49,452 INFO L226 Difference]: Without dead ends: 1128 [2025-03-08 09:40:49,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:49,453 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:49,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1185 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-03-08 09:40:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1065. [2025-03-08 09:40:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1064 states have (on average 1.3402255639097744) internal successors, (1426), 1064 states have internal predecessors, (1426), 0 states have call successors, (0), 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 09:40:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1426 transitions. [2025-03-08 09:40:49,460 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1426 transitions. Word has length 58 [2025-03-08 09:40:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:49,460 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1426 transitions. [2025-03-08 09:40:49,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1426 transitions. [2025-03-08 09:40:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:49,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:49,462 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:49,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 09:40:49,462 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash -917611852, now seen corresponding path program 1 times [2025-03-08 09:40:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14402328] [2025-03-08 09:40:49,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:49,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:49,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:49,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:49,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:50,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:50,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14402328] [2025-03-08 09:40:50,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14402328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:50,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:50,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 09:40:50,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402316422] [2025-03-08 09:40:50,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:50,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 09:40:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:50,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 09:40:50,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:40:50,295 INFO L87 Difference]: Start difference. First operand 1065 states and 1426 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:50,817 INFO L93 Difference]: Finished difference Result 1412 states and 1929 transitions. [2025-03-08 09:40:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 09:40:50,818 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:50,820 INFO L225 Difference]: With dead ends: 1412 [2025-03-08 09:40:50,820 INFO L226 Difference]: Without dead ends: 1192 [2025-03-08 09:40:50,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:40:50,821 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:50,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1322 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:40:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-03-08 09:40:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1132. [2025-03-08 09:40:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.3457117595048629) internal successors, (1522), 1131 states have internal predecessors, (1522), 0 states have call successors, (0), 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 09:40:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1522 transitions. [2025-03-08 09:40:50,831 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1522 transitions. Word has length 58 [2025-03-08 09:40:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:50,831 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1522 transitions. [2025-03-08 09:40:50,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1522 transitions. [2025-03-08 09:40:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:50,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:50,833 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:50,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 09:40:50,834 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:50,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2024660303, now seen corresponding path program 1 times [2025-03-08 09:40:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826069895] [2025-03-08 09:40:50,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:50,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:50,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:50,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:50,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826069895] [2025-03-08 09:40:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826069895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:51,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 09:40:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461704954] [2025-03-08 09:40:51,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:51,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:40:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:51,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:40:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:40:51,094 INFO L87 Difference]: Start difference. First operand 1132 states and 1522 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:51,195 INFO L93 Difference]: Finished difference Result 1535 states and 2103 transitions. [2025-03-08 09:40:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 09:40:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:51,198 INFO L225 Difference]: With dead ends: 1535 [2025-03-08 09:40:51,198 INFO L226 Difference]: Without dead ends: 1221 [2025-03-08 09:40:51,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:40:51,199 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 48 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:51,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 870 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-08 09:40:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1198. [2025-03-08 09:40:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1197 states have (on average 1.33249791144528) internal successors, (1595), 1197 states have internal predecessors, (1595), 0 states have call successors, (0), 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 09:40:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1595 transitions. [2025-03-08 09:40:51,210 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1595 transitions. Word has length 58 [2025-03-08 09:40:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:51,210 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1595 transitions. [2025-03-08 09:40:51,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1595 transitions. [2025-03-08 09:40:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:51,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:51,212 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:51,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 09:40:51,212 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:51,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash -459175569, now seen corresponding path program 1 times [2025-03-08 09:40:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:51,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847265433] [2025-03-08 09:40:51,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:51,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:51,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:51,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:51,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:51,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:51,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847265433] [2025-03-08 09:40:51,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847265433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:40:51,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735195841] [2025-03-08 09:40:51,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:51,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:40:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:40:51,407 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 09:40:51,408 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 09:40:51,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:51,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:51,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:51,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:51,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 09:40:51,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:40:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:51,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:40:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735195841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:51,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:40:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2025-03-08 09:40:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410106827] [2025-03-08 09:40:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:51,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:40:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:51,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:40:51,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:40:51,976 INFO L87 Difference]: Start difference. First operand 1198 states and 1595 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:52,344 INFO L93 Difference]: Finished difference Result 1903 states and 2556 transitions. [2025-03-08 09:40:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 09:40:52,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:52,348 INFO L225 Difference]: With dead ends: 1903 [2025-03-08 09:40:52,348 INFO L226 Difference]: Without dead ends: 1679 [2025-03-08 09:40:52,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:40:52,349 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 285 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:52,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 887 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:40:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-03-08 09:40:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1280. [2025-03-08 09:40:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3330727130570759) internal successors, (1705), 1279 states have internal predecessors, (1705), 0 states have call successors, (0), 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 09:40:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1705 transitions. [2025-03-08 09:40:52,361 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1705 transitions. Word has length 58 [2025-03-08 09:40:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:52,361 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1705 transitions. [2025-03-08 09:40:52,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1705 transitions. [2025-03-08 09:40:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:52,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:52,363 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:52,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 09:40:52,563 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,SelfDestructingSolverStorable32 [2025-03-08 09:40:52,563 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:52,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1811870710, now seen corresponding path program 1 times [2025-03-08 09:40:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330190521] [2025-03-08 09:40:52,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:52,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:52,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:52,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:52,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:52,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330190521] [2025-03-08 09:40:52,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330190521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:52,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:52,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 09:40:52,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535331718] [2025-03-08 09:40:52,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:52,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:40:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:52,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:40:52,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:40:52,791 INFO L87 Difference]: Start difference. First operand 1280 states and 1705 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:52,872 INFO L93 Difference]: Finished difference Result 1551 states and 2103 transitions. [2025-03-08 09:40:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 09:40:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:52,875 INFO L225 Difference]: With dead ends: 1551 [2025-03-08 09:40:52,875 INFO L226 Difference]: Without dead ends: 1298 [2025-03-08 09:40:52,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:40:52,875 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 34 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:52,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 654 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-08 09:40:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1270. [2025-03-08 09:40:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 1.33096926713948) internal successors, (1689), 1269 states have internal predecessors, (1689), 0 states have call successors, (0), 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 09:40:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2025-03-08 09:40:52,884 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 58 [2025-03-08 09:40:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:52,884 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2025-03-08 09:40:52,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2025-03-08 09:40:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:52,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:52,885 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:52,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 09:40:52,885 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:52,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1300397295, now seen corresponding path program 1 times [2025-03-08 09:40:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:52,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441429578] [2025-03-08 09:40:52,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:52,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:52,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:52,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:52,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:53,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441429578] [2025-03-08 09:40:53,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441429578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:53,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:53,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 09:40:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560182694] [2025-03-08 09:40:53,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:53,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:40:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:53,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:40:53,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:40:53,271 INFO L87 Difference]: Start difference. First operand 1270 states and 1689 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:53,456 INFO L93 Difference]: Finished difference Result 1715 states and 2299 transitions. [2025-03-08 09:40:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 09:40:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:53,460 INFO L225 Difference]: With dead ends: 1715 [2025-03-08 09:40:53,460 INFO L226 Difference]: Without dead ends: 1458 [2025-03-08 09:40:53,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:40:53,460 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 91 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:53,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1370 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-03-08 09:40:53,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1250. [2025-03-08 09:40:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.3418734987990393) internal successors, (1676), 1249 states have internal predecessors, (1676), 0 states have call successors, (0), 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 09:40:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1676 transitions. [2025-03-08 09:40:53,470 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1676 transitions. Word has length 58 [2025-03-08 09:40:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:53,470 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1676 transitions. [2025-03-08 09:40:53,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1676 transitions. [2025-03-08 09:40:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:53,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:53,471 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:53,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 09:40:53,471 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:53,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash 273278882, now seen corresponding path program 1 times [2025-03-08 09:40:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608332537] [2025-03-08 09:40:53,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:53,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:53,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:53,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:53,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608332537] [2025-03-08 09:40:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608332537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:53,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:53,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:40:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070150777] [2025-03-08 09:40:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:40:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:53,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:40:53,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:40:53,941 INFO L87 Difference]: Start difference. First operand 1250 states and 1676 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:54,168 INFO L93 Difference]: Finished difference Result 1729 states and 2348 transitions. [2025-03-08 09:40:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 09:40:54,168 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:54,172 INFO L225 Difference]: With dead ends: 1729 [2025-03-08 09:40:54,172 INFO L226 Difference]: Without dead ends: 1472 [2025-03-08 09:40:54,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:40:54,173 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:54,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1280 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2025-03-08 09:40:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1330. [2025-03-08 09:40:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 1.3423626787057938) internal successors, (1784), 1329 states have internal predecessors, (1784), 0 states have call successors, (0), 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 09:40:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1784 transitions. [2025-03-08 09:40:54,182 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1784 transitions. Word has length 58 [2025-03-08 09:40:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:54,182 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1784 transitions. [2025-03-08 09:40:54,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1784 transitions. [2025-03-08 09:40:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:54,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:54,184 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:54,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 09:40:54,184 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1384314476, now seen corresponding path program 1 times [2025-03-08 09:40:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71205095] [2025-03-08 09:40:54,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:54,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:54,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:54,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:54,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71205095] [2025-03-08 09:40:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71205095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:54,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:40:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830600961] [2025-03-08 09:40:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:54,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:54,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:54,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:54,732 INFO L87 Difference]: Start difference. First operand 1330 states and 1784 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:54,973 INFO L93 Difference]: Finished difference Result 1651 states and 2235 transitions. [2025-03-08 09:40:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:40:54,974 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:54,976 INFO L225 Difference]: With dead ends: 1651 [2025-03-08 09:40:54,976 INFO L226 Difference]: Without dead ends: 1401 [2025-03-08 09:40:54,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:54,977 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:54,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1631 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-08 09:40:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1338. [2025-03-08 09:40:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1337 states have (on average 1.343305908750935) internal successors, (1796), 1337 states have internal predecessors, (1796), 0 states have call successors, (0), 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 09:40:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1796 transitions. [2025-03-08 09:40:54,987 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1796 transitions. Word has length 58 [2025-03-08 09:40:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:54,987 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 1796 transitions. [2025-03-08 09:40:54,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1796 transitions. [2025-03-08 09:40:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:54,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:54,988 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:54,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 09:40:54,988 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:54,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2040315303, now seen corresponding path program 1 times [2025-03-08 09:40:54,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:54,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896260145] [2025-03-08 09:40:54,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:54,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:55,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:55,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:55,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:55,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896260145] [2025-03-08 09:40:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896260145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:40:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051520938] [2025-03-08 09:40:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:55,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:40:55,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:55,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:40:55,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:40:55,250 INFO L87 Difference]: Start difference. First operand 1338 states and 1796 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:55,414 INFO L93 Difference]: Finished difference Result 2008 states and 2730 transitions. [2025-03-08 09:40:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:40:55,415 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:55,417 INFO L225 Difference]: With dead ends: 2008 [2025-03-08 09:40:55,417 INFO L226 Difference]: Without dead ends: 1520 [2025-03-08 09:40:55,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:40:55,418 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 132 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:55,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 545 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-03-08 09:40:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1492. [2025-03-08 09:40:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1491 states have (on average 1.313212608987257) internal successors, (1958), 1491 states have internal predecessors, (1958), 0 states have call successors, (0), 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 09:40:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1958 transitions. [2025-03-08 09:40:55,429 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1958 transitions. Word has length 58 [2025-03-08 09:40:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:55,429 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1958 transitions. [2025-03-08 09:40:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1958 transitions. [2025-03-08 09:40:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:55,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:55,431 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 09:40:55,431 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1631977612, now seen corresponding path program 1 times [2025-03-08 09:40:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571409503] [2025-03-08 09:40:55,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:55,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:55,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:55,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:55,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571409503] [2025-03-08 09:40:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571409503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:55,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:55,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 09:40:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776725040] [2025-03-08 09:40:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:55,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:40:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:55,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:40:55,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:40:55,582 INFO L87 Difference]: Start difference. First operand 1492 states and 1958 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:55,648 INFO L93 Difference]: Finished difference Result 1952 states and 2613 transitions. [2025-03-08 09:40:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:40:55,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:55,651 INFO L225 Difference]: With dead ends: 1952 [2025-03-08 09:40:55,651 INFO L226 Difference]: Without dead ends: 1468 [2025-03-08 09:40:55,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:40:55,652 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 30 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:55,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 644 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-03-08 09:40:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2025-03-08 09:40:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1467 states have (on average 1.2903885480572597) internal successors, (1893), 1467 states have internal predecessors, (1893), 0 states have call successors, (0), 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 09:40:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1893 transitions. [2025-03-08 09:40:55,663 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1893 transitions. Word has length 58 [2025-03-08 09:40:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:55,663 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1893 transitions. [2025-03-08 09:40:55,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1893 transitions. [2025-03-08 09:40:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:55,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:55,665 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:55,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 09:40:55,665 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:55,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1088205701, now seen corresponding path program 1 times [2025-03-08 09:40:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615929735] [2025-03-08 09:40:55,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:55,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:55,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:55,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:55,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615929735] [2025-03-08 09:40:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615929735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:55,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:55,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:40:55,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053082618] [2025-03-08 09:40:55,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:55,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:40:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:55,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:40:55,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:40:55,935 INFO L87 Difference]: Start difference. First operand 1468 states and 1893 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:56,095 INFO L93 Difference]: Finished difference Result 2154 states and 2813 transitions. [2025-03-08 09:40:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:40:56,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:56,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:56,097 INFO L225 Difference]: With dead ends: 2154 [2025-03-08 09:40:56,097 INFO L226 Difference]: Without dead ends: 1858 [2025-03-08 09:40:56,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:40:56,098 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 158 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:56,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 535 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-03-08 09:40:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1817. [2025-03-08 09:40:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1816 states have (on average 1.282488986784141) internal successors, (2329), 1816 states have internal predecessors, (2329), 0 states have call successors, (0), 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 09:40:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2329 transitions. [2025-03-08 09:40:56,109 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2329 transitions. Word has length 58 [2025-03-08 09:40:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:56,109 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2329 transitions. [2025-03-08 09:40:56,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2329 transitions. [2025-03-08 09:40:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:56,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:56,111 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:56,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 09:40:56,111 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:56,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash 316401097, now seen corresponding path program 1 times [2025-03-08 09:40:56,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:56,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326505131] [2025-03-08 09:40:56,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:56,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:56,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:56,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:56,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:56,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326505131] [2025-03-08 09:40:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326505131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:56,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:56,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 09:40:56,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600122685] [2025-03-08 09:40:56,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:56,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 09:40:56,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:56,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 09:40:56,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:40:56,413 INFO L87 Difference]: Start difference. First operand 1817 states and 2329 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:56,527 INFO L93 Difference]: Finished difference Result 2227 states and 2901 transitions. [2025-03-08 09:40:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 09:40:56,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:56,534 INFO L225 Difference]: With dead ends: 2227 [2025-03-08 09:40:56,534 INFO L226 Difference]: Without dead ends: 1857 [2025-03-08 09:40:56,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:40:56,535 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 73 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:56,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 643 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:40:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-03-08 09:40:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1801. [2025-03-08 09:40:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.2827777777777778) internal successors, (2309), 1800 states have internal predecessors, (2309), 0 states have call successors, (0), 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 09:40:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2309 transitions. [2025-03-08 09:40:56,546 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2309 transitions. Word has length 58 [2025-03-08 09:40:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:56,547 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2309 transitions. [2025-03-08 09:40:56,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2309 transitions. [2025-03-08 09:40:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:40:56,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:56,548 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:40:56,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 09:40:56,549 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1840834353, now seen corresponding path program 1 times [2025-03-08 09:40:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:56,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032806043] [2025-03-08 09:40:56,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:56,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:56,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:56,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:56,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032806043] [2025-03-08 09:40:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032806043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:40:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201556793] [2025-03-08 09:40:56,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:40:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:40:56,742 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 09:40:56,743 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 09:40:56,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:40:56,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:40:56,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:56,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:56,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 09:40:56,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:40:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:57,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:40:57,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201556793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:57,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:40:57,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2025-03-08 09:40:57,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389667345] [2025-03-08 09:40:57,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:57,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:40:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:57,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:40:57,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:40:57,242 INFO L87 Difference]: Start difference. First operand 1801 states and 2309 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:57,507 INFO L93 Difference]: Finished difference Result 3123 states and 4039 transitions. [2025-03-08 09:40:57,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:40:57,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:40:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:57,511 INFO L225 Difference]: With dead ends: 3123 [2025-03-08 09:40:57,511 INFO L226 Difference]: Without dead ends: 2771 [2025-03-08 09:40:57,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:40:57,512 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 159 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:57,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 706 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2025-03-08 09:40:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2610. [2025-03-08 09:40:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 1.282483710233806) internal successors, (3346), 2609 states have internal predecessors, (3346), 0 states have call successors, (0), 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 09:40:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3346 transitions. [2025-03-08 09:40:57,528 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3346 transitions. Word has length 58 [2025-03-08 09:40:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:57,528 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 3346 transitions. [2025-03-08 09:40:57,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:40:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3346 transitions. [2025-03-08 09:40:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:40:57,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:57,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:40:57,538 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 09:40:57,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:40:57,731 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1670693499, now seen corresponding path program 1 times [2025-03-08 09:40:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200254086] [2025-03-08 09:40:57,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:57,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:57,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:40:57,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:40:57,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:57,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:58,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:58,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200254086] [2025-03-08 09:40:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200254086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:58,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:58,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:40:58,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721046240] [2025-03-08 09:40:58,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:58,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:40:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:58,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:40:58,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:58,115 INFO L87 Difference]: Start difference. First operand 2610 states and 3346 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 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 09:40:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:58,300 INFO L93 Difference]: Finished difference Result 3537 states and 4604 transitions. [2025-03-08 09:40:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:40:58,300 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 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 59 [2025-03-08 09:40:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:58,304 INFO L225 Difference]: With dead ends: 3537 [2025-03-08 09:40:58,304 INFO L226 Difference]: Without dead ends: 3006 [2025-03-08 09:40:58,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:40:58,305 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 74 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:58,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1160 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2025-03-08 09:40:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2792. [2025-03-08 09:40:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2791 states have (on average 1.2758867789322823) internal successors, (3561), 2791 states have internal predecessors, (3561), 0 states have call successors, (0), 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 09:40:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 3561 transitions. [2025-03-08 09:40:58,323 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 3561 transitions. Word has length 59 [2025-03-08 09:40:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:58,323 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 3561 transitions. [2025-03-08 09:40:58,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 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 09:40:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3561 transitions. [2025-03-08 09:40:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:40:58,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:58,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:40:58,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 09:40:58,326 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1214031720, now seen corresponding path program 1 times [2025-03-08 09:40:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535248920] [2025-03-08 09:40:58,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:58,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:58,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:40:58,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:40:58,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:58,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:58,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535248920] [2025-03-08 09:40:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535248920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:58,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:58,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:40:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491001583] [2025-03-08 09:40:58,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:58,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:40:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:58,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:40:58,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:40:58,934 INFO L87 Difference]: Start difference. First operand 2792 states and 3561 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 09:40:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:59,186 INFO L93 Difference]: Finished difference Result 3490 states and 4530 transitions. [2025-03-08 09:40:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:40:59,187 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 59 [2025-03-08 09:40:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:59,190 INFO L225 Difference]: With dead ends: 3490 [2025-03-08 09:40:59,190 INFO L226 Difference]: Without dead ends: 2968 [2025-03-08 09:40:59,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:40:59,191 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 87 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:59,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1000 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2025-03-08 09:40:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2768. [2025-03-08 09:40:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2767 states have (on average 1.275027105168052) internal successors, (3528), 2767 states have internal predecessors, (3528), 0 states have call successors, (0), 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 09:40:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 3528 transitions. [2025-03-08 09:40:59,209 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 3528 transitions. Word has length 59 [2025-03-08 09:40:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:59,209 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 3528 transitions. [2025-03-08 09:40:59,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 09:40:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3528 transitions. [2025-03-08 09:40:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:40:59,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:59,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:40:59,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 09:40:59,211 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:59,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1084093678, now seen corresponding path program 1 times [2025-03-08 09:40:59,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:59,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441005486] [2025-03-08 09:40:59,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:59,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:40:59,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:40:59,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:59,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:40:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:40:59,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:40:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441005486] [2025-03-08 09:40:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441005486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:40:59,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:40:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 09:40:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142495352] [2025-03-08 09:40:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:40:59,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:40:59,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:40:59,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:40:59,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:40:59,506 INFO L87 Difference]: Start difference. First operand 2768 states and 3528 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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 09:40:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:40:59,729 INFO L93 Difference]: Finished difference Result 3511 states and 4579 transitions. [2025-03-08 09:40:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 09:40:59,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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 59 [2025-03-08 09:40:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:40:59,733 INFO L225 Difference]: With dead ends: 3511 [2025-03-08 09:40:59,733 INFO L226 Difference]: Without dead ends: 2979 [2025-03-08 09:40:59,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:40:59,734 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 297 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:40:59,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 870 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:40:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2025-03-08 09:40:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2781. [2025-03-08 09:40:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.275179856115108) internal successors, (3545), 2780 states have internal predecessors, (3545), 0 states have call successors, (0), 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 09:40:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3545 transitions. [2025-03-08 09:40:59,752 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3545 transitions. Word has length 59 [2025-03-08 09:40:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:40:59,752 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3545 transitions. [2025-03-08 09:40:59,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 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 09:40:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3545 transitions. [2025-03-08 09:40:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:40:59,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:40:59,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:40:59,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 09:40:59,754 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:40:59,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:40:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 911951169, now seen corresponding path program 1 times [2025-03-08 09:40:59,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:40:59,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431536659] [2025-03-08 09:40:59,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:40:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:40:59,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:40:59,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:40:59,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:40:59,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:00,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:00,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431536659] [2025-03-08 09:41:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431536659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:00,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:00,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 09:41:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248628607] [2025-03-08 09:41:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:00,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:41:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:00,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:41:00,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:00,321 INFO L87 Difference]: Start difference. First operand 2781 states and 3545 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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 09:41:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:00,735 INFO L93 Difference]: Finished difference Result 3491 states and 4548 transitions. [2025-03-08 09:41:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 09:41:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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 59 [2025-03-08 09:41:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:00,740 INFO L225 Difference]: With dead ends: 3491 [2025-03-08 09:41:00,740 INFO L226 Difference]: Without dead ends: 2956 [2025-03-08 09:41:00,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-03-08 09:41:00,741 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 290 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:00,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 851 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2025-03-08 09:41:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2695. [2025-03-08 09:41:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2694 states have (on average 1.2795100222717148) internal successors, (3447), 2694 states have internal predecessors, (3447), 0 states have call successors, (0), 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 09:41:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3447 transitions. [2025-03-08 09:41:00,769 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3447 transitions. Word has length 59 [2025-03-08 09:41:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:00,769 INFO L471 AbstractCegarLoop]: Abstraction has 2695 states and 3447 transitions. [2025-03-08 09:41:00,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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 09:41:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3447 transitions. [2025-03-08 09:41:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:41:00,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:00,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:00,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 09:41:00,772 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:00,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash 478165220, now seen corresponding path program 1 times [2025-03-08 09:41:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404534006] [2025-03-08 09:41:00,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:00,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:00,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:41:00,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:41:00,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:00,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404534006] [2025-03-08 09:41:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404534006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:41:00,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113262481] [2025-03-08 09:41:00,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:41:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:00,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:41:00,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:41:00,916 INFO L87 Difference]: Start difference. First operand 2695 states and 3447 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 09:41:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:01,042 INFO L93 Difference]: Finished difference Result 3466 states and 4509 transitions. [2025-03-08 09:41:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:41:01,042 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 59 [2025-03-08 09:41:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:01,045 INFO L225 Difference]: With dead ends: 3466 [2025-03-08 09:41:01,045 INFO L226 Difference]: Without dead ends: 2492 [2025-03-08 09:41:01,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:41:01,046 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 125 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:01,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 311 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-03-08 09:41:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2488. [2025-03-08 09:41:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 1.2798552472858866) internal successors, (3183), 2487 states have internal predecessors, (3183), 0 states have call successors, (0), 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 09:41:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3183 transitions. [2025-03-08 09:41:01,062 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3183 transitions. Word has length 59 [2025-03-08 09:41:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:01,062 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 3183 transitions. [2025-03-08 09:41:01,062 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 09:41:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3183 transitions. [2025-03-08 09:41:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:41:01,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:01,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:01,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 09:41:01,064 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:01,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:01,065 INFO L85 PathProgramCache]: Analyzing trace with hash -825867889, now seen corresponding path program 1 times [2025-03-08 09:41:01,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:01,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971033319] [2025-03-08 09:41:01,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:01,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:01,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:41:01,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:41:01,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:01,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971033319] [2025-03-08 09:41:01,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971033319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:01,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:01,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 09:41:01,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691758945] [2025-03-08 09:41:01,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:01,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 09:41:01,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:01,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 09:41:01,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:41:01,310 INFO L87 Difference]: Start difference. First operand 2488 states and 3183 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 09:41:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:01,399 INFO L93 Difference]: Finished difference Result 3143 states and 4100 transitions. [2025-03-08 09:41:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:41:01,399 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 59 [2025-03-08 09:41:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:01,402 INFO L225 Difference]: With dead ends: 3143 [2025-03-08 09:41:01,402 INFO L226 Difference]: Without dead ends: 2450 [2025-03-08 09:41:01,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:41:01,403 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 40 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:01,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 677 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2025-03-08 09:41:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2298. [2025-03-08 09:41:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2298 states, 2297 states have (on average 1.264257727470614) internal successors, (2904), 2297 states have internal predecessors, (2904), 0 states have call successors, (0), 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 09:41:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 2904 transitions. [2025-03-08 09:41:01,418 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 2904 transitions. Word has length 59 [2025-03-08 09:41:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:01,418 INFO L471 AbstractCegarLoop]: Abstraction has 2298 states and 2904 transitions. [2025-03-08 09:41:01,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 09:41:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2904 transitions. [2025-03-08 09:41:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:41:01,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:01,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:01,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 09:41:01,420 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:01,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash 500754996, now seen corresponding path program 1 times [2025-03-08 09:41:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572427839] [2025-03-08 09:41:01,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:01,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:41:01,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:41:01,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:01,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:01,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:01,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572427839] [2025-03-08 09:41:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572427839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 09:41:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131550398] [2025-03-08 09:41:01,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:01,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 09:41:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:01,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 09:41:01,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:41:01,672 INFO L87 Difference]: Start difference. First operand 2298 states and 2904 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 09:41:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:01,752 INFO L93 Difference]: Finished difference Result 2883 states and 3724 transitions. [2025-03-08 09:41:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:41:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 59 [2025-03-08 09:41:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:01,754 INFO L225 Difference]: With dead ends: 2883 [2025-03-08 09:41:01,754 INFO L226 Difference]: Without dead ends: 2286 [2025-03-08 09:41:01,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:41:01,755 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 30 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:01,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 674 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-03-08 09:41:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2116. [2025-03-08 09:41:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2115 states have (on average 1.2723404255319148) internal successors, (2691), 2115 states have internal predecessors, (2691), 0 states have call successors, (0), 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 09:41:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2691 transitions. [2025-03-08 09:41:01,768 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2691 transitions. Word has length 59 [2025-03-08 09:41:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:01,769 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 2691 transitions. [2025-03-08 09:41:01,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 09:41:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2691 transitions. [2025-03-08 09:41:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:41:01,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:01,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:01,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 09:41:01,771 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1605793543, now seen corresponding path program 1 times [2025-03-08 09:41:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416746056] [2025-03-08 09:41:01,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:01,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:01,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:41:01,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:41:01,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:01,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416746056] [2025-03-08 09:41:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416746056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:41:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925724148] [2025-03-08 09:41:01,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:01,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:41:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:01,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:41:01,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:41:01,883 INFO L87 Difference]: Start difference. First operand 2116 states and 2691 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 09:41:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:02,027 INFO L93 Difference]: Finished difference Result 2707 states and 3518 transitions. [2025-03-08 09:41:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:41:02,028 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 59 [2025-03-08 09:41:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:02,029 INFO L225 Difference]: With dead ends: 2707 [2025-03-08 09:41:02,029 INFO L226 Difference]: Without dead ends: 2031 [2025-03-08 09:41:02,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:41:02,031 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 113 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:02,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 310 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2025-03-08 09:41:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2027. [2025-03-08 09:41:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 1.2690029615004936) internal successors, (2571), 2026 states have internal predecessors, (2571), 0 states have call successors, (0), 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 09:41:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2571 transitions. [2025-03-08 09:41:02,041 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2571 transitions. Word has length 59 [2025-03-08 09:41:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:02,042 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 2571 transitions. [2025-03-08 09:41:02,042 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 09:41:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2571 transitions. [2025-03-08 09:41:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:41:02,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:02,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:02,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 09:41:02,043 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:02,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash -600751252, now seen corresponding path program 1 times [2025-03-08 09:41:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29605710] [2025-03-08 09:41:02,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:02,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:41:02,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:41:02,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:02,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29605710] [2025-03-08 09:41:02,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29605710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:02,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:02,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:41:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572693599] [2025-03-08 09:41:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:02,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:41:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:02,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:41:02,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:02,639 INFO L87 Difference]: Start difference. First operand 2027 states and 2571 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 09:41:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:02,844 INFO L93 Difference]: Finished difference Result 2708 states and 3499 transitions. [2025-03-08 09:41:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:41:02,844 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 59 [2025-03-08 09:41:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:02,846 INFO L225 Difference]: With dead ends: 2708 [2025-03-08 09:41:02,846 INFO L226 Difference]: Without dead ends: 2204 [2025-03-08 09:41:02,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:02,847 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 146 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:02,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 777 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2025-03-08 09:41:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2090. [2025-03-08 09:41:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 1.267113451412159) internal successors, (2647), 2089 states have internal predecessors, (2647), 0 states have call successors, (0), 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 09:41:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2647 transitions. [2025-03-08 09:41:02,860 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2647 transitions. Word has length 59 [2025-03-08 09:41:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:02,860 INFO L471 AbstractCegarLoop]: Abstraction has 2090 states and 2647 transitions. [2025-03-08 09:41:02,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 09:41:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2647 transitions. [2025-03-08 09:41:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:41:02,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:02,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 09:41:02,862 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash -142314969, now seen corresponding path program 1 times [2025-03-08 09:41:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:02,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633987774] [2025-03-08 09:41:02,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:02,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:41:02,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:41:02,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:02,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633987774] [2025-03-08 09:41:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633987774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:03,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:03,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 09:41:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875561242] [2025-03-08 09:41:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:03,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:41:03,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:03,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:41:03,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:41:03,048 INFO L87 Difference]: Start difference. First operand 2090 states and 2647 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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 09:41:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:03,177 INFO L93 Difference]: Finished difference Result 3017 states and 3929 transitions. [2025-03-08 09:41:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:41:03,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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 59 [2025-03-08 09:41:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:03,180 INFO L225 Difference]: With dead ends: 3017 [2025-03-08 09:41:03,180 INFO L226 Difference]: Without dead ends: 2513 [2025-03-08 09:41:03,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:41:03,181 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 237 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:03,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 592 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-03-08 09:41:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2355. [2025-03-08 09:41:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2354 states have (on average 1.279949022939677) internal successors, (3013), 2354 states have internal predecessors, (3013), 0 states have call successors, (0), 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 09:41:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3013 transitions. [2025-03-08 09:41:03,194 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3013 transitions. Word has length 59 [2025-03-08 09:41:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:03,195 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 3013 transitions. [2025-03-08 09:41:03,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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 09:41:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3013 transitions. [2025-03-08 09:41:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:41:03,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:03,196 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:03,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 09:41:03,197 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:03,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash -249230859, now seen corresponding path program 1 times [2025-03-08 09:41:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468350352] [2025-03-08 09:41:03,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:03,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:41:03,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:41:03,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:03,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:03,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468350352] [2025-03-08 09:41:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468350352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:41:03,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374011802] [2025-03-08 09:41:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:41:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:03,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:41:03,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:03,824 INFO L87 Difference]: Start difference. First operand 2355 states and 3013 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 09:41:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:04,143 INFO L93 Difference]: Finished difference Result 3422 states and 4506 transitions. [2025-03-08 09:41:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:41:04,143 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 59 [2025-03-08 09:41:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:04,145 INFO L225 Difference]: With dead ends: 3422 [2025-03-08 09:41:04,145 INFO L226 Difference]: Without dead ends: 2698 [2025-03-08 09:41:04,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:04,146 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 340 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:04,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1728 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-03-08 09:41:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2380. [2025-03-08 09:41:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 1.2833123160992013) internal successors, (3053), 2379 states have internal predecessors, (3053), 0 states have call successors, (0), 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 09:41:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3053 transitions. [2025-03-08 09:41:04,161 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3053 transitions. Word has length 59 [2025-03-08 09:41:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:04,161 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3053 transitions. [2025-03-08 09:41:04,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 09:41:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3053 transitions. [2025-03-08 09:41:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:41:04,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:04,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:04,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 09:41:04,163 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:04,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -215178839, now seen corresponding path program 1 times [2025-03-08 09:41:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688733771] [2025-03-08 09:41:04,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:04,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:41:04,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:41:04,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:04,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:04,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:04,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688733771] [2025-03-08 09:41:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688733771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:41:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399024165] [2025-03-08 09:41:04,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:04,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:41:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:04,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:41:04,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:04,681 INFO L87 Difference]: Start difference. First operand 2380 states and 3053 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 09:41:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:04,909 INFO L93 Difference]: Finished difference Result 3248 states and 4279 transitions. [2025-03-08 09:41:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:41:04,909 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 59 [2025-03-08 09:41:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:04,911 INFO L225 Difference]: With dead ends: 3248 [2025-03-08 09:41:04,911 INFO L226 Difference]: Without dead ends: 2485 [2025-03-08 09:41:04,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:04,913 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 131 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:04,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1268 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-08 09:41:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2384. [2025-03-08 09:41:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2383 states have (on average 1.2845153168275283) internal successors, (3061), 2383 states have internal predecessors, (3061), 0 states have call successors, (0), 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 09:41:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3061 transitions. [2025-03-08 09:41:04,933 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3061 transitions. Word has length 59 [2025-03-08 09:41:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:04,933 INFO L471 AbstractCegarLoop]: Abstraction has 2384 states and 3061 transitions. [2025-03-08 09:41:04,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 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 09:41:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3061 transitions. [2025-03-08 09:41:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:04,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:04,936 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:04,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 09:41:04,936 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:04,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:04,936 INFO L85 PathProgramCache]: Analyzing trace with hash -290556444, now seen corresponding path program 1 times [2025-03-08 09:41:04,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:04,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421309624] [2025-03-08 09:41:04,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:04,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:04,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:04,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:04,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:04,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:05,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:05,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421309624] [2025-03-08 09:41:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421309624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:05,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:41:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191253514] [2025-03-08 09:41:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:05,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:41:05,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:05,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:41:05,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:41:05,572 INFO L87 Difference]: Start difference. First operand 2384 states and 3061 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:05,853 INFO L93 Difference]: Finished difference Result 3219 states and 4236 transitions. [2025-03-08 09:41:05,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 09:41:05,854 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:05,856 INFO L225 Difference]: With dead ends: 3219 [2025-03-08 09:41:05,856 INFO L226 Difference]: Without dead ends: 2456 [2025-03-08 09:41:05,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:05,857 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 78 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:05,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1146 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-03-08 09:41:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2384. [2025-03-08 09:41:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2383 states have (on average 1.2845153168275283) internal successors, (3061), 2383 states have internal predecessors, (3061), 0 states have call successors, (0), 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 09:41:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3061 transitions. [2025-03-08 09:41:05,869 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3061 transitions. Word has length 60 [2025-03-08 09:41:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:05,869 INFO L471 AbstractCegarLoop]: Abstraction has 2384 states and 3061 transitions. [2025-03-08 09:41:05,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3061 transitions. [2025-03-08 09:41:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:05,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:05,871 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:05,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 09:41:05,871 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:05,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash 950816561, now seen corresponding path program 1 times [2025-03-08 09:41:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:05,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747918727] [2025-03-08 09:41:05,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:05,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:05,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:05,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:05,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:06,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:06,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747918727] [2025-03-08 09:41:06,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747918727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:06,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:06,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:41:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933448611] [2025-03-08 09:41:06,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:06,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:41:06,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:06,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:41:06,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:06,685 INFO L87 Difference]: Start difference. First operand 2384 states and 3061 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:07,019 INFO L93 Difference]: Finished difference Result 3341 states and 4398 transitions. [2025-03-08 09:41:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:41:07,019 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:07,021 INFO L225 Difference]: With dead ends: 3341 [2025-03-08 09:41:07,021 INFO L226 Difference]: Without dead ends: 2578 [2025-03-08 09:41:07,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:07,022 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 80 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:07,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1302 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-03-08 09:41:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2378. [2025-03-08 09:41:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2377 states have (on average 1.2852334875893985) internal successors, (3055), 2377 states have internal predecessors, (3055), 0 states have call successors, (0), 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 09:41:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3055 transitions. [2025-03-08 09:41:07,035 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3055 transitions. Word has length 60 [2025-03-08 09:41:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:07,035 INFO L471 AbstractCegarLoop]: Abstraction has 2378 states and 3055 transitions. [2025-03-08 09:41:07,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3055 transitions. [2025-03-08 09:41:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:07,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:07,037 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:07,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 09:41:07,037 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:07,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 127359844, now seen corresponding path program 1 times [2025-03-08 09:41:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:07,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181140174] [2025-03-08 09:41:07,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:07,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:07,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:07,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:07,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:07,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:07,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181140174] [2025-03-08 09:41:07,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181140174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:07,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:07,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 09:41:07,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980568724] [2025-03-08 09:41:07,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:07,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:41:07,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:07,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:41:07,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:07,439 INFO L87 Difference]: Start difference. First operand 2378 states and 3055 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:07,653 INFO L93 Difference]: Finished difference Result 3274 states and 4317 transitions. [2025-03-08 09:41:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 09:41:07,653 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:07,655 INFO L225 Difference]: With dead ends: 3274 [2025-03-08 09:41:07,655 INFO L226 Difference]: Without dead ends: 2503 [2025-03-08 09:41:07,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:07,657 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 99 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:07,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1286 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-03-08 09:41:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2441. [2025-03-08 09:41:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2440 states have (on average 1.2860655737704918) internal successors, (3138), 2440 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:41:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3138 transitions. [2025-03-08 09:41:07,671 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3138 transitions. Word has length 60 [2025-03-08 09:41:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:07,672 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3138 transitions. [2025-03-08 09:41:07,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3138 transitions. [2025-03-08 09:41:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:07,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:07,673 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:07,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 09:41:07,674 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:07,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1076494273, now seen corresponding path program 1 times [2025-03-08 09:41:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:07,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019127768] [2025-03-08 09:41:07,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:07,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:07,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:07,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:07,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:08,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:08,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019127768] [2025-03-08 09:41:08,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019127768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:08,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:08,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:41:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875675813] [2025-03-08 09:41:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:08,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:41:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:08,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:41:08,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:08,198 INFO L87 Difference]: Start difference. First operand 2441 states and 3138 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:08,410 INFO L93 Difference]: Finished difference Result 3238 states and 4268 transitions. [2025-03-08 09:41:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:41:08,411 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:08,412 INFO L225 Difference]: With dead ends: 3238 [2025-03-08 09:41:08,412 INFO L226 Difference]: Without dead ends: 2475 [2025-03-08 09:41:08,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:08,413 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 81 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:08,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1484 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2025-03-08 09:41:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2427. [2025-03-08 09:41:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2426 states have (on average 1.2873042044517724) internal successors, (3123), 2426 states have internal predecessors, (3123), 0 states have call successors, (0), 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 09:41:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3123 transitions. [2025-03-08 09:41:08,432 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3123 transitions. Word has length 60 [2025-03-08 09:41:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:08,432 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 3123 transitions. [2025-03-08 09:41:08,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3123 transitions. [2025-03-08 09:41:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:08,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:08,433 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:08,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 09:41:08,433 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:08,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1281840220, now seen corresponding path program 1 times [2025-03-08 09:41:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671618163] [2025-03-08 09:41:08,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:08,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:08,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:08,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:08,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:09,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671618163] [2025-03-08 09:41:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671618163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:09,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:09,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:09,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665027226] [2025-03-08 09:41:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:09,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:09,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:09,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:09,046 INFO L87 Difference]: Start difference. First operand 2427 states and 3123 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:09,266 INFO L93 Difference]: Finished difference Result 3248 states and 4287 transitions. [2025-03-08 09:41:09,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 09:41:09,267 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:09,268 INFO L225 Difference]: With dead ends: 3248 [2025-03-08 09:41:09,268 INFO L226 Difference]: Without dead ends: 2485 [2025-03-08 09:41:09,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:09,269 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:09,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1342 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-08 09:41:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2434. [2025-03-08 09:41:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 1.287299630086313) internal successors, (3132), 2433 states have internal predecessors, (3132), 0 states have call successors, (0), 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 09:41:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3132 transitions. [2025-03-08 09:41:09,281 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3132 transitions. Word has length 60 [2025-03-08 09:41:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:09,281 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 3132 transitions. [2025-03-08 09:41:09,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3132 transitions. [2025-03-08 09:41:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:09,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:09,282 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:09,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-08 09:41:09,282 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:09,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash -364321389, now seen corresponding path program 1 times [2025-03-08 09:41:09,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:09,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614841680] [2025-03-08 09:41:09,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:09,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:09,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:09,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:09,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614841680] [2025-03-08 09:41:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614841680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:09,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:09,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 09:41:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671591271] [2025-03-08 09:41:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:09,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:41:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:09,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:41:09,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:09,672 INFO L87 Difference]: Start difference. First operand 2434 states and 3132 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:09,832 INFO L93 Difference]: Finished difference Result 3376 states and 4439 transitions. [2025-03-08 09:41:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 09:41:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:09,834 INFO L225 Difference]: With dead ends: 3376 [2025-03-08 09:41:09,834 INFO L226 Difference]: Without dead ends: 2605 [2025-03-08 09:41:09,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:09,835 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 72 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:09,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1077 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-03-08 09:41:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2406. [2025-03-08 09:41:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 1.2906444906444907) internal successors, (3104), 2405 states have internal predecessors, (3104), 0 states have call successors, (0), 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 09:41:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3104 transitions. [2025-03-08 09:41:09,848 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3104 transitions. Word has length 60 [2025-03-08 09:41:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:09,848 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 3104 transitions. [2025-03-08 09:41:09,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3104 transitions. [2025-03-08 09:41:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:09,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:09,850 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:09,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-08 09:41:09,850 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:09,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:09,850 INFO L85 PathProgramCache]: Analyzing trace with hash -536463898, now seen corresponding path program 1 times [2025-03-08 09:41:09,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:09,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196808248] [2025-03-08 09:41:09,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:09,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:09,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:09,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:09,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:10,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196808248] [2025-03-08 09:41:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196808248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:10,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735188582] [2025-03-08 09:41:10,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:10,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:10,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:10,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:10,297 INFO L87 Difference]: Start difference. First operand 2406 states and 3104 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:10,479 INFO L93 Difference]: Finished difference Result 3340 states and 4399 transitions. [2025-03-08 09:41:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 09:41:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:10,480 INFO L225 Difference]: With dead ends: 3340 [2025-03-08 09:41:10,480 INFO L226 Difference]: Without dead ends: 2577 [2025-03-08 09:41:10,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:10,481 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 70 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:10,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 967 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-03-08 09:41:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2406. [2025-03-08 09:41:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 1.2906444906444907) internal successors, (3104), 2405 states have internal predecessors, (3104), 0 states have call successors, (0), 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 09:41:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3104 transitions. [2025-03-08 09:41:10,492 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3104 transitions. Word has length 60 [2025-03-08 09:41:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:10,492 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 3104 transitions. [2025-03-08 09:41:10,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3104 transitions. [2025-03-08 09:41:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:10,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:10,494 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:10,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-08 09:41:10,494 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:10,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 949090798, now seen corresponding path program 1 times [2025-03-08 09:41:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:10,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468672267] [2025-03-08 09:41:10,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:10,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:10,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:10,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:10,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:10,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:10,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468672267] [2025-03-08 09:41:10,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468672267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:10,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:10,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 09:41:10,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140917173] [2025-03-08 09:41:10,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:10,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 09:41:10,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:10,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 09:41:10,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:41:10,847 INFO L87 Difference]: Start difference. First operand 2406 states and 3104 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:11,164 INFO L93 Difference]: Finished difference Result 4295 states and 5690 transitions. [2025-03-08 09:41:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 09:41:11,164 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:11,167 INFO L225 Difference]: With dead ends: 4295 [2025-03-08 09:41:11,167 INFO L226 Difference]: Without dead ends: 3529 [2025-03-08 09:41:11,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:41:11,168 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 219 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:11,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1101 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2025-03-08 09:41:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2927. [2025-03-08 09:41:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2926 states have (on average 1.297676008202324) internal successors, (3797), 2926 states have internal predecessors, (3797), 0 states have call successors, (0), 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 09:41:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3797 transitions. [2025-03-08 09:41:11,185 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3797 transitions. Word has length 60 [2025-03-08 09:41:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:11,185 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 3797 transitions. [2025-03-08 09:41:11,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3797 transitions. [2025-03-08 09:41:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:11,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:11,187 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:11,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-08 09:41:11,187 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:11,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash 117746771, now seen corresponding path program 1 times [2025-03-08 09:41:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106681889] [2025-03-08 09:41:11,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:11,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:11,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:11,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:11,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:11,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106681889] [2025-03-08 09:41:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106681889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:11,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 09:41:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018628618] [2025-03-08 09:41:11,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:11,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 09:41:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:11,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 09:41:11,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:11,943 INFO L87 Difference]: Start difference. First operand 2927 states and 3797 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:12,295 INFO L93 Difference]: Finished difference Result 4117 states and 5449 transitions. [2025-03-08 09:41:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 09:41:12,296 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:12,299 INFO L225 Difference]: With dead ends: 4117 [2025-03-08 09:41:12,299 INFO L226 Difference]: Without dead ends: 3128 [2025-03-08 09:41:12,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:41:12,300 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 62 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:12,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1248 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2025-03-08 09:41:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2963. [2025-03-08 09:41:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 2962 states have (on average 1.2954085077650237) internal successors, (3837), 2962 states have internal predecessors, (3837), 0 states have call successors, (0), 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 09:41:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 3837 transitions. [2025-03-08 09:41:12,320 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 3837 transitions. Word has length 60 [2025-03-08 09:41:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:12,320 INFO L471 AbstractCegarLoop]: Abstraction has 2963 states and 3837 transitions. [2025-03-08 09:41:12,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 3837 transitions. [2025-03-08 09:41:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:12,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:12,322 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:12,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-08 09:41:12,322 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1359119776, now seen corresponding path program 1 times [2025-03-08 09:41:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846234662] [2025-03-08 09:41:12,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:12,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:12,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:12,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:12,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846234662] [2025-03-08 09:41:13,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846234662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:13,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:13,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743305130] [2025-03-08 09:41:13,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:13,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:13,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:13,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:13,041 INFO L87 Difference]: Start difference. First operand 2963 states and 3837 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:13,439 INFO L93 Difference]: Finished difference Result 4345 states and 5769 transitions. [2025-03-08 09:41:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:41:13,439 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:13,441 INFO L225 Difference]: With dead ends: 4345 [2025-03-08 09:41:13,441 INFO L226 Difference]: Without dead ends: 3354 [2025-03-08 09:41:13,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:13,443 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 82 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:13,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1603 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:41:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2025-03-08 09:41:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3103. [2025-03-08 09:41:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 3102 states have (on average 1.2965828497743392) internal successors, (4022), 3102 states have internal predecessors, (4022), 0 states have call successors, (0), 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 09:41:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4022 transitions. [2025-03-08 09:41:13,466 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4022 transitions. Word has length 60 [2025-03-08 09:41:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:13,466 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 4022 transitions. [2025-03-08 09:41:13,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4022 transitions. [2025-03-08 09:41:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:13,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:13,468 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:13,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-08 09:41:13,468 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:13,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash -960161182, now seen corresponding path program 1 times [2025-03-08 09:41:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:13,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136859266] [2025-03-08 09:41:13,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:13,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:13,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:13,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:13,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136859266] [2025-03-08 09:41:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136859266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301898987] [2025-03-08 09:41:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:13,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:13,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:13,965 INFO L87 Difference]: Start difference. First operand 3103 states and 4022 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:14,188 INFO L93 Difference]: Finished difference Result 4186 states and 5550 transitions. [2025-03-08 09:41:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 09:41:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:14,191 INFO L225 Difference]: With dead ends: 4186 [2025-03-08 09:41:14,191 INFO L226 Difference]: Without dead ends: 3197 [2025-03-08 09:41:14,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:14,192 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 111 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:14,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1253 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2025-03-08 09:41:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3098. [2025-03-08 09:41:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 3097 states have (on average 1.297061672586374) internal successors, (4017), 3097 states have internal predecessors, (4017), 0 states have call successors, (0), 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 09:41:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4017 transitions. [2025-03-08 09:41:14,225 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4017 transitions. Word has length 60 [2025-03-08 09:41:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:14,225 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 4017 transitions. [2025-03-08 09:41:14,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4017 transitions. [2025-03-08 09:41:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:14,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:14,227 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:14,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-08 09:41:14,227 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:14,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:14,228 INFO L85 PathProgramCache]: Analyzing trace with hash -486341525, now seen corresponding path program 1 times [2025-03-08 09:41:14,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:14,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572662902] [2025-03-08 09:41:14,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:14,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:14,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:14,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:14,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:14,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:14,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:14,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572662902] [2025-03-08 09:41:14,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572662902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:14,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:14,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:41:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413578950] [2025-03-08 09:41:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:41:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:14,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:41:14,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:41:14,639 INFO L87 Difference]: Start difference. First operand 3098 states and 4017 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:14,844 INFO L93 Difference]: Finished difference Result 4202 states and 5578 transitions. [2025-03-08 09:41:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:41:14,844 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:14,847 INFO L225 Difference]: With dead ends: 4202 [2025-03-08 09:41:14,847 INFO L226 Difference]: Without dead ends: 3049 [2025-03-08 09:41:14,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:41:14,848 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 76 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:14,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1164 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2025-03-08 09:41:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2878. [2025-03-08 09:41:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2877 states have (on average 1.2985749044143204) internal successors, (3736), 2877 states have internal predecessors, (3736), 0 states have call successors, (0), 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 09:41:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3736 transitions. [2025-03-08 09:41:14,864 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3736 transitions. Word has length 60 [2025-03-08 09:41:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:14,864 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 3736 transitions. [2025-03-08 09:41:14,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3736 transitions. [2025-03-08 09:41:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:14,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:14,865 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:14,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-08 09:41:14,865 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1583508649, now seen corresponding path program 1 times [2025-03-08 09:41:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985244567] [2025-03-08 09:41:14,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:14,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:14,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:14,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:14,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:15,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985244567] [2025-03-08 09:41:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985244567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:41:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425953329] [2025-03-08 09:41:15,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:15,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:41:15,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:41:15,017 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 09:41:15,017 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 09:41:15,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:15,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:15,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:15,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:15,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 09:41:15,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:41:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:15,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:41:15,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425953329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:15,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:41:15,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2025-03-08 09:41:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777382532] [2025-03-08 09:41:15,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:15,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 09:41:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:15,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 09:41:15,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:41:15,744 INFO L87 Difference]: Start difference. First operand 2878 states and 3736 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:16,086 INFO L93 Difference]: Finished difference Result 4133 states and 5485 transitions. [2025-03-08 09:41:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 09:41:16,086 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:16,089 INFO L225 Difference]: With dead ends: 4133 [2025-03-08 09:41:16,089 INFO L226 Difference]: Without dead ends: 3144 [2025-03-08 09:41:16,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:41:16,090 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 160 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:16,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 786 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2025-03-08 09:41:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2954. [2025-03-08 09:41:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2953 states have (on average 1.2959701997968167) internal successors, (3827), 2953 states have internal predecessors, (3827), 0 states have call successors, (0), 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 09:41:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3827 transitions. [2025-03-08 09:41:16,122 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3827 transitions. Word has length 60 [2025-03-08 09:41:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:16,122 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 3827 transitions. [2025-03-08 09:41:16,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3827 transitions. [2025-03-08 09:41:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:16,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:16,124 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:16,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 09:41:16,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:41:16,324 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:16,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash 556390236, now seen corresponding path program 1 times [2025-03-08 09:41:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685953347] [2025-03-08 09:41:16,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:16,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:16,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:16,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:16,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:16,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685953347] [2025-03-08 09:41:16,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685953347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:16,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:16,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:41:16,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274477804] [2025-03-08 09:41:16,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:16,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:41:16,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:16,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:41:16,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:41:16,777 INFO L87 Difference]: Start difference. First operand 2954 states and 3827 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:16,998 INFO L93 Difference]: Finished difference Result 4096 states and 5440 transitions. [2025-03-08 09:41:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:41:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:17,000 INFO L225 Difference]: With dead ends: 4096 [2025-03-08 09:41:17,000 INFO L226 Difference]: Without dead ends: 3080 [2025-03-08 09:41:17,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:41:17,001 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 230 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:17,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 640 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2025-03-08 09:41:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 2936. [2025-03-08 09:41:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2935 states have (on average 1.2977853492333902) internal successors, (3809), 2935 states have internal predecessors, (3809), 0 states have call successors, (0), 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 09:41:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 3809 transitions. [2025-03-08 09:41:17,019 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 3809 transitions. Word has length 60 [2025-03-08 09:41:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:17,019 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 3809 transitions. [2025-03-08 09:41:17,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3809 transitions. [2025-03-08 09:41:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:17,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:17,020 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:17,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-08 09:41:17,020 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:17,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash 622773461, now seen corresponding path program 1 times [2025-03-08 09:41:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161076216] [2025-03-08 09:41:17,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:17,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:17,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:17,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:17,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:17,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:17,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161076216] [2025-03-08 09:41:17,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161076216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:17,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:17,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-08 09:41:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182442056] [2025-03-08 09:41:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:17,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 09:41:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:17,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 09:41:17,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:41:17,820 INFO L87 Difference]: Start difference. First operand 2936 states and 3809 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:18,253 INFO L93 Difference]: Finished difference Result 4126 states and 5478 transitions. [2025-03-08 09:41:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 09:41:18,254 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:18,256 INFO L225 Difference]: With dead ends: 4126 [2025-03-08 09:41:18,256 INFO L226 Difference]: Without dead ends: 3094 [2025-03-08 09:41:18,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:41:18,257 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 79 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:18,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1353 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:41:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2025-03-08 09:41:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2991. [2025-03-08 09:41:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2990 states have (on average 1.2969899665551838) internal successors, (3878), 2990 states have internal predecessors, (3878), 0 states have call successors, (0), 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 09:41:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 3878 transitions. [2025-03-08 09:41:18,280 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 3878 transitions. Word has length 60 [2025-03-08 09:41:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:18,280 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 3878 transitions. [2025-03-08 09:41:18,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 3878 transitions. [2025-03-08 09:41:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:41:18,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:18,282 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:18,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-08 09:41:18,282 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:18,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1949396346, now seen corresponding path program 1 times [2025-03-08 09:41:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:18,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555233331] [2025-03-08 09:41:18,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:18,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:18,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:41:18,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:41:18,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:18,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:18,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:18,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555233331] [2025-03-08 09:41:18,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555233331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:18,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:18,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 09:41:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319098235] [2025-03-08 09:41:18,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:18,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:41:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:18,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:41:18,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:41:18,812 INFO L87 Difference]: Start difference. First operand 2991 states and 3878 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:18,964 INFO L93 Difference]: Finished difference Result 4214 states and 5593 transitions. [2025-03-08 09:41:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:41:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 09:41:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:18,966 INFO L225 Difference]: With dead ends: 4214 [2025-03-08 09:41:18,967 INFO L226 Difference]: Without dead ends: 3123 [2025-03-08 09:41:18,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:41:18,968 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 33 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:18,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1155 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2025-03-08 09:41:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 2873. [2025-03-08 09:41:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2872 states have (on average 1.3064066852367688) internal successors, (3752), 2872 states have internal predecessors, (3752), 0 states have call successors, (0), 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 09:41:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 3752 transitions. [2025-03-08 09:41:18,986 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 3752 transitions. Word has length 60 [2025-03-08 09:41:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:18,986 INFO L471 AbstractCegarLoop]: Abstraction has 2873 states and 3752 transitions. [2025-03-08 09:41:18,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:41:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 3752 transitions. [2025-03-08 09:41:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:18,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:18,988 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:18,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-08 09:41:18,988 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:18,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash 65943274, now seen corresponding path program 1 times [2025-03-08 09:41:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018672469] [2025-03-08 09:41:18,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:18,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:19,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:19,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:19,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:19,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:19,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:19,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018672469] [2025-03-08 09:41:19,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018672469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:19,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:19,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 09:41:19,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325831922] [2025-03-08 09:41:19,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:19,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 09:41:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:19,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 09:41:19,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:41:19,373 INFO L87 Difference]: Start difference. First operand 2873 states and 3752 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 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 09:41:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:19,516 INFO L93 Difference]: Finished difference Result 3976 states and 5303 transitions. [2025-03-08 09:41:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 09:41:19,516 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 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 61 [2025-03-08 09:41:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:19,519 INFO L225 Difference]: With dead ends: 3976 [2025-03-08 09:41:19,519 INFO L226 Difference]: Without dead ends: 2942 [2025-03-08 09:41:19,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:41:19,520 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:19,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 992 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2025-03-08 09:41:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2873. [2025-03-08 09:41:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2872 states have (on average 1.3064066852367688) internal successors, (3752), 2872 states have internal predecessors, (3752), 0 states have call successors, (0), 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 09:41:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 3752 transitions. [2025-03-08 09:41:19,536 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 3752 transitions. Word has length 61 [2025-03-08 09:41:19,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:19,536 INFO L471 AbstractCegarLoop]: Abstraction has 2873 states and 3752 transitions. [2025-03-08 09:41:19,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 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 09:41:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 3752 transitions. [2025-03-08 09:41:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:19,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:19,539 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:19,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-08 09:41:19,539 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash -106199235, now seen corresponding path program 1 times [2025-03-08 09:41:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704716548] [2025-03-08 09:41:19,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:19,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:19,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:19,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:19,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:20,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704716548] [2025-03-08 09:41:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704716548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:20,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429492941] [2025-03-08 09:41:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:20,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:20,002 INFO L87 Difference]: Start difference. First operand 2873 states and 3752 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 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 09:41:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:20,225 INFO L93 Difference]: Finished difference Result 3987 states and 5324 transitions. [2025-03-08 09:41:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 09:41:20,226 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 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 61 [2025-03-08 09:41:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:20,228 INFO L225 Difference]: With dead ends: 3987 [2025-03-08 09:41:20,228 INFO L226 Difference]: Without dead ends: 2955 [2025-03-08 09:41:20,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:20,230 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 68 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:20,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1517 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2025-03-08 09:41:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2861. [2025-03-08 09:41:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 1.3083916083916083) internal successors, (3742), 2860 states have internal predecessors, (3742), 0 states have call successors, (0), 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 09:41:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3742 transitions. [2025-03-08 09:41:20,247 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3742 transitions. Word has length 61 [2025-03-08 09:41:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:20,247 INFO L471 AbstractCegarLoop]: Abstraction has 2861 states and 3742 transitions. [2025-03-08 09:41:20,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 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 09:41:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3742 transitions. [2025-03-08 09:41:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:20,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:20,249 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:20,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-08 09:41:20,249 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:20,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash 548011434, now seen corresponding path program 1 times [2025-03-08 09:41:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158773526] [2025-03-08 09:41:20,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:20,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:20,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:20,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:20,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:21,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:21,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158773526] [2025-03-08 09:41:21,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158773526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:21,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:21,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-08 09:41:21,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733897841] [2025-03-08 09:41:21,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:21,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 09:41:21,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:21,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 09:41:21,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-03-08 09:41:21,123 INFO L87 Difference]: Start difference. First operand 2861 states and 3742 transitions. Second operand has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 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 09:41:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:21,657 INFO L93 Difference]: Finished difference Result 4099 states and 5462 transitions. [2025-03-08 09:41:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 09:41:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 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 61 [2025-03-08 09:41:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:21,660 INFO L225 Difference]: With dead ends: 4099 [2025-03-08 09:41:21,660 INFO L226 Difference]: Without dead ends: 3067 [2025-03-08 09:41:21,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2025-03-08 09:41:21,661 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 102 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:21,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1410 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:41:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2025-03-08 09:41:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 2877. [2025-03-08 09:41:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2876 states have (on average 1.3080667593880388) internal successors, (3762), 2876 states have internal predecessors, (3762), 0 states have call successors, (0), 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 09:41:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3762 transitions. [2025-03-08 09:41:21,677 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3762 transitions. Word has length 61 [2025-03-08 09:41:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:21,678 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 3762 transitions. [2025-03-08 09:41:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 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 09:41:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3762 transitions. [2025-03-08 09:41:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:21,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:21,679 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:21,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-03-08 09:41:21,679 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:21,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1906098122, now seen corresponding path program 1 times [2025-03-08 09:41:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954587937] [2025-03-08 09:41:21,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:21,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:22,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954587937] [2025-03-08 09:41:22,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954587937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:22,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:22,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 09:41:22,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5658012] [2025-03-08 09:41:22,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:22,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 09:41:22,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:22,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 09:41:22,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:41:22,068 INFO L87 Difference]: Start difference. First operand 2877 states and 3762 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 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 09:41:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:22,479 INFO L93 Difference]: Finished difference Result 4132 states and 5512 transitions. [2025-03-08 09:41:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:41:22,479 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 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 61 [2025-03-08 09:41:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:22,482 INFO L225 Difference]: With dead ends: 4132 [2025-03-08 09:41:22,482 INFO L226 Difference]: Without dead ends: 3100 [2025-03-08 09:41:22,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:41:22,484 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 306 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:22,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1012 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:41:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2025-03-08 09:41:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2805. [2025-03-08 09:41:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2804 states have (on average 1.3081312410841655) internal successors, (3668), 2804 states have internal predecessors, (3668), 0 states have call successors, (0), 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 09:41:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 3668 transitions. [2025-03-08 09:41:22,507 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 3668 transitions. Word has length 61 [2025-03-08 09:41:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:22,507 INFO L471 AbstractCegarLoop]: Abstraction has 2805 states and 3668 transitions. [2025-03-08 09:41:22,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 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 09:41:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 3668 transitions. [2025-03-08 09:41:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:22,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:22,509 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:22,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-08 09:41:22,509 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:22,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1026699199, now seen corresponding path program 1 times [2025-03-08 09:41:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:22,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488005809] [2025-03-08 09:41:22,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:22,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:22,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:22,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:22,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:22,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:22,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:22,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488005809] [2025-03-08 09:41:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488005809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 09:41:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597099081] [2025-03-08 09:41:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:22,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 09:41:22,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:22,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 09:41:22,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:41:22,932 INFO L87 Difference]: Start difference. First operand 2805 states and 3668 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 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 09:41:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:23,262 INFO L93 Difference]: Finished difference Result 4489 states and 6018 transitions. [2025-03-08 09:41:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 09:41:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 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 61 [2025-03-08 09:41:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:23,265 INFO L225 Difference]: With dead ends: 4489 [2025-03-08 09:41:23,265 INFO L226 Difference]: Without dead ends: 3414 [2025-03-08 09:41:23,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:23,267 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 307 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:23,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1083 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2025-03-08 09:41:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 2871. [2025-03-08 09:41:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2870 states have (on average 1.3142857142857143) internal successors, (3772), 2870 states have internal predecessors, (3772), 0 states have call successors, (0), 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 09:41:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3772 transitions. [2025-03-08 09:41:23,285 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3772 transitions. Word has length 61 [2025-03-08 09:41:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 3772 transitions. [2025-03-08 09:41:23,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 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 09:41:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3772 transitions. [2025-03-08 09:41:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:23,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:23,287 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-03-08 09:41:23,287 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash -161558949, now seen corresponding path program 1 times [2025-03-08 09:41:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283481197] [2025-03-08 09:41:23,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:23,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:23,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:23,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:23,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:23,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:23,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283481197] [2025-03-08 09:41:23,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283481197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:23,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:23,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 09:41:23,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557752023] [2025-03-08 09:41:23,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:23,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:41:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:23,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:41:23,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:23,684 INFO L87 Difference]: Start difference. First operand 2871 states and 3772 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 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 09:41:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:23,819 INFO L93 Difference]: Finished difference Result 4085 states and 5477 transitions. [2025-03-08 09:41:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 09:41:23,819 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 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 61 [2025-03-08 09:41:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:23,821 INFO L225 Difference]: With dead ends: 4085 [2025-03-08 09:41:23,821 INFO L226 Difference]: Without dead ends: 2959 [2025-03-08 09:41:23,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:23,823 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 45 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:23,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 900 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-03-08 09:41:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2912. [2025-03-08 09:41:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2911 states have (on average 1.310889728615596) internal successors, (3816), 2911 states have internal predecessors, (3816), 0 states have call successors, (0), 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 09:41:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 3816 transitions. [2025-03-08 09:41:23,838 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 3816 transitions. Word has length 61 [2025-03-08 09:41:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:23,838 INFO L471 AbstractCegarLoop]: Abstraction has 2912 states and 3816 transitions. [2025-03-08 09:41:23,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 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 09:41:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3816 transitions. [2025-03-08 09:41:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:23,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:23,839 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:23,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-03-08 09:41:23,839 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:23,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash -333701458, now seen corresponding path program 1 times [2025-03-08 09:41:23,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:23,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023765793] [2025-03-08 09:41:23,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:23,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:23,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:23,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:23,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023765793] [2025-03-08 09:41:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023765793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 09:41:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029074937] [2025-03-08 09:41:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 09:41:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:24,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 09:41:24,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:24,402 INFO L87 Difference]: Start difference. First operand 2912 states and 3816 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 09:41:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:24,634 INFO L93 Difference]: Finished difference Result 4349 states and 5831 transitions. [2025-03-08 09:41:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 09:41:24,634 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 61 [2025-03-08 09:41:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:24,637 INFO L225 Difference]: With dead ends: 4349 [2025-03-08 09:41:24,637 INFO L226 Difference]: Without dead ends: 3223 [2025-03-08 09:41:24,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:24,638 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:24,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1430 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2025-03-08 09:41:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2997. [2025-03-08 09:41:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2997 states, 2996 states have (on average 1.3124165554072096) internal successors, (3932), 2996 states have internal predecessors, (3932), 0 states have call successors, (0), 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 09:41:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3932 transitions. [2025-03-08 09:41:24,655 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3932 transitions. Word has length 61 [2025-03-08 09:41:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:24,655 INFO L471 AbstractCegarLoop]: Abstraction has 2997 states and 3932 transitions. [2025-03-08 09:41:24,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 09:41:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3932 transitions. [2025-03-08 09:41:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:24,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:24,657 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:24,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-03-08 09:41:24,657 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:24,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1938901207, now seen corresponding path program 1 times [2025-03-08 09:41:24,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:24,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882509359] [2025-03-08 09:41:24,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:24,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:24,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:24,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:24,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882509359] [2025-03-08 09:41:24,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882509359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:24,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:24,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 09:41:24,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857395117] [2025-03-08 09:41:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:24,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 09:41:24,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:24,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 09:41:24,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:41:24,901 INFO L87 Difference]: Start difference. First operand 2997 states and 3932 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 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 09:41:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:25,001 INFO L93 Difference]: Finished difference Result 4247 states and 5722 transitions. [2025-03-08 09:41:25,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 09:41:25,001 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 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 61 [2025-03-08 09:41:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:25,005 INFO L225 Difference]: With dead ends: 4247 [2025-03-08 09:41:25,005 INFO L226 Difference]: Without dead ends: 2988 [2025-03-08 09:41:25,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:41:25,007 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 34 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:25,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 884 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2025-03-08 09:41:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2924. [2025-03-08 09:41:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2923 states have (on average 1.298323640095792) internal successors, (3795), 2923 states have internal predecessors, (3795), 0 states have call successors, (0), 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 09:41:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 3795 transitions. [2025-03-08 09:41:25,024 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 3795 transitions. Word has length 61 [2025-03-08 09:41:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:25,025 INFO L471 AbstractCegarLoop]: Abstraction has 2924 states and 3795 transitions. [2025-03-08 09:41:25,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 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 09:41:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3795 transitions. [2025-03-08 09:41:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:25,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:25,026 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-03-08 09:41:25,026 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1787760911, now seen corresponding path program 1 times [2025-03-08 09:41:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714395093] [2025-03-08 09:41:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:25,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:25,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:25,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:25,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714395093] [2025-03-08 09:41:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714395093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-08 09:41:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144898809] [2025-03-08 09:41:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:25,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 09:41:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:25,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 09:41:25,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:41:25,796 INFO L87 Difference]: Start difference. First operand 2924 states and 3795 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 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 09:41:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:26,219 INFO L93 Difference]: Finished difference Result 4171 states and 5553 transitions. [2025-03-08 09:41:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 09:41:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 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 61 [2025-03-08 09:41:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:26,221 INFO L225 Difference]: With dead ends: 4171 [2025-03-08 09:41:26,221 INFO L226 Difference]: Without dead ends: 3045 [2025-03-08 09:41:26,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:41:26,223 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 100 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:26,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1399 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:41:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-03-08 09:41:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 2943. [2025-03-08 09:41:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2942 states have (on average 1.2994561522773624) internal successors, (3823), 2942 states have internal predecessors, (3823), 0 states have call successors, (0), 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 09:41:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 3823 transitions. [2025-03-08 09:41:26,240 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 3823 transitions. Word has length 61 [2025-03-08 09:41:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:26,240 INFO L471 AbstractCegarLoop]: Abstraction has 2943 states and 3823 transitions. [2025-03-08 09:41:26,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 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 09:41:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 3823 transitions. [2025-03-08 09:41:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:26,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:26,242 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:26,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-03-08 09:41:26,242 INFO L396 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:26,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash 852875900, now seen corresponding path program 1 times [2025-03-08 09:41:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:26,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005257164] [2025-03-08 09:41:26,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:26,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:26,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:26,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:26,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005257164] [2025-03-08 09:41:26,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005257164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:26,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:26,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 09:41:26,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326652763] [2025-03-08 09:41:26,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:26,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:41:26,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:26,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:41:26,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:41:26,598 INFO L87 Difference]: Start difference. First operand 2943 states and 3823 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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 09:41:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:26,951 INFO L93 Difference]: Finished difference Result 4331 states and 5750 transitions. [2025-03-08 09:41:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:41:26,952 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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 61 [2025-03-08 09:41:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:26,954 INFO L225 Difference]: With dead ends: 4331 [2025-03-08 09:41:26,954 INFO L226 Difference]: Without dead ends: 3205 [2025-03-08 09:41:26,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:41:26,955 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 355 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:26,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1129 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2025-03-08 09:41:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 2953. [2025-03-08 09:41:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2952 states have (on average 1.3001355013550135) internal successors, (3838), 2952 states have internal predecessors, (3838), 0 states have call successors, (0), 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 09:41:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3838 transitions. [2025-03-08 09:41:26,973 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3838 transitions. Word has length 61 [2025-03-08 09:41:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:26,973 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 3838 transitions. [2025-03-08 09:41:26,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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 09:41:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3838 transitions. [2025-03-08 09:41:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:41:26,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:26,975 INFO L218 NwaCegarLoop]: trace histogram [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 09:41:26,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-03-08 09:41:26,975 INFO L396 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:26,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash -626291371, now seen corresponding path program 1 times [2025-03-08 09:41:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:26,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117237011] [2025-03-08 09:41:26,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:26,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:41:26,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:41:26,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:26,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:27,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117237011] [2025-03-08 09:41:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117237011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-08 09:41:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83996064] [2025-03-08 09:41:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:27,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 09:41:27,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:27,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 09:41:27,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:41:27,752 INFO L87 Difference]: Start difference. First operand 2953 states and 3838 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 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 09:41:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:28,186 INFO L93 Difference]: Finished difference Result 4238 states and 5649 transitions. [2025-03-08 09:41:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 09:41:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 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 61 [2025-03-08 09:41:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:28,189 INFO L225 Difference]: With dead ends: 4238 [2025-03-08 09:41:28,189 INFO L226 Difference]: Without dead ends: 3100 [2025-03-08 09:41:28,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:41:28,190 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 104 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:28,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1269 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:41:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2025-03-08 09:41:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2953. [2025-03-08 09:41:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2952 states have (on average 1.3001355013550135) internal successors, (3838), 2952 states have internal predecessors, (3838), 0 states have call successors, (0), 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 09:41:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3838 transitions. [2025-03-08 09:41:28,205 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3838 transitions. Word has length 61 [2025-03-08 09:41:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 3838 transitions. [2025-03-08 09:41:28,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 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 09:41:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3838 transitions. [2025-03-08 09:41:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:28,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:28,207 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:28,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-03-08 09:41:28,207 INFO L396 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:28,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1034879169, now seen corresponding path program 1 times [2025-03-08 09:41:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:28,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333890652] [2025-03-08 09:41:28,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:28,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:28,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:28,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:28,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333890652] [2025-03-08 09:41:28,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333890652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:28,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:28,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 09:41:28,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208243836] [2025-03-08 09:41:28,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:28,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:41:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:28,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:41:28,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:28,655 INFO L87 Difference]: Start difference. First operand 2953 states and 3838 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:28,832 INFO L93 Difference]: Finished difference Result 4156 states and 5540 transitions. [2025-03-08 09:41:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 09:41:28,832 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:28,834 INFO L225 Difference]: With dead ends: 4156 [2025-03-08 09:41:28,834 INFO L226 Difference]: Without dead ends: 3016 [2025-03-08 09:41:28,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:28,836 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 59 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:28,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1253 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2025-03-08 09:41:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 2919. [2025-03-08 09:41:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2918 states have (on average 1.3022618231665524) internal successors, (3800), 2918 states have internal predecessors, (3800), 0 states have call successors, (0), 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 09:41:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3800 transitions. [2025-03-08 09:41:28,851 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3800 transitions. Word has length 62 [2025-03-08 09:41:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:28,852 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 3800 transitions. [2025-03-08 09:41:28,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3800 transitions. [2025-03-08 09:41:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:28,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:28,854 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:28,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-03-08 09:41:28,854 INFO L396 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:28,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash 291743716, now seen corresponding path program 1 times [2025-03-08 09:41:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046399006] [2025-03-08 09:41:28,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:28,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:28,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:28,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:28,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046399006] [2025-03-08 09:41:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046399006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 09:41:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023074661] [2025-03-08 09:41:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:29,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 09:41:29,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:29,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 09:41:29,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:41:29,220 INFO L87 Difference]: Start difference. First operand 2919 states and 3800 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:29,553 INFO L93 Difference]: Finished difference Result 4912 states and 6570 transitions. [2025-03-08 09:41:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 09:41:29,553 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:29,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:29,556 INFO L225 Difference]: With dead ends: 4912 [2025-03-08 09:41:29,556 INFO L226 Difference]: Without dead ends: 3772 [2025-03-08 09:41:29,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:29,558 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 229 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:29,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1228 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2025-03-08 09:41:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3199. [2025-03-08 09:41:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3199 states, 3198 states have (on average 1.310193871169481) internal successors, (4190), 3198 states have internal predecessors, (4190), 0 states have call successors, (0), 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 09:41:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 4190 transitions. [2025-03-08 09:41:29,580 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 4190 transitions. Word has length 62 [2025-03-08 09:41:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:29,580 INFO L471 AbstractCegarLoop]: Abstraction has 3199 states and 4190 transitions. [2025-03-08 09:41:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 4190 transitions. [2025-03-08 09:41:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:29,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:29,582 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:29,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-03-08 09:41:29,582 INFO L396 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:29,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 475002109, now seen corresponding path program 1 times [2025-03-08 09:41:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:29,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809205751] [2025-03-08 09:41:29,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:29,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:29,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:29,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:29,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809205751] [2025-03-08 09:41:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809205751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:30,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:30,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196668790] [2025-03-08 09:41:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:30,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:30,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:30,370 INFO L87 Difference]: Start difference. First operand 3199 states and 4190 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:30,710 INFO L93 Difference]: Finished difference Result 4822 states and 6475 transitions. [2025-03-08 09:41:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:41:30,710 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:30,712 INFO L225 Difference]: With dead ends: 4822 [2025-03-08 09:41:30,712 INFO L226 Difference]: Without dead ends: 3428 [2025-03-08 09:41:30,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:30,713 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 64 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:30,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1137 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2025-03-08 09:41:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 3204. [2025-03-08 09:41:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 1.3109584764283484) internal successors, (4199), 3203 states have internal predecessors, (4199), 0 states have call successors, (0), 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 09:41:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4199 transitions. [2025-03-08 09:41:30,729 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4199 transitions. Word has length 62 [2025-03-08 09:41:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:30,729 INFO L471 AbstractCegarLoop]: Abstraction has 3204 states and 4199 transitions. [2025-03-08 09:41:30,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4199 transitions. [2025-03-08 09:41:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:30,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:30,730 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:30,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-03-08 09:41:30,730 INFO L396 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:30,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:30,731 INFO L85 PathProgramCache]: Analyzing trace with hash 119601207, now seen corresponding path program 1 times [2025-03-08 09:41:30,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:30,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430382477] [2025-03-08 09:41:30,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:30,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:31,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:31,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430382477] [2025-03-08 09:41:31,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430382477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:31,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:31,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 09:41:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832988079] [2025-03-08 09:41:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:31,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 09:41:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:31,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 09:41:31,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:31,259 INFO L87 Difference]: Start difference. First operand 3204 states and 4199 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:31,482 INFO L93 Difference]: Finished difference Result 4690 states and 6290 transitions. [2025-03-08 09:41:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 09:41:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:31,485 INFO L225 Difference]: With dead ends: 4690 [2025-03-08 09:41:31,485 INFO L226 Difference]: Without dead ends: 3296 [2025-03-08 09:41:31,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:31,487 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:31,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1256 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states. [2025-03-08 09:41:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 3189. [2025-03-08 09:41:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3189 states, 3188 states have (on average 1.3114805520702635) internal successors, (4181), 3188 states have internal predecessors, (4181), 0 states have call successors, (0), 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 09:41:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4181 transitions. [2025-03-08 09:41:31,507 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4181 transitions. Word has length 62 [2025-03-08 09:41:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:31,507 INFO L471 AbstractCegarLoop]: Abstraction has 3189 states and 4181 transitions. [2025-03-08 09:41:31,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4181 transitions. [2025-03-08 09:41:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:31,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:31,509 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:31,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-03-08 09:41:31,509 INFO L396 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:31,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 727766456, now seen corresponding path program 1 times [2025-03-08 09:41:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603407141] [2025-03-08 09:41:31,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:31,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:31,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:31,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:31,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:32,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:32,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603407141] [2025-03-08 09:41:32,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603407141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:32,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:32,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:32,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884078702] [2025-03-08 09:41:32,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:32,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:32,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:32,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:32,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:32,158 INFO L87 Difference]: Start difference. First operand 3189 states and 4181 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:32,432 INFO L93 Difference]: Finished difference Result 4673 states and 6277 transitions. [2025-03-08 09:41:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:41:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:32,435 INFO L225 Difference]: With dead ends: 4673 [2025-03-08 09:41:32,435 INFO L226 Difference]: Without dead ends: 3279 [2025-03-08 09:41:32,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:32,436 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 85 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:32,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 992 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-03-08 09:41:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3157. [2025-03-08 09:41:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3157 states, 3156 states have (on average 1.3130544993662865) internal successors, (4144), 3156 states have internal predecessors, (4144), 0 states have call successors, (0), 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 09:41:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 4144 transitions. [2025-03-08 09:41:32,455 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 4144 transitions. Word has length 62 [2025-03-08 09:41:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:32,455 INFO L471 AbstractCegarLoop]: Abstraction has 3157 states and 4144 transitions. [2025-03-08 09:41:32,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 4144 transitions. [2025-03-08 09:41:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:32,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:32,457 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:32,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-03-08 09:41:32,457 INFO L396 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:32,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1523758808, now seen corresponding path program 1 times [2025-03-08 09:41:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:32,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006243495] [2025-03-08 09:41:32,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:32,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:32,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:32,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:32,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:32,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006243495] [2025-03-08 09:41:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006243495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:41:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349427601] [2025-03-08 09:41:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:32,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:41:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:32,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:41:32,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:41:32,679 INFO L87 Difference]: Start difference. First operand 3157 states and 4144 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:32,860 INFO L93 Difference]: Finished difference Result 4723 states and 6330 transitions. [2025-03-08 09:41:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:41:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:32,863 INFO L225 Difference]: With dead ends: 4723 [2025-03-08 09:41:32,863 INFO L226 Difference]: Without dead ends: 3325 [2025-03-08 09:41:32,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:41:32,864 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 274 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:32,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 580 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2025-03-08 09:41:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3167. [2025-03-08 09:41:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3166 states have (on average 1.3114339861023374) internal successors, (4152), 3166 states have internal predecessors, (4152), 0 states have call successors, (0), 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 09:41:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4152 transitions. [2025-03-08 09:41:32,896 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4152 transitions. Word has length 62 [2025-03-08 09:41:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:32,896 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 4152 transitions. [2025-03-08 09:41:32,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4152 transitions. [2025-03-08 09:41:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:32,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:32,898 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:32,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-03-08 09:41:32,898 INFO L396 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1351616299, now seen corresponding path program 1 times [2025-03-08 09:41:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796398727] [2025-03-08 09:41:32,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:32,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:32,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:32,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:32,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:33,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:33,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796398727] [2025-03-08 09:41:33,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796398727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:33,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:33,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 09:41:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082231821] [2025-03-08 09:41:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:33,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 09:41:33,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:33,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 09:41:33,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:33,452 INFO L87 Difference]: Start difference. First operand 3167 states and 4152 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:33,689 INFO L93 Difference]: Finished difference Result 4946 states and 6635 transitions. [2025-03-08 09:41:33,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 09:41:33,689 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:33,692 INFO L225 Difference]: With dead ends: 4946 [2025-03-08 09:41:33,692 INFO L226 Difference]: Without dead ends: 3546 [2025-03-08 09:41:33,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:41:33,693 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:33,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1567 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2025-03-08 09:41:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3175. [2025-03-08 09:41:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3174 states have (on average 1.311279143037177) internal successors, (4162), 3174 states have internal predecessors, (4162), 0 states have call successors, (0), 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 09:41:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4162 transitions. [2025-03-08 09:41:33,711 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4162 transitions. Word has length 62 [2025-03-08 09:41:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:33,711 INFO L471 AbstractCegarLoop]: Abstraction has 3175 states and 4162 transitions. [2025-03-08 09:41:33,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4162 transitions. [2025-03-08 09:41:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:33,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:33,712 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:33,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-03-08 09:41:33,712 INFO L396 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:33,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:33,713 INFO L85 PathProgramCache]: Analyzing trace with hash 975825938, now seen corresponding path program 1 times [2025-03-08 09:41:33,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:33,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184166372] [2025-03-08 09:41:33,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:33,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:33,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:33,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:33,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:34,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184166372] [2025-03-08 09:41:34,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184166372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:34,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:34,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 09:41:34,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20037195] [2025-03-08 09:41:34,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:34,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 09:41:34,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:34,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 09:41:34,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:41:34,047 INFO L87 Difference]: Start difference. First operand 3175 states and 4162 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:34,162 INFO L93 Difference]: Finished difference Result 4704 states and 6324 transitions. [2025-03-08 09:41:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 09:41:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:34,164 INFO L225 Difference]: With dead ends: 4704 [2025-03-08 09:41:34,165 INFO L226 Difference]: Without dead ends: 3304 [2025-03-08 09:41:34,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:41:34,166 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 58 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:34,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 852 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states. [2025-03-08 09:41:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 3137. [2025-03-08 09:41:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 3136 states have (on average 1.3137755102040816) internal successors, (4120), 3136 states have internal predecessors, (4120), 0 states have call successors, (0), 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 09:41:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 4120 transitions. [2025-03-08 09:41:34,182 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 4120 transitions. Word has length 62 [2025-03-08 09:41:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:34,182 INFO L471 AbstractCegarLoop]: Abstraction has 3137 states and 4120 transitions. [2025-03-08 09:41:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 4120 transitions. [2025-03-08 09:41:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:34,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:34,184 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:34,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-03-08 09:41:34,184 INFO L396 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash -285037150, now seen corresponding path program 1 times [2025-03-08 09:41:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108555568] [2025-03-08 09:41:34,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:34,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:34,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:34,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:34,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:34,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108555568] [2025-03-08 09:41:34,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108555568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:34,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:34,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 09:41:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969005578] [2025-03-08 09:41:34,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:34,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 09:41:34,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:34,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 09:41:34,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:41:34,493 INFO L87 Difference]: Start difference. First operand 3137 states and 4120 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:34,590 INFO L93 Difference]: Finished difference Result 4622 states and 6217 transitions. [2025-03-08 09:41:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 09:41:34,591 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:34,593 INFO L225 Difference]: With dead ends: 4622 [2025-03-08 09:41:34,593 INFO L226 Difference]: Without dead ends: 3186 [2025-03-08 09:41:34,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:41:34,594 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 65 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:34,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 669 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2025-03-08 09:41:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3048. [2025-03-08 09:41:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 3047 states have (on average 1.3167049556941253) internal successors, (4012), 3047 states have internal predecessors, (4012), 0 states have call successors, (0), 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 09:41:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4012 transitions. [2025-03-08 09:41:34,611 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4012 transitions. Word has length 62 [2025-03-08 09:41:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:34,611 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4012 transitions. [2025-03-08 09:41:34,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4012 transitions. [2025-03-08 09:41:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:34,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:34,613 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:34,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-03-08 09:41:34,613 INFO L396 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1294022705, now seen corresponding path program 1 times [2025-03-08 09:41:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217266773] [2025-03-08 09:41:34,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:34,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:34,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:34,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:34,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217266773] [2025-03-08 09:41:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217266773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:34,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:34,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:41:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162154596] [2025-03-08 09:41:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:34,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:41:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:34,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:41:34,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:41:34,954 INFO L87 Difference]: Start difference. First operand 3048 states and 4012 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:35,227 INFO L93 Difference]: Finished difference Result 4544 states and 6132 transitions. [2025-03-08 09:41:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:41:35,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:35,230 INFO L225 Difference]: With dead ends: 4544 [2025-03-08 09:41:35,230 INFO L226 Difference]: Without dead ends: 3144 [2025-03-08 09:41:35,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:41:35,231 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 293 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:35,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 667 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2025-03-08 09:41:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 3050. [2025-03-08 09:41:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 3049 states have (on average 1.3168251885864217) internal successors, (4015), 3049 states have internal predecessors, (4015), 0 states have call successors, (0), 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 09:41:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4015 transitions. [2025-03-08 09:41:35,248 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4015 transitions. Word has length 62 [2025-03-08 09:41:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:35,248 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 4015 transitions. [2025-03-08 09:41:35,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4015 transitions. [2025-03-08 09:41:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:35,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:35,249 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:35,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-03-08 09:41:35,249 INFO L396 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:35,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1277599753, now seen corresponding path program 1 times [2025-03-08 09:41:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:35,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388750639] [2025-03-08 09:41:35,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:35,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:35,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:35,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:35,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:35,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388750639] [2025-03-08 09:41:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388750639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:41:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728801341] [2025-03-08 09:41:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:41:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:35,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:41:35,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:41:35,460 INFO L87 Difference]: Start difference. First operand 3050 states and 4015 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:35,665 INFO L93 Difference]: Finished difference Result 4225 states and 5678 transitions. [2025-03-08 09:41:35,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:41:35,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:35,667 INFO L225 Difference]: With dead ends: 4225 [2025-03-08 09:41:35,667 INFO L226 Difference]: Without dead ends: 2436 [2025-03-08 09:41:35,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:41:35,669 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 128 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:35,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 385 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-03-08 09:41:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2432. [2025-03-08 09:41:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2431 states have (on average 1.316330728095434) internal successors, (3200), 2431 states have internal predecessors, (3200), 0 states have call successors, (0), 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 09:41:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3200 transitions. [2025-03-08 09:41:35,682 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3200 transitions. Word has length 62 [2025-03-08 09:41:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:35,682 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3200 transitions. [2025-03-08 09:41:35,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3200 transitions. [2025-03-08 09:41:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:35,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:35,683 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:35,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-03-08 09:41:35,683 INFO L396 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:35,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash -896979227, now seen corresponding path program 1 times [2025-03-08 09:41:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:35,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591138889] [2025-03-08 09:41:35,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:35,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:35,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:35,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:35,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:36,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:36,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591138889] [2025-03-08 09:41:36,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591138889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:36,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:36,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:41:36,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363126914] [2025-03-08 09:41:36,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:36,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:41:36,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:36,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:41:36,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:36,353 INFO L87 Difference]: Start difference. First operand 2432 states and 3200 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:36,609 INFO L93 Difference]: Finished difference Result 3637 states and 4892 transitions. [2025-03-08 09:41:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:41:36,609 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:36,611 INFO L225 Difference]: With dead ends: 3637 [2025-03-08 09:41:36,611 INFO L226 Difference]: Without dead ends: 2505 [2025-03-08 09:41:36,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:36,612 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:36,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1113 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-03-08 09:41:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2432. [2025-03-08 09:41:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2431 states have (on average 1.316330728095434) internal successors, (3200), 2431 states have internal predecessors, (3200), 0 states have call successors, (0), 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 09:41:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3200 transitions. [2025-03-08 09:41:36,624 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3200 transitions. Word has length 62 [2025-03-08 09:41:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:36,624 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3200 transitions. [2025-03-08 09:41:36,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3200 transitions. [2025-03-08 09:41:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:36,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:36,625 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:36,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-03-08 09:41:36,625 INFO L396 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:36,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1205205529, now seen corresponding path program 1 times [2025-03-08 09:41:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873633152] [2025-03-08 09:41:36,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:36,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:36,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:36,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:36,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:37,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:37,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873633152] [2025-03-08 09:41:37,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873633152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:37,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:37,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 09:41:37,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533112009] [2025-03-08 09:41:37,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:37,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 09:41:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:37,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 09:41:37,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:41:37,245 INFO L87 Difference]: Start difference. First operand 2432 states and 3200 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:37,618 INFO L93 Difference]: Finished difference Result 3773 states and 5083 transitions. [2025-03-08 09:41:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 09:41:37,618 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:37,620 INFO L225 Difference]: With dead ends: 3773 [2025-03-08 09:41:37,620 INFO L226 Difference]: Without dead ends: 2641 [2025-03-08 09:41:37,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:37,621 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 61 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:37,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1288 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2025-03-08 09:41:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2438. [2025-03-08 09:41:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 2437 states have (on average 1.3167829298317604) internal successors, (3209), 2437 states have internal predecessors, (3209), 0 states have call successors, (0), 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 09:41:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3209 transitions. [2025-03-08 09:41:37,635 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3209 transitions. Word has length 62 [2025-03-08 09:41:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:37,635 INFO L471 AbstractCegarLoop]: Abstraction has 2438 states and 3209 transitions. [2025-03-08 09:41:37,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3209 transitions. [2025-03-08 09:41:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:37,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:37,636 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:37,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-03-08 09:41:37,637 INFO L396 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:37,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:37,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1999262881, now seen corresponding path program 1 times [2025-03-08 09:41:37,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:37,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478090463] [2025-03-08 09:41:37,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:37,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:37,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:37,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:37,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478090463] [2025-03-08 09:41:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478090463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:37,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 09:41:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961575987] [2025-03-08 09:41:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:37,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:41:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:37,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:41:37,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:41:37,959 INFO L87 Difference]: Start difference. First operand 2438 states and 3209 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:38,063 INFO L93 Difference]: Finished difference Result 3603 states and 4863 transitions. [2025-03-08 09:41:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 09:41:38,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:38,065 INFO L225 Difference]: With dead ends: 3603 [2025-03-08 09:41:38,065 INFO L226 Difference]: Without dead ends: 2290 [2025-03-08 09:41:38,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:41:38,066 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 30 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:38,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 749 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-03-08 09:41:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2069. [2025-03-08 09:41:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2068 states have (on average 1.3205996131528046) internal successors, (2731), 2068 states have internal predecessors, (2731), 0 states have call successors, (0), 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 09:41:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2731 transitions. [2025-03-08 09:41:38,076 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2731 transitions. Word has length 62 [2025-03-08 09:41:38,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:38,076 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 2731 transitions. [2025-03-08 09:41:38,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2731 transitions. [2025-03-08 09:41:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:38,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:38,077 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-03-08 09:41:38,077 INFO L396 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:38,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash -103414490, now seen corresponding path program 1 times [2025-03-08 09:41:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:38,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907827953] [2025-03-08 09:41:38,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:38,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:38,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:38,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:38,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:38,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:38,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907827953] [2025-03-08 09:41:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907827953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 09:41:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625765705] [2025-03-08 09:41:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:38,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 09:41:38,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:38,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 09:41:38,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:41:38,386 INFO L87 Difference]: Start difference. First operand 2069 states and 2731 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:38,673 INFO L93 Difference]: Finished difference Result 3348 states and 4534 transitions. [2025-03-08 09:41:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 09:41:38,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:38,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:38,675 INFO L225 Difference]: With dead ends: 3348 [2025-03-08 09:41:38,675 INFO L226 Difference]: Without dead ends: 2216 [2025-03-08 09:41:38,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:41:38,676 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 169 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:38,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1076 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2025-03-08 09:41:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2071. [2025-03-08 09:41:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2070 states have (on average 1.3207729468599034) internal successors, (2734), 2070 states have internal predecessors, (2734), 0 states have call successors, (0), 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 09:41:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2734 transitions. [2025-03-08 09:41:38,687 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2734 transitions. Word has length 62 [2025-03-08 09:41:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:38,687 INFO L471 AbstractCegarLoop]: Abstraction has 2071 states and 2734 transitions. [2025-03-08 09:41:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2734 transitions. [2025-03-08 09:41:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:38,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:38,688 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:38,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-03-08 09:41:38,688 INFO L396 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:38,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1719183716, now seen corresponding path program 1 times [2025-03-08 09:41:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746738723] [2025-03-08 09:41:38,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:38,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:38,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:38,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:38,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:39,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:39,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746738723] [2025-03-08 09:41:39,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746738723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:39,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:39,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 09:41:39,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426287540] [2025-03-08 09:41:39,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:39,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 09:41:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:39,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 09:41:39,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:41:39,017 INFO L87 Difference]: Start difference. First operand 2071 states and 2734 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:39,206 INFO L93 Difference]: Finished difference Result 3571 states and 4811 transitions. [2025-03-08 09:41:39,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 09:41:39,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:39,208 INFO L225 Difference]: With dead ends: 3571 [2025-03-08 09:41:39,208 INFO L226 Difference]: Without dead ends: 2428 [2025-03-08 09:41:39,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:41:39,209 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 315 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:39,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 603 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:41:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2025-03-08 09:41:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2045. [2025-03-08 09:41:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 2044 states have (on average 1.3228962818003913) internal successors, (2704), 2044 states have internal predecessors, (2704), 0 states have call successors, (0), 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 09:41:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2704 transitions. [2025-03-08 09:41:39,230 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2704 transitions. Word has length 62 [2025-03-08 09:41:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:39,230 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 2704 transitions. [2025-03-08 09:41:39,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2704 transitions. [2025-03-08 09:41:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:39,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:39,231 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:39,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-03-08 09:41:39,231 INFO L396 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:39,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash 274035703, now seen corresponding path program 1 times [2025-03-08 09:41:39,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:39,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712911354] [2025-03-08 09:41:39,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:39,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:39,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:39,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:39,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:39,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:39,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712911354] [2025-03-08 09:41:39,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712911354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:39,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:39,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 09:41:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832679491] [2025-03-08 09:41:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:39,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 09:41:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:39,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 09:41:39,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:41:39,543 INFO L87 Difference]: Start difference. First operand 2045 states and 2704 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:39,672 INFO L93 Difference]: Finished difference Result 3335 states and 4488 transitions. [2025-03-08 09:41:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 09:41:39,673 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:39,674 INFO L225 Difference]: With dead ends: 3335 [2025-03-08 09:41:39,674 INFO L226 Difference]: Without dead ends: 2176 [2025-03-08 09:41:39,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:41:39,675 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 47 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:39,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1017 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2025-03-08 09:41:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2047. [2025-03-08 09:41:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 2046 states have (on average 1.3196480938416422) internal successors, (2700), 2046 states have internal predecessors, (2700), 0 states have call successors, (0), 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 09:41:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2700 transitions. [2025-03-08 09:41:39,685 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2700 transitions. Word has length 62 [2025-03-08 09:41:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:39,685 INFO L471 AbstractCegarLoop]: Abstraction has 2047 states and 2700 transitions. [2025-03-08 09:41:39,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2700 transitions. [2025-03-08 09:41:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:39,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:39,686 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:39,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-03-08 09:41:39,686 INFO L396 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:39,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash -437252437, now seen corresponding path program 1 times [2025-03-08 09:41:39,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:39,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965728575] [2025-03-08 09:41:39,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:39,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:39,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:39,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:39,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:39,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:39,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965728575] [2025-03-08 09:41:39,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965728575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:39,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:39,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:41:39,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546351821] [2025-03-08 09:41:39,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:39,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:41:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:39,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:41:39,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:41:39,891 INFO L87 Difference]: Start difference. First operand 2047 states and 2700 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:40,055 INFO L93 Difference]: Finished difference Result 3213 states and 4348 transitions. [2025-03-08 09:41:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:41:40,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:40,057 INFO L225 Difference]: With dead ends: 3213 [2025-03-08 09:41:40,057 INFO L226 Difference]: Without dead ends: 2090 [2025-03-08 09:41:40,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:41:40,058 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 183 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:40,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 616 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2025-03-08 09:41:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2015. [2025-03-08 09:41:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2014 states have (on average 1.3227408142999006) internal successors, (2664), 2014 states have internal predecessors, (2664), 0 states have call successors, (0), 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 09:41:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2664 transitions. [2025-03-08 09:41:40,068 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2664 transitions. Word has length 62 [2025-03-08 09:41:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:40,068 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 2664 transitions. [2025-03-08 09:41:40,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2664 transitions. [2025-03-08 09:41:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:41:40,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:40,069 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:41:40,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-03-08 09:41:40,069 INFO L396 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:40,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2121827860, now seen corresponding path program 1 times [2025-03-08 09:41:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:40,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159269582] [2025-03-08 09:41:40,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:40,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:41:40,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:41:40,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:40,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159269582] [2025-03-08 09:41:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159269582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:40,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:40,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598715295] [2025-03-08 09:41:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:40,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:40,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:40,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:40,803 INFO L87 Difference]: Start difference. First operand 2015 states and 2664 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:41,167 INFO L93 Difference]: Finished difference Result 3306 states and 4479 transitions. [2025-03-08 09:41:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 09:41:41,167 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-08 09:41:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:41,169 INFO L225 Difference]: With dead ends: 3306 [2025-03-08 09:41:41,169 INFO L226 Difference]: Without dead ends: 2187 [2025-03-08 09:41:41,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:41,170 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 107 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:41,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1165 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:41:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2025-03-08 09:41:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2030. [2025-03-08 09:41:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.3238048299655003) internal successors, (2686), 2029 states have internal predecessors, (2686), 0 states have call successors, (0), 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 09:41:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2686 transitions. [2025-03-08 09:41:41,180 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2686 transitions. Word has length 62 [2025-03-08 09:41:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:41,180 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2686 transitions. [2025-03-08 09:41:41,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:41:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2686 transitions. [2025-03-08 09:41:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 09:41:41,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:41,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:41,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-03-08 09:41:41,181 INFO L396 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:41,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:41,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2144760928, now seen corresponding path program 1 times [2025-03-08 09:41:41,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:41,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68564702] [2025-03-08 09:41:41,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:41,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:41,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 09:41:41,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 09:41:41,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:41,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:41,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:41,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68564702] [2025-03-08 09:41:41,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68564702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:41,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:41,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 09:41:41,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887680686] [2025-03-08 09:41:41,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:41,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:41:41,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:41,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:41:41,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:41,575 INFO L87 Difference]: Start difference. First operand 2030 states and 2686 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 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 09:41:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:41:41,680 INFO L93 Difference]: Finished difference Result 3210 states and 4344 transitions. [2025-03-08 09:41:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 09:41:41,681 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 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 63 [2025-03-08 09:41:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:41:41,682 INFO L225 Difference]: With dead ends: 3210 [2025-03-08 09:41:41,682 INFO L226 Difference]: Without dead ends: 2089 [2025-03-08 09:41:41,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-08 09:41:41,683 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 48 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:41:41,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 782 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:41:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-03-08 09:41:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2030. [2025-03-08 09:41:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.3238048299655003) internal successors, (2686), 2029 states have internal predecessors, (2686), 0 states have call successors, (0), 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 09:41:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2686 transitions. [2025-03-08 09:41:41,692 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2686 transitions. Word has length 63 [2025-03-08 09:41:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:41:41,692 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2686 transitions. [2025-03-08 09:41:41,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 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 09:41:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2686 transitions. [2025-03-08 09:41:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 09:41:41,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:41:41,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:41:41,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-03-08 09:41:41,693 INFO L396 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:41:41,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:41:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1504794631, now seen corresponding path program 1 times [2025-03-08 09:41:41,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:41:41,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911588595] [2025-03-08 09:41:41,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:41:41,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:41:41,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 09:41:41,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 09:41:41,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:41:41,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:41:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:41:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:41:42,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911588595] [2025-03-08 09:41:42,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911588595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:41:42,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:41:42,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-08 09:41:42,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826854543] [2025-03-08 09:41:42,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:41:42,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 09:41:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:41:42,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 09:41:42,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-08 09:41:42,301 INFO L87 Difference]: Start difference. First operand 2030 states and 2686 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 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)