./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0dd8fe71e3b230e27e0bcdd5294ae2e199a80395a1a4486d14620d239c5fffeb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:00:01,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:00:01,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:00:01,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:00:01,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:00:01,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:00:01,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:00:01,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:00:01,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:00:01,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:00:01,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:00:01,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:00:01,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:00:01,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:00:01,647 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:00:01,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:00:01,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:00:01,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:00:01,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:00:01,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:00:01,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:00:01,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:00:01,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:00:01,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:00:01,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:00:01,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:00:01,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:00:01,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:00:01,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:00:01,652 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-jdk21/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 -> 0dd8fe71e3b230e27e0bcdd5294ae2e199a80395a1a4486d14620d239c5fffeb [2025-02-08 00:00:01,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:00:01,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:00:01,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:00:01,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:00:01,931 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:00:01,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_2.c [2025-02-08 00:00:03,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b2e687ac/05491d1a44444068bafda2e3f194666d/FLAG870c8cced [2025-02-08 00:00:03,701 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:00:03,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_2.c [2025-02-08 00:00:03,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b2e687ac/05491d1a44444068bafda2e3f194666d/FLAG870c8cced [2025-02-08 00:00:03,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b2e687ac/05491d1a44444068bafda2e3f194666d [2025-02-08 00:00:03,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:00:03,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:00:03,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:00:03,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:00:03,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:00:03,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:00:03" (1/1) ... [2025-02-08 00:00:03,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba2db9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:03, skipping insertion in model container [2025-02-08 00:00:03,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:00:03" (1/1) ... [2025-02-08 00:00:03,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:00:04,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_2.c[1253,1266] [2025-02-08 00:00:04,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:00:04,201 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:00:04,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_2.c[1253,1266] [2025-02-08 00:00:04,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:00:04,312 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:00:04,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04 WrapperNode [2025-02-08 00:00:04,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:00:04,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:00:04,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:00:04,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:00:04,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,504 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1589 [2025-02-08 00:00:04,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:00:04,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:00:04,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:00:04,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:00:04,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,600 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-02-08 00:00:04,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:00:04,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:00:04,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:00:04,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:00:04,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:00:04,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:04,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:00:04,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:00:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:00:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:00:04,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:00:04,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:00:04,976 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:00:04,978 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:00:06,706 INFO L? ?]: Removed 995 outVars from TransFormulas that were not future-live. [2025-02-08 00:00:06,706 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:00:06,788 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:00:06,790 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:00:06,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:00:06 BoogieIcfgContainer [2025-02-08 00:00:06,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:00:06,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:00:06,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:00:06,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:00:06,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:00:03" (1/3) ... [2025-02-08 00:00:06,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5254c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:00:06, skipping insertion in model container [2025-02-08 00:00:06,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (2/3) ... [2025-02-08 00:00:06,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5254c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:00:06, skipping insertion in model container [2025-02-08 00:00:06,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:00:06" (3/3) ... [2025-02-08 00:00:06,799 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_ball2004_2.c [2025-02-08 00:00:06,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:00:06,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_ball2004_2.c that has 1 procedures, 476 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:00:06,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:00:06,900 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;@46d29bef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:00:06,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:00:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 476 states, 474 states have (on average 1.5) internal successors, (711), 475 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 00:00:06,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:06,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:06,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash 997462877, now seen corresponding path program 1 times [2025-02-08 00:00:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:06,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717196495] [2025-02-08 00:00:06,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:07,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 00:00:07,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 00:00:07,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:07,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:07,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717196495] [2025-02-08 00:00:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717196495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:07,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279429213] [2025-02-08 00:00:07,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:07,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:00:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:07,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:00:07,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:07,531 INFO L87 Difference]: Start difference. First operand has 476 states, 474 states have (on average 1.5) internal successors, (711), 475 states have internal predecessors, (711), 0 states have call successors, (0), 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 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:07,880 INFO L93 Difference]: Finished difference Result 887 states and 1327 transitions. [2025-02-08 00:00:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:00:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-02-08 00:00:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:07,889 INFO L225 Difference]: With dead ends: 887 [2025-02-08 00:00:07,889 INFO L226 Difference]: Without dead ends: 476 [2025-02-08 00:00:07,892 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-02-08 00:00:07,894 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 0 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:07,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1762 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-08 00:00:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2025-02-08 00:00:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.4947368421052631) internal successors, (710), 475 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 710 transitions. [2025-02-08 00:00:07,942 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 710 transitions. Word has length 40 [2025-02-08 00:00:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:07,943 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 710 transitions. [2025-02-08 00:00:07,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 710 transitions. [2025-02-08 00:00:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 00:00:07,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:07,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:07,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:00:07,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:07,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash 861257951, now seen corresponding path program 1 times [2025-02-08 00:00:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:07,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749304211] [2025-02-08 00:00:07,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:07,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 00:00:07,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 00:00:07,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:07,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:08,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749304211] [2025-02-08 00:00:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749304211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174734813] [2025-02-08 00:00:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:08,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:00:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:08,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:00:08,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:08,114 INFO L87 Difference]: Start difference. First operand 476 states and 710 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:08,404 INFO L93 Difference]: Finished difference Result 889 states and 1326 transitions. [2025-02-08 00:00:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:00:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-08 00:00:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:08,407 INFO L225 Difference]: With dead ends: 889 [2025-02-08 00:00:08,407 INFO L226 Difference]: Without dead ends: 478 [2025-02-08 00:00:08,408 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-02-08 00:00:08,409 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 0 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:08,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1759 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-08 00:00:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2025-02-08 00:00:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.4926624737945493) internal successors, (712), 477 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 712 transitions. [2025-02-08 00:00:08,436 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 712 transitions. Word has length 41 [2025-02-08 00:00:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:08,437 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 712 transitions. [2025-02-08 00:00:08,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 712 transitions. [2025-02-08 00:00:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 00:00:08,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:08,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:08,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:00:08,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:08,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1434264680, now seen corresponding path program 1 times [2025-02-08 00:00:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058251707] [2025-02-08 00:00:08,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:08,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 00:00:08,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 00:00:08,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:08,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:08,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:08,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058251707] [2025-02-08 00:00:08,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058251707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:08,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:08,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36918173] [2025-02-08 00:00:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:08,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:08,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:08,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:08,674 INFO L87 Difference]: Start difference. First operand 478 states and 712 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:09,098 INFO L93 Difference]: Finished difference Result 1262 states and 1881 transitions. [2025-02-08 00:00:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-08 00:00:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:09,102 INFO L225 Difference]: With dead ends: 1262 [2025-02-08 00:00:09,102 INFO L226 Difference]: Without dead ends: 849 [2025-02-08 00:00:09,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:09,104 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 1781 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:09,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1781 Valid, 1722 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-02-08 00:00:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 480. [2025-02-08 00:00:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.4906054279749479) internal successors, (714), 479 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 714 transitions. [2025-02-08 00:00:09,127 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 714 transitions. Word has length 42 [2025-02-08 00:00:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:09,127 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 714 transitions. [2025-02-08 00:00:09,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 714 transitions. [2025-02-08 00:00:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-08 00:00:09,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:09,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:09,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:00:09,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:09,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1463169558, now seen corresponding path program 1 times [2025-02-08 00:00:09,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:09,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179171294] [2025-02-08 00:00:09,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:09,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:09,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-08 00:00:10,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-08 00:00:10,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:10,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:11,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179171294] [2025-02-08 00:00:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179171294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:11,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:11,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294889868] [2025-02-08 00:00:11,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:11,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:11,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:11,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:11,375 INFO L87 Difference]: Start difference. First operand 480 states and 714 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:11,799 INFO L93 Difference]: Finished difference Result 1250 states and 1862 transitions. [2025-02-08 00:00:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:11,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-02-08 00:00:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:11,804 INFO L225 Difference]: With dead ends: 1250 [2025-02-08 00:00:11,804 INFO L226 Difference]: Without dead ends: 837 [2025-02-08 00:00:11,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:11,806 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1703 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:11,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 1720 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-08 00:00:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 555. [2025-02-08 00:00:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.4855595667870036) internal successors, (823), 554 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 823 transitions. [2025-02-08 00:00:11,823 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 823 transitions. Word has length 247 [2025-02-08 00:00:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:11,823 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 823 transitions. [2025-02-08 00:00:11,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 823 transitions. [2025-02-08 00:00:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-08 00:00:11,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:11,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:00:11,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1167324320, now seen corresponding path program 1 times [2025-02-08 00:00:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281745947] [2025-02-08 00:00:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:11,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-08 00:00:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-08 00:00:12,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:12,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:14,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:14,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281745947] [2025-02-08 00:00:14,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281745947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:14,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:14,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142034874] [2025-02-08 00:00:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:14,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:14,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:14,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:14,177 INFO L87 Difference]: Start difference. First operand 555 states and 823 transitions. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:14,547 INFO L93 Difference]: Finished difference Result 1250 states and 1860 transitions. [2025-02-08 00:00:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:14,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-02-08 00:00:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:14,550 INFO L225 Difference]: With dead ends: 1250 [2025-02-08 00:00:14,550 INFO L226 Difference]: Without dead ends: 837 [2025-02-08 00:00:14,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:14,555 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1611 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:14,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 1708 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-08 00:00:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 730. [2025-02-08 00:00:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.4869684499314129) internal successors, (1084), 729 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1084 transitions. [2025-02-08 00:00:14,574 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1084 transitions. Word has length 249 [2025-02-08 00:00:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:14,574 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1084 transitions. [2025-02-08 00:00:14,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1084 transitions. [2025-02-08 00:00:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-08 00:00:14,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:14,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:14,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:00:14,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:14,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1694645563, now seen corresponding path program 1 times [2025-02-08 00:00:14,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:14,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498638700] [2025-02-08 00:00:14,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:14,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-08 00:00:14,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-08 00:00:14,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:14,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:15,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:15,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498638700] [2025-02-08 00:00:15,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498638700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:15,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:15,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:15,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189309917] [2025-02-08 00:00:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:15,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:15,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:15,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:15,568 INFO L87 Difference]: Start difference. First operand 730 states and 1084 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:15,957 INFO L93 Difference]: Finished difference Result 1356 states and 2017 transitions. [2025-02-08 00:00:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-02-08 00:00:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:15,962 INFO L225 Difference]: With dead ends: 1356 [2025-02-08 00:00:15,962 INFO L226 Difference]: Without dead ends: 837 [2025-02-08 00:00:15,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:15,966 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 1663 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:15,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1663 Valid, 1719 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-08 00:00:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 730. [2025-02-08 00:00:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.48559670781893) internal successors, (1083), 729 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1083 transitions. [2025-02-08 00:00:15,991 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1083 transitions. Word has length 250 [2025-02-08 00:00:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:15,991 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1083 transitions. [2025-02-08 00:00:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1083 transitions. [2025-02-08 00:00:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-08 00:00:15,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:15,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:15,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:00:15,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:15,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1789974567, now seen corresponding path program 1 times [2025-02-08 00:00:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:15,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661410600] [2025-02-08 00:00:15,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:16,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-08 00:00:16,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-08 00:00:16,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:16,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:17,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:17,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661410600] [2025-02-08 00:00:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661410600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:17,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:17,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:17,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130736881] [2025-02-08 00:00:17,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:17,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:17,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:17,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:17,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:17,390 INFO L87 Difference]: Start difference. First operand 730 states and 1083 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:17,748 INFO L93 Difference]: Finished difference Result 1250 states and 1858 transitions. [2025-02-08 00:00:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:17,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-02-08 00:00:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:17,752 INFO L225 Difference]: With dead ends: 1250 [2025-02-08 00:00:17,752 INFO L226 Difference]: Without dead ends: 837 [2025-02-08 00:00:17,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:17,754 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 1569 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:17,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 1719 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-08 00:00:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 802. [2025-02-08 00:00:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 1.4856429463171037) internal successors, (1190), 801 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1190 transitions. [2025-02-08 00:00:17,772 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1190 transitions. Word has length 251 [2025-02-08 00:00:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:17,773 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1190 transitions. [2025-02-08 00:00:17,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1190 transitions. [2025-02-08 00:00:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-08 00:00:17,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:17,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:17,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:00:17,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:17,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:17,779 INFO L85 PathProgramCache]: Analyzing trace with hash 338302520, now seen corresponding path program 1 times [2025-02-08 00:00:17,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:17,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907017775] [2025-02-08 00:00:17,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:17,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:17,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 00:00:18,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 00:00:18,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:18,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:19,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907017775] [2025-02-08 00:00:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907017775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108081091] [2025-02-08 00:00:19,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:19,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:19,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:19,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:19,383 INFO L87 Difference]: Start difference. First operand 802 states and 1190 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:19,866 INFO L93 Difference]: Finished difference Result 1324 states and 1967 transitions. [2025-02-08 00:00:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:19,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2025-02-08 00:00:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:19,871 INFO L225 Difference]: With dead ends: 1324 [2025-02-08 00:00:19,871 INFO L226 Difference]: Without dead ends: 845 [2025-02-08 00:00:19,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:19,873 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1625 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:19,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 2712 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-02-08 00:00:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 804. [2025-02-08 00:00:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 1.4844333748443337) internal successors, (1192), 803 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1192 transitions. [2025-02-08 00:00:19,896 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1192 transitions. Word has length 252 [2025-02-08 00:00:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:19,898 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1192 transitions. [2025-02-08 00:00:19,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1192 transitions. [2025-02-08 00:00:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-08 00:00:19,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:19,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:19,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:00:19,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:19,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:19,904 INFO L85 PathProgramCache]: Analyzing trace with hash 454668924, now seen corresponding path program 1 times [2025-02-08 00:00:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132656617] [2025-02-08 00:00:19,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:19,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-08 00:00:20,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-08 00:00:20,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:20,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:21,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:21,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132656617] [2025-02-08 00:00:21,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132656617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:21,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:21,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:21,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363113260] [2025-02-08 00:00:21,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:21,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:21,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:21,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:21,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:21,383 INFO L87 Difference]: Start difference. First operand 804 states and 1192 transitions. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:21,799 INFO L93 Difference]: Finished difference Result 1396 states and 2072 transitions. [2025-02-08 00:00:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:21,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2025-02-08 00:00:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:21,803 INFO L225 Difference]: With dead ends: 1396 [2025-02-08 00:00:21,803 INFO L226 Difference]: Without dead ends: 839 [2025-02-08 00:00:21,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:21,804 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1640 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:21,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1708 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-02-08 00:00:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 804. [2025-02-08 00:00:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 1.4831880448318804) internal successors, (1191), 803 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1191 transitions. [2025-02-08 00:00:21,822 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1191 transitions. Word has length 253 [2025-02-08 00:00:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:21,823 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1191 transitions. [2025-02-08 00:00:21,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1191 transitions. [2025-02-08 00:00:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-08 00:00:21,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:21,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:21,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:00:21,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:21,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1417865203, now seen corresponding path program 1 times [2025-02-08 00:00:21,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:21,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459920029] [2025-02-08 00:00:21,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:21,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:21,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-08 00:00:22,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-08 00:00:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459920029] [2025-02-08 00:00:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459920029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347311079] [2025-02-08 00:00:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:22,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:22,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:22,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:22,967 INFO L87 Difference]: Start difference. First operand 804 states and 1191 transitions. Second operand has 6 states, 6 states have (on average 42.333333333333336) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:23,299 INFO L93 Difference]: Finished difference Result 1432 states and 2124 transitions. [2025-02-08 00:00:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:23,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.333333333333336) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-02-08 00:00:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:23,303 INFO L225 Difference]: With dead ends: 1432 [2025-02-08 00:00:23,303 INFO L226 Difference]: Without dead ends: 839 [2025-02-08 00:00:23,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:23,304 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1658 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 1720 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 1720 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-02-08 00:00:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 804. [2025-02-08 00:00:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 1.481942714819427) internal successors, (1190), 803 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2025-02-08 00:00:23,319 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 254 [2025-02-08 00:00:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:23,320 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2025-02-08 00:00:23,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.333333333333336) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2025-02-08 00:00:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-08 00:00:23,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:23,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:23,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:00:23,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:23,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:23,324 INFO L85 PathProgramCache]: Analyzing trace with hash -981948343, now seen corresponding path program 1 times [2025-02-08 00:00:23,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:23,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074447495] [2025-02-08 00:00:23,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:23,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:23,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-08 00:00:23,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-08 00:00:23,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:23,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:24,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:24,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074447495] [2025-02-08 00:00:24,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074447495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:24,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044735071] [2025-02-08 00:00:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:24,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:24,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:24,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:24,373 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:24,844 INFO L93 Difference]: Finished difference Result 1400 states and 2076 transitions. [2025-02-08 00:00:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-02-08 00:00:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:24,847 INFO L225 Difference]: With dead ends: 1400 [2025-02-08 00:00:24,848 INFO L226 Difference]: Without dead ends: 847 [2025-02-08 00:00:24,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:24,849 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1656 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:24,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2852 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-02-08 00:00:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 806. [2025-02-08 00:00:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.4807453416149068) internal successors, (1192), 805 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1192 transitions. [2025-02-08 00:00:24,867 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1192 transitions. Word has length 255 [2025-02-08 00:00:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1192 transitions. [2025-02-08 00:00:24,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1192 transitions. [2025-02-08 00:00:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-08 00:00:24,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:24,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:24,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:00:24,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:24,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 654972155, now seen corresponding path program 1 times [2025-02-08 00:00:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894058988] [2025-02-08 00:00:24,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:24,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-08 00:00:25,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-08 00:00:25,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:25,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894058988] [2025-02-08 00:00:26,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894058988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:26,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:26,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202661043] [2025-02-08 00:00:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:26,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:26,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:26,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:26,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:26,056 INFO L87 Difference]: Start difference. First operand 806 states and 1192 transitions. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:26,452 INFO L93 Difference]: Finished difference Result 1362 states and 2018 transitions. [2025-02-08 00:00:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-02-08 00:00:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:26,457 INFO L225 Difference]: With dead ends: 1362 [2025-02-08 00:00:26,457 INFO L226 Difference]: Without dead ends: 841 [2025-02-08 00:00:26,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:26,459 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 1615 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:26,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1615 Valid, 1719 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-02-08 00:00:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 806. [2025-02-08 00:00:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.479503105590062) internal successors, (1191), 805 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1191 transitions. [2025-02-08 00:00:26,478 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1191 transitions. Word has length 256 [2025-02-08 00:00:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:26,479 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1191 transitions. [2025-02-08 00:00:26,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1191 transitions. [2025-02-08 00:00:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-08 00:00:26,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:26,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:26,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:00:26,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1160071777, now seen corresponding path program 1 times [2025-02-08 00:00:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:26,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583608894] [2025-02-08 00:00:26,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:26,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-08 00:00:27,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-08 00:00:27,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:27,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:27,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:27,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583608894] [2025-02-08 00:00:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583608894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:27,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:27,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282557486] [2025-02-08 00:00:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:27,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:27,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:27,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:27,925 INFO L87 Difference]: Start difference. First operand 806 states and 1191 transitions. Second operand has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:28,419 INFO L93 Difference]: Finished difference Result 1366 states and 2023 transitions. [2025-02-08 00:00:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-02-08 00:00:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:28,424 INFO L225 Difference]: With dead ends: 1366 [2025-02-08 00:00:28,424 INFO L226 Difference]: Without dead ends: 849 [2025-02-08 00:00:28,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:28,426 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1634 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:28,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 2709 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-02-08 00:00:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 808. [2025-02-08 00:00:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.4783147459727386) internal successors, (1193), 807 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1193 transitions. [2025-02-08 00:00:28,448 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1193 transitions. Word has length 257 [2025-02-08 00:00:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:28,449 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1193 transitions. [2025-02-08 00:00:28,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1193 transitions. [2025-02-08 00:00:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-08 00:00:28,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:28,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:28,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:00:28,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:28,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash -190801002, now seen corresponding path program 1 times [2025-02-08 00:00:28,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:28,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387315030] [2025-02-08 00:00:28,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:28,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:28,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-08 00:00:29,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-08 00:00:29,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:29,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:29,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387315030] [2025-02-08 00:00:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387315030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:29,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:29,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:29,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483423546] [2025-02-08 00:00:29,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:29,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:29,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:29,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:29,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:29,879 INFO L87 Difference]: Start difference. First operand 808 states and 1193 transitions. Second operand has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:30,420 INFO L93 Difference]: Finished difference Result 1330 states and 1970 transitions. [2025-02-08 00:00:30,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2025-02-08 00:00:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:30,424 INFO L225 Difference]: With dead ends: 1330 [2025-02-08 00:00:30,425 INFO L226 Difference]: Without dead ends: 855 [2025-02-08 00:00:30,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:30,426 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1623 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:30,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 2852 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:00:30,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-02-08 00:00:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 810. [2025-02-08 00:00:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 1.477132262051916) internal successors, (1195), 809 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1195 transitions. [2025-02-08 00:00:30,442 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1195 transitions. Word has length 258 [2025-02-08 00:00:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:30,443 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1195 transitions. [2025-02-08 00:00:30,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1195 transitions. [2025-02-08 00:00:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-08 00:00:30,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:30,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:30,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:00:30,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:30,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -844882990, now seen corresponding path program 1 times [2025-02-08 00:00:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093989986] [2025-02-08 00:00:30,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:30,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-08 00:00:30,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-08 00:00:30,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:30,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:31,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:31,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093989986] [2025-02-08 00:00:31,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093989986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:31,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:31,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871509911] [2025-02-08 00:00:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:31,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:31,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:31,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:31,451 INFO L87 Difference]: Start difference. First operand 810 states and 1195 transitions. Second operand has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:31,975 INFO L93 Difference]: Finished difference Result 1372 states and 2029 transitions. [2025-02-08 00:00:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:31,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2025-02-08 00:00:31,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:31,980 INFO L225 Difference]: With dead ends: 1372 [2025-02-08 00:00:31,980 INFO L226 Difference]: Without dead ends: 857 [2025-02-08 00:00:31,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:31,983 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1644 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:31,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 2574 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:00:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-02-08 00:00:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 812. [2025-02-08 00:00:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.4759556103575833) internal successors, (1197), 811 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1197 transitions. [2025-02-08 00:00:32,004 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1197 transitions. Word has length 258 [2025-02-08 00:00:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:32,004 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1197 transitions. [2025-02-08 00:00:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 6 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1197 transitions. [2025-02-08 00:00:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-08 00:00:32,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:32,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:32,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:00:32,008 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:32,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1873586585, now seen corresponding path program 1 times [2025-02-08 00:00:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:32,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987324839] [2025-02-08 00:00:32,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:32,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-08 00:00:32,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-08 00:00:32,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:32,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987324839] [2025-02-08 00:00:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987324839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258439441] [2025-02-08 00:00:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:33,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:33,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:33,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:33,388 INFO L87 Difference]: Start difference. First operand 812 states and 1197 transitions. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:33,748 INFO L93 Difference]: Finished difference Result 1263 states and 1869 transitions. [2025-02-08 00:00:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2025-02-08 00:00:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:33,752 INFO L225 Difference]: With dead ends: 1263 [2025-02-08 00:00:33,752 INFO L226 Difference]: Without dead ends: 850 [2025-02-08 00:00:33,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:33,753 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 1542 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1716 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:33,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1716 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-02-08 00:00:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2025-02-08 00:00:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.4757969303423848) internal successors, (1250), 847 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1250 transitions. [2025-02-08 00:00:33,771 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1250 transitions. Word has length 258 [2025-02-08 00:00:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:33,772 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1250 transitions. [2025-02-08 00:00:33,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1250 transitions. [2025-02-08 00:00:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-08 00:00:33,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:33,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:33,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:00:33,775 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:33,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:33,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1414770675, now seen corresponding path program 1 times [2025-02-08 00:00:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:33,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724965458] [2025-02-08 00:00:33,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:33,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-08 00:00:34,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-08 00:00:34,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:34,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:35,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:35,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724965458] [2025-02-08 00:00:35,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724965458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:35,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:35,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294841314] [2025-02-08 00:00:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:35,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:35,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:35,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:35,241 INFO L87 Difference]: Start difference. First operand 848 states and 1250 transitions. Second operand has 7 states, 7 states have (on average 37.0) internal successors, (259), 6 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:35,646 INFO L93 Difference]: Finished difference Result 1298 states and 1919 transitions. [2025-02-08 00:00:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:35,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.0) internal successors, (259), 6 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-02-08 00:00:35,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:35,649 INFO L225 Difference]: With dead ends: 1298 [2025-02-08 00:00:35,649 INFO L226 Difference]: Without dead ends: 855 [2025-02-08 00:00:35,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:35,650 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1574 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:35,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 2708 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:35,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-02-08 00:00:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 850. [2025-02-08 00:00:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 1.474676089517079) internal successors, (1252), 849 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1252 transitions. [2025-02-08 00:00:35,665 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1252 transitions. Word has length 259 [2025-02-08 00:00:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:35,666 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1252 transitions. [2025-02-08 00:00:35,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.0) internal successors, (259), 6 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1252 transitions. [2025-02-08 00:00:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-08 00:00:35,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:35,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:35,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:00:35,669 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:35,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash -100189439, now seen corresponding path program 1 times [2025-02-08 00:00:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:35,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342220480] [2025-02-08 00:00:35,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:35,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:35,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-08 00:00:36,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-08 00:00:36,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:36,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:36,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342220480] [2025-02-08 00:00:36,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342220480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:36,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:36,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:36,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964119189] [2025-02-08 00:00:36,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:36,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:36,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:36,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:36,929 INFO L87 Difference]: Start difference. First operand 850 states and 1252 transitions. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 6 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:37,305 INFO L93 Difference]: Finished difference Result 1300 states and 1921 transitions. [2025-02-08 00:00:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:37,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 6 states have internal predecessors, (260), 0 states have call successors, (0), 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 260 [2025-02-08 00:00:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:37,308 INFO L225 Difference]: With dead ends: 1300 [2025-02-08 00:00:37,308 INFO L226 Difference]: Without dead ends: 861 [2025-02-08 00:00:37,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:37,310 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1584 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:37,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 2712 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-02-08 00:00:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 852. [2025-02-08 00:00:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.473560517038778) internal successors, (1254), 851 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1254 transitions. [2025-02-08 00:00:37,323 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1254 transitions. Word has length 260 [2025-02-08 00:00:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:37,324 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1254 transitions. [2025-02-08 00:00:37,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 6 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1254 transitions. [2025-02-08 00:00:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-08 00:00:37,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:37,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:37,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:00:37,326 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:37,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -375124805, now seen corresponding path program 1 times [2025-02-08 00:00:37,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:37,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123587928] [2025-02-08 00:00:37,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:37,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-08 00:00:37,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-08 00:00:37,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:37,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:38,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:38,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123587928] [2025-02-08 00:00:38,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123587928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:38,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:38,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:38,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068110200] [2025-02-08 00:00:38,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:38,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:38,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:38,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:38,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:38,572 INFO L87 Difference]: Start difference. First operand 852 states and 1254 transitions. Second operand has 6 states, 6 states have (on average 43.333333333333336) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:38,901 INFO L93 Difference]: Finished difference Result 1453 states and 2141 transitions. [2025-02-08 00:00:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:38,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.333333333333336) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 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 260 [2025-02-08 00:00:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:38,904 INFO L225 Difference]: With dead ends: 1453 [2025-02-08 00:00:38,904 INFO L226 Difference]: Without dead ends: 850 [2025-02-08 00:00:38,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:38,906 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1633 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:38,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 2291 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-02-08 00:00:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-02-08 00:00:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 1.4734982332155477) internal successors, (1251), 849 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1251 transitions. [2025-02-08 00:00:38,919 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1251 transitions. Word has length 260 [2025-02-08 00:00:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:38,919 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1251 transitions. [2025-02-08 00:00:38,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.333333333333336) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1251 transitions. [2025-02-08 00:00:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-08 00:00:38,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:38,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:38,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:00:38,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:38,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash 970170208, now seen corresponding path program 1 times [2025-02-08 00:00:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831547428] [2025-02-08 00:00:38,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:38,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:38,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-08 00:00:39,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-08 00:00:39,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:39,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:40,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:40,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831547428] [2025-02-08 00:00:40,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831547428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:40,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:40,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:40,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370869866] [2025-02-08 00:00:40,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:40,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:40,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:40,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:40,122 INFO L87 Difference]: Start difference. First operand 850 states and 1251 transitions. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 6 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:40,486 INFO L93 Difference]: Finished difference Result 1270 states and 1876 transitions. [2025-02-08 00:00:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 6 states have internal predecessors, (260), 0 states have call successors, (0), 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 260 [2025-02-08 00:00:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:40,489 INFO L225 Difference]: With dead ends: 1270 [2025-02-08 00:00:40,489 INFO L226 Difference]: Without dead ends: 857 [2025-02-08 00:00:40,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:40,490 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1547 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:40,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 2849 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-02-08 00:00:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 853. [2025-02-08 00:00:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 1.4730046948356808) internal successors, (1255), 852 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1255 transitions. [2025-02-08 00:00:40,503 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1255 transitions. Word has length 260 [2025-02-08 00:00:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:40,504 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1255 transitions. [2025-02-08 00:00:40,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 6 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1255 transitions. [2025-02-08 00:00:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-08 00:00:40,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:40,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:40,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:00:40,505 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:40,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash 619437073, now seen corresponding path program 1 times [2025-02-08 00:00:40,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:40,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872595691] [2025-02-08 00:00:40,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:40,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-08 00:00:41,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-08 00:00:41,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:41,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:41,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872595691] [2025-02-08 00:00:41,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872595691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:41,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:41,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102214787] [2025-02-08 00:00:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:41,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:41,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:41,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:41,617 INFO L87 Difference]: Start difference. First operand 853 states and 1255 transitions. Second operand has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:41,990 INFO L93 Difference]: Finished difference Result 1276 states and 1884 transitions. [2025-02-08 00:00:41,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:41,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 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 261 [2025-02-08 00:00:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:41,993 INFO L225 Difference]: With dead ends: 1276 [2025-02-08 00:00:41,997 INFO L226 Difference]: Without dead ends: 863 [2025-02-08 00:00:41,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:41,999 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1557 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:41,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 2573 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-02-08 00:00:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 859. [2025-02-08 00:00:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.472027972027972) internal successors, (1263), 858 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1263 transitions. [2025-02-08 00:00:42,025 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1263 transitions. Word has length 261 [2025-02-08 00:00:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:42,026 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1263 transitions. [2025-02-08 00:00:42,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1263 transitions. [2025-02-08 00:00:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-08 00:00:42,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:42,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:00:42,030 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:42,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash -55857750, now seen corresponding path program 1 times [2025-02-08 00:00:42,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:42,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948961860] [2025-02-08 00:00:42,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:42,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:42,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-08 00:00:42,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-08 00:00:42,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:42,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948961860] [2025-02-08 00:00:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948961860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412175497] [2025-02-08 00:00:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:43,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:43,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:43,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:43,710 INFO L87 Difference]: Start difference. First operand 859 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 52.2) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:44,001 INFO L93 Difference]: Finished difference Result 1355 states and 1997 transitions. [2025-02-08 00:00:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:44,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 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 261 [2025-02-08 00:00:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:44,005 INFO L225 Difference]: With dead ends: 1355 [2025-02-08 00:00:44,005 INFO L226 Difference]: Without dead ends: 859 [2025-02-08 00:00:44,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:44,007 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1571 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:44,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 1708 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-02-08 00:00:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-02-08 00:00:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.470862470862471) internal successors, (1262), 858 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1262 transitions. [2025-02-08 00:00:44,019 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1262 transitions. Word has length 261 [2025-02-08 00:00:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:44,020 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1262 transitions. [2025-02-08 00:00:44,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1262 transitions. [2025-02-08 00:00:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-08 00:00:44,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:44,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:44,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:00:44,022 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:44,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash 754085722, now seen corresponding path program 1 times [2025-02-08 00:00:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519640678] [2025-02-08 00:00:44,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:44,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:44,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-08 00:00:44,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-08 00:00:44,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:44,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:45,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519640678] [2025-02-08 00:00:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519640678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:45,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:45,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552028447] [2025-02-08 00:00:45,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:45,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:45,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:45,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:45,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:45,270 INFO L87 Difference]: Start difference. First operand 859 states and 1262 transitions. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:45,660 INFO L93 Difference]: Finished difference Result 1355 states and 1996 transitions. [2025-02-08 00:00:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-02-08 00:00:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:45,663 INFO L225 Difference]: With dead ends: 1355 [2025-02-08 00:00:45,663 INFO L226 Difference]: Without dead ends: 863 [2025-02-08 00:00:45,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:45,664 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1589 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 2560 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:45,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 2560 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-02-08 00:00:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2025-02-08 00:00:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.4697674418604652) internal successors, (1264), 860 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1264 transitions. [2025-02-08 00:00:45,675 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1264 transitions. Word has length 262 [2025-02-08 00:00:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:45,675 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1264 transitions. [2025-02-08 00:00:45,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 6 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1264 transitions. [2025-02-08 00:00:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-08 00:00:45,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:45,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:45,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 00:00:45,677 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:45,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:45,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1814569903, now seen corresponding path program 1 times [2025-02-08 00:00:45,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:45,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792366967] [2025-02-08 00:00:45,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:45,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:45,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 00:00:46,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 00:00:46,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:46,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:47,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:47,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792366967] [2025-02-08 00:00:47,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792366967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:47,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:47,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769016578] [2025-02-08 00:00:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:47,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:47,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:47,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:47,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:47,162 INFO L87 Difference]: Start difference. First operand 861 states and 1264 transitions. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 6 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:47,583 INFO L93 Difference]: Finished difference Result 1355 states and 1994 transitions. [2025-02-08 00:00:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 6 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2025-02-08 00:00:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:47,586 INFO L225 Difference]: With dead ends: 1355 [2025-02-08 00:00:47,586 INFO L226 Difference]: Without dead ends: 867 [2025-02-08 00:00:47,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:47,588 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1597 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:47,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 2852 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-02-08 00:00:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 863. [2025-02-08 00:00:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.468677494199536) internal successors, (1266), 862 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1266 transitions. [2025-02-08 00:00:47,604 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1266 transitions. Word has length 263 [2025-02-08 00:00:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:47,605 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1266 transitions. [2025-02-08 00:00:47,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 6 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1266 transitions. [2025-02-08 00:00:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-08 00:00:47,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:47,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:47,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 00:00:47,607 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:47,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:47,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1073163750, now seen corresponding path program 1 times [2025-02-08 00:00:47,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:47,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815307093] [2025-02-08 00:00:47,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:47,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:47,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 00:00:48,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 00:00:48,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:48,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 00:00:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815307093] [2025-02-08 00:00:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815307093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:50,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993905126] [2025-02-08 00:00:50,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:50,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:50,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:50,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:00:50,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:00:50,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 00:00:51,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 00:00:51,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:51,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:51,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 00:00:51,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:52,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:00:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993905126] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:00:54,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:00:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2025-02-08 00:00:54,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191606768] [2025-02-08 00:00:54,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:00:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 00:00:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:54,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 00:00:54,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:00:54,044 INFO L87 Difference]: Start difference. First operand 863 states and 1266 transitions. Second operand has 27 states, 27 states have (on average 28.85185185185185) internal successors, (779), 26 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:55,967 INFO L93 Difference]: Finished difference Result 2861 states and 4213 transitions. [2025-02-08 00:00:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 00:00:55,968 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 28.85185185185185) internal successors, (779), 26 states have internal predecessors, (779), 0 states have call successors, (0), 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 263 [2025-02-08 00:00:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:55,974 INFO L225 Difference]: With dead ends: 2861 [2025-02-08 00:00:55,974 INFO L226 Difference]: Without dead ends: 2076 [2025-02-08 00:00:55,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 00:00:55,975 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 15332 mSDsluCounter, 7912 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15332 SdHoareTripleChecker+Valid, 8418 SdHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:55,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15332 Valid, 8418 Invalid, 3225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 00:00:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2025-02-08 00:00:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 1637. [2025-02-08 00:00:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1636 states have (on average 1.4682151589242054) internal successors, (2402), 1636 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2402 transitions. [2025-02-08 00:00:55,993 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2402 transitions. Word has length 263 [2025-02-08 00:00:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:55,993 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2402 transitions. [2025-02-08 00:00:55,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 28.85185185185185) internal successors, (779), 26 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2402 transitions. [2025-02-08 00:00:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-08 00:00:55,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:55,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:56,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:00:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 00:00:56,197 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:56,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1055678401, now seen corresponding path program 1 times [2025-02-08 00:00:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159836093] [2025-02-08 00:00:56,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:56,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-08 00:00:56,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-08 00:00:56,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:56,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:56,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-02-08 00:00:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:56,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159836093] [2025-02-08 00:00:56,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159836093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:56,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670453144] [2025-02-08 00:00:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:56,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:56,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:56,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:56,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:56,718 INFO L87 Difference]: Start difference. First operand 1637 states and 2402 transitions. Second operand has 5 states, 5 states have (on average 52.8) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:57,012 INFO L93 Difference]: Finished difference Result 2433 states and 3569 transitions. [2025-02-08 00:00:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2025-02-08 00:00:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:57,017 INFO L225 Difference]: With dead ends: 2433 [2025-02-08 00:00:57,018 INFO L226 Difference]: Without dead ends: 1646 [2025-02-08 00:00:57,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:57,019 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 1743 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:57,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 1723 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2025-02-08 00:00:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1634. [2025-02-08 00:00:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1633 states have (on average 1.4672382118799756) internal successors, (2396), 1633 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2396 transitions. [2025-02-08 00:00:57,038 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2396 transitions. Word has length 264 [2025-02-08 00:00:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:57,038 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2396 transitions. [2025-02-08 00:00:57,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2396 transitions. [2025-02-08 00:00:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-08 00:00:57,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:57,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:00:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 00:00:57,041 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:57,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:57,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1217605434, now seen corresponding path program 1 times [2025-02-08 00:00:57,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280193494] [2025-02-08 00:00:57,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:57,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-08 00:00:57,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-08 00:00:57,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:57,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:57,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:57,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280193494] [2025-02-08 00:00:57,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280193494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:57,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:57,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:57,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095579127] [2025-02-08 00:00:57,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:57,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:57,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:57,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:57,675 INFO L87 Difference]: Start difference. First operand 1634 states and 2396 transitions. Second operand has 6 states, 6 states have (on average 44.0) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:57,989 INFO L93 Difference]: Finished difference Result 2049 states and 3013 transitions. [2025-02-08 00:00:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:57,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.0) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2025-02-08 00:00:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:57,993 INFO L225 Difference]: With dead ends: 2049 [2025-02-08 00:00:57,994 INFO L226 Difference]: Without dead ends: 1261 [2025-02-08 00:00:57,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:57,995 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 1725 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:57,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 2293 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-02-08 00:00:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1259. [2025-02-08 00:00:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1258 states have (on average 1.4737678855325913) internal successors, (1854), 1258 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1854 transitions. [2025-02-08 00:00:58,010 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1854 transitions. Word has length 264 [2025-02-08 00:00:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:58,010 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1854 transitions. [2025-02-08 00:00:58,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.0) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1854 transitions. [2025-02-08 00:00:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-08 00:00:58,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:58,014 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:58,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 00:00:58,014 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:58,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1216888559, now seen corresponding path program 1 times [2025-02-08 00:00:58,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446928469] [2025-02-08 00:00:58,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:58,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:58,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-08 00:01:01,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-08 00:01:01,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:01,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 207 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446928469] [2025-02-08 00:01:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446928469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369994284] [2025-02-08 00:01:03,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:03,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:03,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:03,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:03,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:01:03,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-08 00:01:04,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-08 00:01:04,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:04,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:04,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 3015 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 00:01:04,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 105 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:06,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 105 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369994284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:01:08,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:01:08,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-02-08 00:01:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939032383] [2025-02-08 00:01:08,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:01:08,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 00:01:08,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:08,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 00:01:08,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-02-08 00:01:08,937 INFO L87 Difference]: Start difference. First operand 1259 states and 1854 transitions. Second operand has 19 states, 19 states have (on average 68.47368421052632) internal successors, (1301), 18 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:10,785 INFO L93 Difference]: Finished difference Result 3178 states and 4718 transitions. [2025-02-08 00:01:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 00:01:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 68.47368421052632) internal successors, (1301), 18 states have internal predecessors, (1301), 0 states have call successors, (0), 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 469 [2025-02-08 00:01:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:10,791 INFO L225 Difference]: With dead ends: 3178 [2025-02-08 00:01:10,792 INFO L226 Difference]: Without dead ends: 2365 [2025-02-08 00:01:10,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 926 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=1384, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 00:01:10,794 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 12565 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12565 SdHoareTripleChecker+Valid, 6604 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:10,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12565 Valid, 6604 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:01:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-02-08 00:01:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1724. [2025-02-08 00:01:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.4730121880441092) internal successors, (2538), 1723 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2538 transitions. [2025-02-08 00:01:10,814 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2538 transitions. Word has length 469 [2025-02-08 00:01:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:10,814 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 2538 transitions. [2025-02-08 00:01:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 68.47368421052632) internal successors, (1301), 18 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2538 transitions. [2025-02-08 00:01:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-08 00:01:10,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:10,818 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:10,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 00:01:11,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 00:01:11,019 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:11,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1455433130, now seen corresponding path program 1 times [2025-02-08 00:01:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700349116] [2025-02-08 00:01:11,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:11,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-08 00:01:15,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-08 00:01:15,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:15,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat