./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:22:39,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:22:39,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:22:39,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:22:39,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:22:39,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:22:39,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:22:39,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:22:39,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:22:39,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:22:39,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:22:39,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:22:39,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:22:39,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:22:39,922 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:22:39,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:22:39,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:22:39,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:22:39,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:22:39,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:22:39,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:22:39,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:22:39,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:22:39,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:22:39,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:22:39,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:22:39,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:22:39,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:22:39,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:22:39,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:22:39,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:22:39,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:22:39,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:22:39,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:22:39,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:22:39,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:22:39,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:22:39,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:22:39,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:22:39,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:22:39,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2025-03-03 17:22:40,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:22:40,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:22:40,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:22:40,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:22:40,136 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:22:40,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-03-03 17:22:41,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abf3916a/d0638ca3b646445d83f8d64fe510fab0/FLAG65101cb42 [2025-03-03 17:22:41,535 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:22:41,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-03-03 17:22:41,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abf3916a/d0638ca3b646445d83f8d64fe510fab0/FLAG65101cb42 [2025-03-03 17:22:41,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4abf3916a/d0638ca3b646445d83f8d64fe510fab0 [2025-03-03 17:22:41,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:22:41,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:22:41,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:22:41,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:22:41,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:22:41,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5564cc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41, skipping insertion in model container [2025-03-03 17:22:41,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:22:41,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2025-03-03 17:22:41,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:22:41,722 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:22:41,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2025-03-03 17:22:41,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:22:41,765 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:22:41,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41 WrapperNode [2025-03-03 17:22:41,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:22:41,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:22:41,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:22:41,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:22:41,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,826 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 294 [2025-03-03 17:22:41,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:22:41,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:22:41,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:22:41,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:22:41,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:22:41,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:22:41,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:22:41,882 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:22:41,882 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:22:41,883 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (1/1) ... [2025-03-03 17:22:41,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:22:41,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:41,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:22:41,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:22:41,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:22:41,991 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:22:41,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:22:42,427 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2025-03-03 17:22:42,427 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:22:42,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:22:42,453 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 17:22:42,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:42 BoogieIcfgContainer [2025-03-03 17:22:42,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:22:42,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:22:42,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:22:42,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:22:42,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:22:41" (1/3) ... [2025-03-03 17:22:42,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53338d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:22:42, skipping insertion in model container [2025-03-03 17:22:42,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:41" (2/3) ... [2025-03-03 17:22:42,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53338d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:22:42, skipping insertion in model container [2025-03-03 17:22:42,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:42" (3/3) ... [2025-03-03 17:22:42,460 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2025-03-03 17:22:42,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:22:42,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal_v.c that has 1 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:22:42,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:22:42,520 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;@7c417ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:22:42,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:22:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 17:22:42,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:42,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:42,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:42,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1614794931, now seen corresponding path program 1 times [2025-03-03 17:22:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:42,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185578994] [2025-03-03 17:22:42,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:42,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 17:22:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 17:22:42,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185578994] [2025-03-03 17:22:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185578994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:42,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:22:42,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93010496] [2025-03-03 17:22:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:42,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:42,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:42,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:42,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:42,895 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:42,973 INFO L93 Difference]: Finished difference Result 149 states and 217 transitions. [2025-03-03 17:22:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:42,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 17:22:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:42,979 INFO L225 Difference]: With dead ends: 149 [2025-03-03 17:22:42,979 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 17:22:42,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:42,982 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:42,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 17:22:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 17:22:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-03-03 17:22:43,009 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 13 [2025-03-03 17:22:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:43,009 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-03-03 17:22:43,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-03-03 17:22:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:22:43,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:43,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:43,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:22:43,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:43,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1476285452, now seen corresponding path program 1 times [2025-03-03 17:22:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385509713] [2025-03-03 17:22:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:43,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 17:22:43,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 17:22:43,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:43,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385509713] [2025-03-03 17:22:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385509713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:43,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:22:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729241167] [2025-03-03 17:22:43,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:43,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:43,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:43,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:43,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:43,122 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:43,176 INFO L93 Difference]: Finished difference Result 150 states and 215 transitions. [2025-03-03 17:22:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:43,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 17:22:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:43,178 INFO L225 Difference]: With dead ends: 150 [2025-03-03 17:22:43,178 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 17:22:43,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:43,179 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:43,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:22:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 17:22:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 17:22:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-03 17:22:43,185 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 14 [2025-03-03 17:22:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:43,185 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-03 17:22:43,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-03 17:22:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 17:22:43,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:43,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:43,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:22:43,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:43,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash -883666738, now seen corresponding path program 1 times [2025-03-03 17:22:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614443638] [2025-03-03 17:22:43,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:43,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 17:22:43,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 17:22:43,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:43,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614443638] [2025-03-03 17:22:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614443638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123236522] [2025-03-03 17:22:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:43,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:43,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:43,421 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:43,532 INFO L93 Difference]: Finished difference Result 209 states and 298 transitions. [2025-03-03 17:22:43,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:22:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 17:22:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:43,534 INFO L225 Difference]: With dead ends: 209 [2025-03-03 17:22:43,534 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 17:22:43,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:22:43,535 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 88 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:43,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 316 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 17:22:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2025-03-03 17:22:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2025-03-03 17:22:43,540 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 15 [2025-03-03 17:22:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:43,540 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2025-03-03 17:22:43,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2025-03-03 17:22:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 17:22:43,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:43,541 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] [2025-03-03 17:22:43,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:22:43,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:43,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1500199926, now seen corresponding path program 1 times [2025-03-03 17:22:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:43,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950691671] [2025-03-03 17:22:43,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:43,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:43,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 17:22:43,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 17:22:43,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:43,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:43,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:43,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950691671] [2025-03-03 17:22:43,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950691671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:43,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:43,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:22:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021272982] [2025-03-03 17:22:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:43,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:43,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:43,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:43,855 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:43,943 INFO L93 Difference]: Finished difference Result 154 states and 218 transitions. [2025-03-03 17:22:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-03 17:22:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:43,945 INFO L225 Difference]: With dead ends: 154 [2025-03-03 17:22:43,945 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 17:22:43,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:43,946 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 96 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:43,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 131 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 17:22:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 17:22:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2025-03-03 17:22:43,951 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 50 [2025-03-03 17:22:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:43,951 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2025-03-03 17:22:43,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2025-03-03 17:22:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 17:22:43,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:43,952 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] [2025-03-03 17:22:43,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:22:43,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:43,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1088013973, now seen corresponding path program 1 times [2025-03-03 17:22:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:43,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088611942] [2025-03-03 17:22:43,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:43,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 17:22:43,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 17:22:43,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:43,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:44,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088611942] [2025-03-03 17:22:44,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088611942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:22:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172543698] [2025-03-03 17:22:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:44,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:22:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:44,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:22:44,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:22:44,194 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:44,352 INFO L93 Difference]: Finished difference Result 209 states and 294 transitions. [2025-03-03 17:22:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:22:44,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-03 17:22:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:44,353 INFO L225 Difference]: With dead ends: 209 [2025-03-03 17:22:44,353 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 17:22:44,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:44,355 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:44,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 272 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 17:22:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2025-03-03 17:22:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2025-03-03 17:22:44,365 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 51 [2025-03-03 17:22:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:44,366 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2025-03-03 17:22:44,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2025-03-03 17:22:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 17:22:44,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:44,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:44,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:22:44,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:44,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:44,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1260373518, now seen corresponding path program 1 times [2025-03-03 17:22:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642361096] [2025-03-03 17:22:44,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:44,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 17:22:44,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 17:22:44,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:44,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:44,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:44,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642361096] [2025-03-03 17:22:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642361096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:44,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:44,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661324920] [2025-03-03 17:22:44,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:44,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:44,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:44,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:44,677 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:44,817 INFO L93 Difference]: Finished difference Result 209 states and 293 transitions. [2025-03-03 17:22:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:22:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 17:22:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:44,818 INFO L225 Difference]: With dead ends: 209 [2025-03-03 17:22:44,818 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 17:22:44,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-03-03 17:22:44,819 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 246 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:44,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 177 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 17:22:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 105. [2025-03-03 17:22:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2025-03-03 17:22:44,825 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 52 [2025-03-03 17:22:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:44,826 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2025-03-03 17:22:44,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2025-03-03 17:22:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 17:22:44,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:44,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] [2025-03-03 17:22:44,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:22:44,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1455013049, now seen corresponding path program 1 times [2025-03-03 17:22:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088179244] [2025-03-03 17:22:44,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:44,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 17:22:44,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 17:22:44,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:44,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088179244] [2025-03-03 17:22:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088179244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:22:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021741088] [2025-03-03 17:22:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:45,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:22:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:45,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:22:45,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:22:45,164 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:45,322 INFO L93 Difference]: Finished difference Result 239 states and 334 transitions. [2025-03-03 17:22:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:22:45,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 17:22:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:45,325 INFO L225 Difference]: With dead ends: 239 [2025-03-03 17:22:45,325 INFO L226 Difference]: Without dead ends: 109 [2025-03-03 17:22:45,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:45,326 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 72 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:45,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 566 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-03 17:22:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-03-03 17:22:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2025-03-03 17:22:45,332 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 53 [2025-03-03 17:22:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:45,332 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2025-03-03 17:22:45,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2025-03-03 17:22:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 17:22:45,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:45,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:45,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:22:45,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:45,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1409582950, now seen corresponding path program 1 times [2025-03-03 17:22:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354118110] [2025-03-03 17:22:45,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:45,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 17:22:45,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 17:22:45,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:45,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354118110] [2025-03-03 17:22:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354118110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:45,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:45,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:22:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289177098] [2025-03-03 17:22:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:45,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:22:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:45,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:22:45,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:22:45,731 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:45,901 INFO L93 Difference]: Finished difference Result 282 states and 392 transitions. [2025-03-03 17:22:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:22:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 17:22:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:45,903 INFO L225 Difference]: With dead ends: 282 [2025-03-03 17:22:45,903 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 17:22:45,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:22:45,903 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 122 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:45,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 796 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 17:22:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 130. [2025-03-03 17:22:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.37984496124031) internal successors, (178), 129 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2025-03-03 17:22:45,909 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 54 [2025-03-03 17:22:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:45,909 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2025-03-03 17:22:45,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2025-03-03 17:22:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 17:22:45,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:45,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:45,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:22:45,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:45,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1206310764, now seen corresponding path program 1 times [2025-03-03 17:22:45,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:45,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563637529] [2025-03-03 17:22:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:45,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 17:22:45,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 17:22:45,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:45,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563637529] [2025-03-03 17:22:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563637529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 17:22:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615228946] [2025-03-03 17:22:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:46,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 17:22:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 17:22:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 17:22:46,207 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:46,244 INFO L93 Difference]: Finished difference Result 226 states and 312 transitions. [2025-03-03 17:22:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 17:22:46,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 17:22:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:46,245 INFO L225 Difference]: With dead ends: 226 [2025-03-03 17:22:46,246 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 17:22:46,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 17:22:46,247 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:46,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:22:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 17:22:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-03 17:22:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 129 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-03-03 17:22:46,255 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 55 [2025-03-03 17:22:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:46,258 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-03-03 17:22:46,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-03-03 17:22:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 17:22:46,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:46,259 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:46,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:22:46,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:46,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1007168006, now seen corresponding path program 1 times [2025-03-03 17:22:46,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:46,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588119537] [2025-03-03 17:22:46,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:46,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:22:46,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:22:46,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:46,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:46,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588119537] [2025-03-03 17:22:46,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588119537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:46,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:46,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:46,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643264381] [2025-03-03 17:22:46,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:46,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:46,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:46,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:46,496 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:46,585 INFO L93 Difference]: Finished difference Result 276 states and 379 transitions. [2025-03-03 17:22:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:22:46,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 17:22:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:46,587 INFO L225 Difference]: With dead ends: 276 [2025-03-03 17:22:46,587 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 17:22:46,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-03 17:22:46,588 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 225 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:46,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 235 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 17:22:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2025-03-03 17:22:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.3712574850299402) internal successors, (229), 167 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 229 transitions. [2025-03-03 17:22:46,594 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 229 transitions. Word has length 56 [2025-03-03 17:22:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:46,595 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 229 transitions. [2025-03-03 17:22:46,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 229 transitions. [2025-03-03 17:22:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 17:22:46,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:46,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:46,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:22:46,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:46,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 329772488, now seen corresponding path program 1 times [2025-03-03 17:22:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:46,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442679625] [2025-03-03 17:22:46,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:46,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:22:46,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:22:46,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:46,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442679625] [2025-03-03 17:22:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442679625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:46,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:46,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:22:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871744120] [2025-03-03 17:22:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:22:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:46,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:22:46,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:46,950 INFO L87 Difference]: Start difference. First operand 168 states and 229 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:47,152 INFO L93 Difference]: Finished difference Result 300 states and 408 transitions. [2025-03-03 17:22:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:22:47,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 17:22:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:47,154 INFO L225 Difference]: With dead ends: 300 [2025-03-03 17:22:47,154 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 17:22:47,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:22:47,155 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 249 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:47,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 264 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 17:22:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 185. [2025-03-03 17:22:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.358695652173913) internal successors, (250), 184 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-03-03 17:22:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2025-03-03 17:22:47,160 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 56 [2025-03-03 17:22:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:47,160 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2025-03-03 17:22:47,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2025-03-03 17:22:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 17:22:47,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:47,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:47,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:22:47,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:47,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1166129579, now seen corresponding path program 1 times [2025-03-03 17:22:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275113222] [2025-03-03 17:22:47,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:47,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:22:47,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:22:47,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:47,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275113222] [2025-03-03 17:22:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275113222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:22:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644446776] [2025-03-03 17:22:47,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:47,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:47,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:47,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:22:47,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:22:47,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:22:47,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:22:47,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:47,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:47,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 17:22:47,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:22:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:48,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:22:48,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644446776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:48,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:22:48,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2025-03-03 17:22:48,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550840548] [2025-03-03 17:22:48,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:48,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:22:48,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:48,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:22:48,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-03 17:22:48,003 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:48,389 INFO L93 Difference]: Finished difference Result 416 states and 563 transitions. [2025-03-03 17:22:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 17:22:48,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 17:22:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:48,391 INFO L225 Difference]: With dead ends: 416 [2025-03-03 17:22:48,391 INFO L226 Difference]: Without dead ends: 273 [2025-03-03 17:22:48,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-03-03 17:22:48,392 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 396 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:48,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 237 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-03 17:22:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2025-03-03 17:22:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3475935828877006) internal successors, (252), 187 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-03-03 17:22:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 252 transitions. [2025-03-03 17:22:48,398 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 252 transitions. Word has length 56 [2025-03-03 17:22:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:48,399 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 252 transitions. [2025-03-03 17:22:48,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 252 transitions. [2025-03-03 17:22:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 17:22:48,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:48,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:48,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:22:48,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 17:22:48,604 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:48,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash 32638735, now seen corresponding path program 1 times [2025-03-03 17:22:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562964249] [2025-03-03 17:22:48,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:48,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 17:22:48,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 17:22:48,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:49,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562964249] [2025-03-03 17:22:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562964249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:49,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:49,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:22:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856187180] [2025-03-03 17:22:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:22:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:49,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:22:49,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:49,123 INFO L87 Difference]: Start difference. First operand 188 states and 252 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:49,392 INFO L93 Difference]: Finished difference Result 347 states and 465 transitions. [2025-03-03 17:22:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:22:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 17:22:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:49,393 INFO L225 Difference]: With dead ends: 347 [2025-03-03 17:22:49,393 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 17:22:49,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:22:49,394 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 197 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:49,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 317 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 17:22:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 215. [2025-03-03 17:22:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 214 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 286 transitions. [2025-03-03 17:22:49,398 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 286 transitions. Word has length 57 [2025-03-03 17:22:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:49,398 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 286 transitions. [2025-03-03 17:22:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 286 transitions. [2025-03-03 17:22:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 17:22:49,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:49,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:49,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:22:49,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:49,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1886741643, now seen corresponding path program 1 times [2025-03-03 17:22:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546320627] [2025-03-03 17:22:49,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:49,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 17:22:49,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 17:22:49,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546320627] [2025-03-03 17:22:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546320627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:49,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:49,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:22:49,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619380601] [2025-03-03 17:22:49,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:49,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:22:49,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:49,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:22:49,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:22:49,779 INFO L87 Difference]: Start difference. First operand 215 states and 286 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:49,940 INFO L93 Difference]: Finished difference Result 333 states and 449 transitions. [2025-03-03 17:22:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:22:49,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 17:22:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:49,942 INFO L225 Difference]: With dead ends: 333 [2025-03-03 17:22:49,942 INFO L226 Difference]: Without dead ends: 237 [2025-03-03 17:22:49,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:22:49,942 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 57 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:49,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 316 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-03 17:22:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2025-03-03 17:22:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.349056603773585) internal successors, (286), 212 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2025-03-03 17:22:49,948 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 286 transitions. Word has length 58 [2025-03-03 17:22:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:49,948 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 286 transitions. [2025-03-03 17:22:49,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 286 transitions. [2025-03-03 17:22:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 17:22:49,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:49,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:49,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:22:49,949 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:49,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1469687068, now seen corresponding path program 1 times [2025-03-03 17:22:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871692804] [2025-03-03 17:22:49,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:49,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 17:22:50,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 17:22:50,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:50,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:50,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871692804] [2025-03-03 17:22:50,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871692804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:50,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:50,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:22:50,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748591377] [2025-03-03 17:22:50,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:50,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:22:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:50,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:22:50,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:22:50,191 INFO L87 Difference]: Start difference. First operand 213 states and 286 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:50,277 INFO L93 Difference]: Finished difference Result 394 states and 531 transitions. [2025-03-03 17:22:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:22:50,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 17:22:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:50,278 INFO L225 Difference]: With dead ends: 394 [2025-03-03 17:22:50,278 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 17:22:50,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:50,279 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 96 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:50,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 17:22:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-03 17:22:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 218 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 292 transitions. [2025-03-03 17:22:50,288 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 292 transitions. Word has length 58 [2025-03-03 17:22:50,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:50,288 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 292 transitions. [2025-03-03 17:22:50,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:50,288 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 292 transitions. [2025-03-03 17:22:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 17:22:50,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:50,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:50,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:22:50,289 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:50,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1219920576, now seen corresponding path program 1 times [2025-03-03 17:22:50,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:50,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220965094] [2025-03-03 17:22:50,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:50,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:50,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 17:22:50,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 17:22:50,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:51,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:51,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220965094] [2025-03-03 17:22:51,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220965094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:51,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:51,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 17:22:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203050695] [2025-03-03 17:22:51,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:51,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:22:51,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:51,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:22:51,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:22:51,069 INFO L87 Difference]: Start difference. First operand 219 states and 292 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:51,294 INFO L93 Difference]: Finished difference Result 340 states and 456 transitions. [2025-03-03 17:22:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:22:51,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 17:22:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:51,295 INFO L225 Difference]: With dead ends: 340 [2025-03-03 17:22:51,295 INFO L226 Difference]: Without dead ends: 223 [2025-03-03 17:22:51,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:22:51,296 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 135 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:51,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 418 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-03 17:22:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2025-03-03 17:22:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.334862385321101) internal successors, (291), 218 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 291 transitions. [2025-03-03 17:22:51,301 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 291 transitions. Word has length 59 [2025-03-03 17:22:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:51,301 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 291 transitions. [2025-03-03 17:22:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2025-03-03 17:22:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 17:22:51,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:51,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:51,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:22:51,302 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1586892856, now seen corresponding path program 1 times [2025-03-03 17:22:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623126824] [2025-03-03 17:22:51,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:51,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 17:22:51,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 17:22:51,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:51,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623126824] [2025-03-03 17:22:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623126824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:51,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:51,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:22:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645007219] [2025-03-03 17:22:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:51,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:22:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:51,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:22:51,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:22:51,728 INFO L87 Difference]: Start difference. First operand 219 states and 291 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:52,009 INFO L93 Difference]: Finished difference Result 352 states and 472 transitions. [2025-03-03 17:22:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:22:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 17:22:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:52,011 INFO L225 Difference]: With dead ends: 352 [2025-03-03 17:22:52,011 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 17:22:52,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:22:52,011 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 103 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:52,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 623 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:22:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 17:22:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2025-03-03 17:22:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.329268292682927) internal successors, (327), 246 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 327 transitions. [2025-03-03 17:22:52,016 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 327 transitions. Word has length 59 [2025-03-03 17:22:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:52,016 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 327 transitions. [2025-03-03 17:22:52,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 327 transitions. [2025-03-03 17:22:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 17:22:52,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:52,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:52,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:22:52,017 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:52,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:52,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1603283781, now seen corresponding path program 1 times [2025-03-03 17:22:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696043896] [2025-03-03 17:22:52,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:52,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 17:22:52,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 17:22:52,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:52,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696043896] [2025-03-03 17:22:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696043896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:52,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021696201] [2025-03-03 17:22:52,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:52,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:52,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:52,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:52,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:52,245 INFO L87 Difference]: Start difference. First operand 247 states and 327 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:52,333 INFO L93 Difference]: Finished difference Result 389 states and 519 transitions. [2025-03-03 17:22:52,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:22:52,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 17:22:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:52,335 INFO L225 Difference]: With dead ends: 389 [2025-03-03 17:22:52,335 INFO L226 Difference]: Without dead ends: 208 [2025-03-03 17:22:52,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:22:52,335 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 53 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:52,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 309 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-03 17:22:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-03 17:22:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.3140096618357489) internal successors, (272), 207 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 272 transitions. [2025-03-03 17:22:52,342 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 272 transitions. Word has length 59 [2025-03-03 17:22:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:52,342 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 272 transitions. [2025-03-03 17:22:52,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 272 transitions. [2025-03-03 17:22:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 17:22:52,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:52,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:52,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:22:52,344 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:52,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1219385493, now seen corresponding path program 1 times [2025-03-03 17:22:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:52,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308256370] [2025-03-03 17:22:52,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:52,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 17:22:52,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 17:22:52,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:52,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308256370] [2025-03-03 17:22:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308256370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:22:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860962793] [2025-03-03 17:22:52,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:52,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:22:52,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:52,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:22:52,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:22:52,705 INFO L87 Difference]: Start difference. First operand 208 states and 272 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:52,848 INFO L93 Difference]: Finished difference Result 387 states and 517 transitions. [2025-03-03 17:22:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:22:52,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 17:22:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:52,849 INFO L225 Difference]: With dead ends: 387 [2025-03-03 17:22:52,849 INFO L226 Difference]: Without dead ends: 289 [2025-03-03 17:22:52,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:22:52,850 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 96 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:52,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 712 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-03 17:22:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 170. [2025-03-03 17:22:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.301775147928994) internal successors, (220), 169 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2025-03-03 17:22:52,855 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 60 [2025-03-03 17:22:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:52,855 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2025-03-03 17:22:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2025-03-03 17:22:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 17:22:52,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:52,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:52,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:22:52,855 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:52,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2137063915, now seen corresponding path program 1 times [2025-03-03 17:22:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:52,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245081224] [2025-03-03 17:22:52,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:52,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 17:22:52,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 17:22:52,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:52,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245081224] [2025-03-03 17:22:52,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245081224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:52,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:52,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:22:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400309170] [2025-03-03 17:22:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:52,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:22:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:52,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:22:52,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:52,963 INFO L87 Difference]: Start difference. First operand 170 states and 220 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:52,999 INFO L93 Difference]: Finished difference Result 298 states and 390 transitions. [2025-03-03 17:22:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:53,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 17:22:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:53,000 INFO L225 Difference]: With dead ends: 298 [2025-03-03 17:22:53,000 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 17:22:53,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:53,001 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:53,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:22:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 17:22:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-03 17:22:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 173 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 224 transitions. [2025-03-03 17:22:53,005 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 224 transitions. Word has length 61 [2025-03-03 17:22:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:53,005 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 224 transitions. [2025-03-03 17:22:53,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 224 transitions. [2025-03-03 17:22:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 17:22:53,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:53,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:53,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 17:22:53,006 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:53,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1945527158, now seen corresponding path program 1 times [2025-03-03 17:22:53,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:53,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33232510] [2025-03-03 17:22:53,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:53,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 17:22:53,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 17:22:53,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:53,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:53,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33232510] [2025-03-03 17:22:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33232510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:53,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:22:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552329152] [2025-03-03 17:22:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:53,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:22:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:53,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:22:53,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:22:53,296 INFO L87 Difference]: Start difference. First operand 174 states and 224 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:53,391 INFO L93 Difference]: Finished difference Result 257 states and 336 transitions. [2025-03-03 17:22:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:22:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 17:22:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:53,392 INFO L225 Difference]: With dead ends: 257 [2025-03-03 17:22:53,392 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 17:22:53,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:22:53,392 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 60 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:53,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 263 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 17:22:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-03 17:22:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.283236994219653) internal successors, (222), 173 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 222 transitions. [2025-03-03 17:22:53,397 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 222 transitions. Word has length 62 [2025-03-03 17:22:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:53,397 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 222 transitions. [2025-03-03 17:22:53,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 222 transitions. [2025-03-03 17:22:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 17:22:53,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:53,399 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:53,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 17:22:53,399 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1212491737, now seen corresponding path program 1 times [2025-03-03 17:22:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132798603] [2025-03-03 17:22:53,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:53,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 17:22:53,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 17:22:53,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:53,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:53,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132798603] [2025-03-03 17:22:53,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132798603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:53,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:53,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:22:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890815343] [2025-03-03 17:22:53,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:53,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:22:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:53,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:22:53,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:22:53,858 INFO L87 Difference]: Start difference. First operand 174 states and 222 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:54,049 INFO L93 Difference]: Finished difference Result 298 states and 381 transitions. [2025-03-03 17:22:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:22:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 17:22:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:54,051 INFO L225 Difference]: With dead ends: 298 [2025-03-03 17:22:54,052 INFO L226 Difference]: Without dead ends: 203 [2025-03-03 17:22:54,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:22:54,054 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 85 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:54,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 568 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-03 17:22:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2025-03-03 17:22:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.26) internal successors, (252), 200 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-03-03 17:22:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2025-03-03 17:22:54,059 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 63 [2025-03-03 17:22:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:54,060 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2025-03-03 17:22:54,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2025-03-03 17:22:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 17:22:54,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:54,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:54,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 17:22:54,061 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:54,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 43934896, now seen corresponding path program 1 times [2025-03-03 17:22:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346799200] [2025-03-03 17:22:54,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:54,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 17:22:54,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 17:22:54,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:54,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-03-03 17:22:54,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:22:54,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346799200] [2025-03-03 17:22:54,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346799200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:54,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:54,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:22:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367029749] [2025-03-03 17:22:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:54,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:22:54,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:54,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:54,372 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:54,441 INFO L93 Difference]: Finished difference Result 349 states and 436 transitions. [2025-03-03 17:22:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 17:22:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:54,443 INFO L225 Difference]: With dead ends: 349 [2025-03-03 17:22:54,443 INFO L226 Difference]: Without dead ends: 189 [2025-03-03 17:22:54,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:54,443 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:54,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 125 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:22:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-03 17:22:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-03 17:22:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.2340425531914894) internal successors, (232), 188 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 232 transitions. [2025-03-03 17:22:54,449 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 232 transitions. Word has length 63 [2025-03-03 17:22:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:54,449 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 232 transitions. [2025-03-03 17:22:54,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 232 transitions. [2025-03-03 17:22:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 17:22:54,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:54,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:54,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 17:22:54,451 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:54,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 265390004, now seen corresponding path program 1 times [2025-03-03 17:22:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:22:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558130103] [2025-03-03 17:22:54,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:22:54,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 17:22:54,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 17:22:54,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:54,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:22:54,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:22:54,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 17:22:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 17:22:54,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:54,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:22:54,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:22:54,652 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:22:54,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:22:54,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 17:22:54,657 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-03 17:22:54,682 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:22:54,682 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:22:54,689 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:22:54,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:22:54 BoogieIcfgContainer [2025-03-03 17:22:54,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:22:54,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:22:54,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:22:54,692 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:22:54,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:42" (3/4) ... [2025-03-03 17:22:54,695 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:22:54,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:22:54,697 INFO L158 Benchmark]: Toolchain (without parser) took 13135.91ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 132.8MB in the beginning and 381.9MB in the end (delta: -249.1MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. [2025-03-03 17:22:54,697 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:22:54,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.89ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 118.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:22:54,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.46ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 111.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:22:54,698 INFO L158 Benchmark]: Boogie Preprocessor took 54.65ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 107.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:22:54,699 INFO L158 Benchmark]: IcfgBuilder took 571.41ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 64.1MB in the end (delta: 43.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:22:54,699 INFO L158 Benchmark]: TraceAbstraction took 12236.26ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 63.7MB in the beginning and 382.0MB in the end (delta: -318.3MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-03-03 17:22:54,699 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 545.3MB. Free memory was 382.0MB in the beginning and 381.9MB in the end (delta: 143.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:22:54,700 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.89ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 118.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.46ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 111.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.65ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 107.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 571.41ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 64.1MB in the end (delta: 43.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12236.26ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 63.7MB in the beginning and 382.0MB in the end (delta: -318.3MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 545.3MB. Free memory was 382.0MB in the beginning and 381.9MB in the end (delta: 143.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 85, overapproximation of bitwiseOr at line 148, overapproximation of bitwiseAnd at line 149, overapproximation of bitwiseAnd at line 161, overapproximation of bitwiseAnd at line 89, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_28 mask_SORT_28 = (SORT_28)-1 >> (sizeof(SORT_28) * 8 - 32); [L33] const SORT_28 msb_SORT_28 = (SORT_28)1 << (32 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_4 var_8 = 0; [L37] const SORT_1 var_15 = 1; [L38] const SORT_4 var_22 = 15; [L39] const SORT_28 var_30 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L44] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L45] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_10_arg_1 = var_8; [L50] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_17_arg_0=1, var_17_arg_1=-256, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) [L69] RET __VERIFIER_assert(!(bad_18_arg_0)) [L71] SORT_1 var_37_arg_0 = input_3; [L72] SORT_1 var_37 = ~var_37_arg_0; [L73] SORT_4 var_38_arg_0 = state_6; [L74] SORT_4 var_38_arg_1 = state_9; [L75] SORT_1 var_38 = var_38_arg_0 > var_38_arg_1; [L76] SORT_1 var_39_arg_0 = var_37; [L77] SORT_1 var_39_arg_1 = var_38; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39_arg_0=-256, var_39_arg_1=1, var_5=1] [L78] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L78] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L79] EXPR var_39 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L79] var_39 = var_39 & mask_SORT_1 [L80] SORT_4 var_29_arg_0 = var_22; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_29_arg_0=15, var_30=1, var_39=0, var_5=1] [L81] EXPR var_29_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L81] var_29_arg_0 = var_29_arg_0 & mask_SORT_4 [L82] SORT_28 var_29 = var_29_arg_0; [L83] SORT_28 var_31_arg_0 = var_29; [L84] SORT_28 var_31_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_31_arg_0=15, var_31_arg_1=1, var_39=0, var_5=1] [L85] EXPR var_31_arg_0 >> var_31_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L85] SORT_28 var_31 = var_31_arg_0 >> var_31_arg_1; [L86] SORT_28 var_32_arg_0 = var_31; [L87] SORT_4 var_32 = var_32_arg_0 >> 0; [L88] SORT_4 var_33_arg_0 = state_6; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_33_arg_0=1, var_39=0, var_5=1] [L89] EXPR var_33_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L89] var_33_arg_0 = var_33_arg_0 & mask_SORT_4 [L90] SORT_28 var_33 = var_33_arg_0; [L91] SORT_28 var_34_arg_0 = var_33; [L92] SORT_28 var_34_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_34_arg_0=0, var_34_arg_1=1, var_39=0, var_5=1] [L93] EXPR var_34_arg_0 >> var_34_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L93] SORT_28 var_34 = var_34_arg_0 >> var_34_arg_1; [L94] SORT_28 var_35_arg_0 = var_34; [L95] SORT_4 var_35 = var_35_arg_0 >> 0; [L96] SORT_4 var_36_arg_0 = var_32; [L97] SORT_4 var_36_arg_1 = var_35; [L98] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L99] SORT_4 var_26_arg_0 = state_6; [L100] SORT_4 var_26_arg_1 = state_9; [L101] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L102] SORT_4 var_21_arg_0 = state_9; [L103] SORT_4 var_21_arg_1 = state_6; [L104] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L105] SORT_4 var_23_arg_0 = state_6; [L106] SORT_4 var_23_arg_1 = var_22; [L107] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L108] SORT_1 var_24_arg_0 = var_21; [L109] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L111] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L111] var_24 = var_24 & mask_SORT_1 [L112] SORT_4 var_20_arg_0 = state_6; [L113] SORT_4 var_20_arg_1 = var_5; [L114] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L115] SORT_1 var_25_arg_0 = var_24; [L116] SORT_4 var_25_arg_1 = var_20; [L117] SORT_4 var_25_arg_2 = state_9; [L118] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L119] SORT_1 var_27_arg_0 = var_26; [L120] SORT_4 var_27_arg_1 = state_6; [L121] SORT_4 var_27_arg_2 = var_25; [L122] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L123] SORT_1 var_40_arg_0 = var_39; [L124] SORT_4 var_40_arg_1 = var_36; [L125] SORT_4 var_40_arg_2 = var_27; [L126] SORT_4 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_40=2, var_5=1] [L127] EXPR var_40 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L127] var_40 = var_40 & mask_SORT_4 [L128] SORT_4 next_41_arg_1 = var_40; [L129] SORT_1 var_48_arg_0 = input_3; [L130] SORT_1 var_48 = ~var_48_arg_0; [L131] SORT_4 var_49_arg_0 = state_6; [L132] SORT_4 var_49_arg_1 = state_9; [L133] SORT_1 var_49 = var_49_arg_0 > var_49_arg_1; [L134] SORT_1 var_50_arg_0 = var_48; [L135] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50_arg_0=-256, var_50_arg_1=1, var_5=1] [L136] EXPR var_50_arg_0 & var_50_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L136] SORT_1 var_50 = var_50_arg_0 & var_50_arg_1; [L137] EXPR var_50 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L137] var_50 = var_50 & mask_SORT_1 [L138] SORT_4 var_43_arg_0 = state_6; [L139] SORT_4 var_43_arg_1 = state_9; [L140] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L141] SORT_1 var_44_arg_0 = var_43; [L142] SORT_1 var_44 = ~var_44_arg_0; [L143] SORT_4 var_45_arg_0 = state_6; [L144] SORT_4 var_45_arg_1 = var_22; [L145] SORT_1 var_45 = var_45_arg_0 != var_45_arg_1; [L146] SORT_1 var_46_arg_0 = var_44; [L147] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_46_arg_0=-2, var_46_arg_1=1, var_50=0, var_5=1] [L148] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L148] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L149] EXPR var_46 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L149] var_46 = var_46 & mask_SORT_1 [L150] SORT_4 var_42_arg_0 = state_9; [L151] SORT_4 var_42_arg_1 = var_5; [L152] SORT_4 var_42 = var_42_arg_0 + var_42_arg_1; [L153] SORT_1 var_47_arg_0 = var_46; [L154] SORT_4 var_47_arg_1 = var_42; [L155] SORT_4 var_47_arg_2 = state_6; [L156] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L157] SORT_1 var_51_arg_0 = var_50; [L158] SORT_4 var_51_arg_1 = state_9; [L159] SORT_4 var_51_arg_2 = var_47; [L160] SORT_4 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_51=1, var_5=1] [L161] EXPR var_51 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_5=1] [L161] var_51 = var_51 & mask_SORT_4 [L162] SORT_4 next_52_arg_1 = var_51; [L164] state_6 = next_41_arg_1 [L165] state_9 = next_52_arg_1 [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_17_arg_0=1, var_17_arg_1=-255, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2716 mSDsluCounter, 7931 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6018 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4258 IncrementalHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1913 mSDtfsCounter, 4258 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=17, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 486 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1303 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 5951 SizeOfPredicates, 3 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 122/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:22:54,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:22:56,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:22:56,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:22:56,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:22:56,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:22:56,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:22:56,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:22:56,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:22:56,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:22:56,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:22:56,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:22:56,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:22:56,637 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:22:56,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:22:56,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:22:56,638 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2025-03-03 17:22:56,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:22:56,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:22:56,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:22:56,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:22:56,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:22:56,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-03-03 17:22:57,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb52c646/14cb441e0458451aaae69fea29f253a4/FLAG7ac8a0728 [2025-03-03 17:22:58,185 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:22:58,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-03-03 17:22:58,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb52c646/14cb441e0458451aaae69fea29f253a4/FLAG7ac8a0728 [2025-03-03 17:22:58,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb52c646/14cb441e0458451aaae69fea29f253a4 [2025-03-03 17:22:58,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:22:58,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:22:58,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:22:58,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:22:58,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:22:58,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22396ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58, skipping insertion in model container [2025-03-03 17:22:58,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:22:58,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2025-03-03 17:22:58,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:22:58,713 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:22:58,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2025-03-03 17:22:58,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:22:58,748 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:22:58,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58 WrapperNode [2025-03-03 17:22:58,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:22:58,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:22:58,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:22:58,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:22:58,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,782 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 154 [2025-03-03 17:22:58,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:22:58,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:22:58,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:22:58,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:22:58,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,816 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:22:58,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:22:58,833 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:22:58,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:22:58,833 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:22:58,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (1/1) ... [2025-03-03 17:22:58,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:22:58,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:58,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:22:58,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:22:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:22:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:22:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:22:58,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:22:58,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:22:58,967 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:22:59,169 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 17:22:59,169 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:22:59,179 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:22:59,179 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:22:59,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:59 BoogieIcfgContainer [2025-03-03 17:22:59,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:22:59,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:22:59,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:22:59,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:22:59,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:22:58" (1/3) ... [2025-03-03 17:22:59,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3682bf8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:22:59, skipping insertion in model container [2025-03-03 17:22:59,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:22:58" (2/3) ... [2025-03-03 17:22:59,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3682bf8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:22:59, skipping insertion in model container [2025-03-03 17:22:59,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:22:59" (3/3) ... [2025-03-03 17:22:59,188 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2025-03-03 17:22:59,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:22:59,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal_v.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:22:59,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:22:59,249 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;@5b49ace4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:22:59,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:22:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:22:59,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:59,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:22:59,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:59,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:22:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:22:59,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526063633] [2025-03-03 17:22:59,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:59,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:59,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:59,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:22:59,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:22:59,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:22:59,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:22:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:59,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 17:22:59,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:22:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:22:59,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:22:59,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:22:59,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526063633] [2025-03-03 17:22:59,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526063633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:22:59,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:22:59,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:22:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501888765] [2025-03-03 17:22:59,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:22:59,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:22:59,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:22:59,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:22:59,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:22:59,598 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:22:59,633 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:22:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:22:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-03 17:22:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:22:59,641 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:22:59,641 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:22:59,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:22:59,647 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:22:59,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:22:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:22:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:22:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:22:59,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:22:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:22:59,669 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:22:59,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:22:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:22:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:22:59,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:22:59,669 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:22:59,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:22:59,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:59,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:22:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:22:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:22:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:22:59,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517040197] [2025-03-03 17:22:59,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:22:59,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:22:59,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:22:59,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:22:59,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:22:59,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:22:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:22:59,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:22:59,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:22:59,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 17:22:59,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:23:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:23:00,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:23:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:23:03,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:23:03,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517040197] [2025-03-03 17:23:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517040197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:23:03,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:23:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:23:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201377395] [2025-03-03 17:23:03,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:23:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:23:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:23:03,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:23:03,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:23:03,734 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:23:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:23:03,818 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-03 17:23:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:23:03,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 17:23:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:23:03,819 INFO L225 Difference]: With dead ends: 15 [2025-03-03 17:23:03,819 INFO L226 Difference]: Without dead ends: 13 [2025-03-03 17:23:03,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:23:03,821 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:23:03,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:23:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-03 17:23:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-03 17:23:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:23:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 17:23:03,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 17:23:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:23:03,824 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 17:23:03,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:23:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 17:23:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 17:23:03,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:23:03,825 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 17:23:03,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 17:23:04,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:23:04,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:23:04,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:23:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 17:23:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:23:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763299627] [2025-03-03 17:23:04,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:23:04,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:23:04,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:23:04,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:23:04,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 17:23:04,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 17:23:04,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 17:23:04,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:23:04,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:23:04,104 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 17:23:04,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:23:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:23:04,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:23:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:23:18,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:23:18,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763299627] [2025-03-03 17:23:18,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763299627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:23:18,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:23:18,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-03 17:23:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486562440] [2025-03-03 17:23:18,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:23:18,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 17:23:18,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:23:18,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 17:23:18,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:23:18,586 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:23:21,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-03-03 17:23:22,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-03-03 17:23:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:23:22,822 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-03-03 17:23:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:23:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 11 [2025-03-03 17:23:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:23:22,823 INFO L225 Difference]: With dead ends: 24 [2025-03-03 17:23:22,823 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 17:23:22,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-03-03 17:23:22,823 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:23:22,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 17:23:22,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 17:23:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-03-03 17:23:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:23:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-03-03 17:23:22,828 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2025-03-03 17:23:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:23:22,828 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-03-03 17:23:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:23:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-03-03 17:23:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 17:23:22,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:23:22,828 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2025-03-03 17:23:22,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 17:23:23,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:23:23,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:23:23,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:23:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1811617123, now seen corresponding path program 3 times [2025-03-03 17:23:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:23:23,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807514081] [2025-03-03 17:23:23,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 17:23:23,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:23:23,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:23:23,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:23:23,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 17:23:23,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-03 17:23:23,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 17:23:23,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 17:23:23,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:23:23,151 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-03 17:23:23,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:23:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:23:25,724 INFO L312 TraceCheckSpWp]: Computing backward predicates...