./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/eca-rers2012/Problem10_label40.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be7ecc9aa1c7e8dfb9739700094e29609bf8bf38dd295ce34c37d7f9597d2a6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:30:56,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:30:56,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:30:56,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:30:56,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:30:56,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:30:56,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:30:56,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:30:56,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:30:56,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:30:56,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:30:56,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:30:56,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:30:56,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:30:56,641 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:30:56,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:30:56,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:30:56,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:30:56,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:30:56,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:30:56,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:30:56,643 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be7ecc9aa1c7e8dfb9739700094e29609bf8bf38dd295ce34c37d7f9597d2a6e [2025-03-03 10:30:56,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:30:56,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:30:56,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:30:56,867 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:30:56,867 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:30:56,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label40.c [2025-03-03 10:30:58,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7634096/92647361e16a45cdb6c20ee201f0e1fb/FLAG7d935a8d0 [2025-03-03 10:30:58,357 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:30:58,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label40.c [2025-03-03 10:30:58,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7634096/92647361e16a45cdb6c20ee201f0e1fb/FLAG7d935a8d0 [2025-03-03 10:30:58,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7634096/92647361e16a45cdb6c20ee201f0e1fb [2025-03-03 10:30:58,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:30:58,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:30:58,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:30:58,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:30:58,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:30:58,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb92a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58, skipping insertion in model container [2025-03-03 10:30:58,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:30:58,595 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/eca-rers2012/Problem10_label40.c[5662,5675] [2025-03-03 10:30:58,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:30:58,683 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:30:58,702 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/eca-rers2012/Problem10_label40.c[5662,5675] [2025-03-03 10:30:58,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:30:58,772 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:30:58,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58 WrapperNode [2025-03-03 10:30:58,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:30:58,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:30:58,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:30:58,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:30:58,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,822 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-03 10:30:58,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:30:58,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:30:58,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:30:58,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:30:58,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,861 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 10:30:58,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:30:58,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:30:58,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:30:58,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:30:58,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (1/1) ... [2025-03-03 10:30:58,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:30:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:30:58,920 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 10:30:58,925 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 10:30:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:30:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:30:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:30:58,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:30:58,987 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:30:58,989 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:30:59,932 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-03 10:30:59,933 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:30:59,946 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:30:59,947 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:30:59,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:59 BoogieIcfgContainer [2025-03-03 10:30:59,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:30:59,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:30:59,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:30:59,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:30:59,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:30:58" (1/3) ... [2025-03-03 10:30:59,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a8fbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:59, skipping insertion in model container [2025-03-03 10:30:59,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:58" (2/3) ... [2025-03-03 10:30:59,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a8fbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:59, skipping insertion in model container [2025-03-03 10:30:59,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:59" (3/3) ... [2025-03-03 10:30:59,956 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label40.c [2025-03-03 10:30:59,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:30:59,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label40.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:31:00,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:31:00,028 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;@3a3cab1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:31:00,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:31:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states 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 10:31:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 10:31:00,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:00,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:00,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:00,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1233764674, now seen corresponding path program 1 times [2025-03-03 10:31:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618156212] [2025-03-03 10:31:00,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:00,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 10:31:00,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 10:31:00,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:00,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:00,359 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 10:31:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618156212] [2025-03-03 10:31:00,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618156212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:00,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907515297] [2025-03-03 10:31:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:00,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:00,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:00,385 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 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 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 10:31:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:01,027 INFO L93 Difference]: Finished difference Result 552 states and 963 transitions. [2025-03-03 10:31:01,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:01,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-03 10:31:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:01,040 INFO L225 Difference]: With dead ends: 552 [2025-03-03 10:31:01,040 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 10:31:01,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:31:01,046 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:01,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 10:31:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-03 10:31:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 10:31:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2025-03-03 10:31:01,099 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 49 [2025-03-03 10:31:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:01,100 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2025-03-03 10:31:01,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 10:31:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2025-03-03 10:31:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 10:31:01,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:01,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:01,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:31:01,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1033846793, now seen corresponding path program 1 times [2025-03-03 10:31:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128643457] [2025-03-03 10:31:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:01,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 10:31:01,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 10:31:01,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:01,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:01,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:01,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128643457] [2025-03-03 10:31:01,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128643457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:01,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:01,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162595892] [2025-03-03 10:31:01,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:01,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:01,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:01,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:01,346 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 10:31:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:01,756 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2025-03-03 10:31:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:01,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 10:31:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:01,759 INFO L225 Difference]: With dead ends: 701 [2025-03-03 10:31:01,759 INFO L226 Difference]: Without dead ends: 421 [2025-03-03 10:31:01,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:31:01,760 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:01,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-03 10:31:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-03 10:31:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4190476190476191) internal successors, (596), 420 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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 10:31:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2025-03-03 10:31:01,776 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 118 [2025-03-03 10:31:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:01,776 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2025-03-03 10:31:01,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 10:31:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2025-03-03 10:31:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 10:31:01,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:01,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:01,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:31:01,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:01,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1886182008, now seen corresponding path program 1 times [2025-03-03 10:31:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:01,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137686521] [2025-03-03 10:31:01,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:01,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 10:31:01,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 10:31:01,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:01,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:02,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:02,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137686521] [2025-03-03 10:31:02,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137686521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:02,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749668580] [2025-03-03 10:31:02,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:02,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:02,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:02,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:02,030 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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 10:31:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:02,418 INFO L93 Difference]: Finished difference Result 1257 states and 1783 transitions. [2025-03-03 10:31:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 10:31:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:02,429 INFO L225 Difference]: With dead ends: 1257 [2025-03-03 10:31:02,429 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 10:31:02,430 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 10:31:02,430 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 100 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:02,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 205 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 10:31:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2025-03-03 10:31:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.32378223495702) internal successors, (924), 698 states have internal predecessors, (924), 0 states have call successors, (0), 0 states 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 10:31:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 924 transitions. [2025-03-03 10:31:02,451 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 924 transitions. Word has length 124 [2025-03-03 10:31:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:02,451 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 924 transitions. [2025-03-03 10:31:02,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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 10:31:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 924 transitions. [2025-03-03 10:31:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 10:31:02,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:02,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:02,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:31:02,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 409608053, now seen corresponding path program 1 times [2025-03-03 10:31:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:02,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354754030] [2025-03-03 10:31:02,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:02,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 10:31:02,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 10:31:02,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:02,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:02,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:02,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354754030] [2025-03-03 10:31:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354754030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:02,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:02,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:02,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785864969] [2025-03-03 10:31:02,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:02,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:02,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:02,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:02,581 INFO L87 Difference]: Start difference. First operand 699 states and 924 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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 10:31:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:02,952 INFO L93 Difference]: Finished difference Result 1674 states and 2225 transitions. [2025-03-03 10:31:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-03 10:31:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:02,956 INFO L225 Difference]: With dead ends: 1674 [2025-03-03 10:31:02,956 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 10:31:02,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:31:02,960 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 61 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:02,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 70 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 10:31:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-03 10:31:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1967213114754098) internal successors, (1168), 976 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states 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 10:31:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1168 transitions. [2025-03-03 10:31:02,981 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1168 transitions. Word has length 135 [2025-03-03 10:31:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:02,982 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1168 transitions. [2025-03-03 10:31:02,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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 10:31:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1168 transitions. [2025-03-03 10:31:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 10:31:02,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:02,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:02,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:31:02,985 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2034961207, now seen corresponding path program 1 times [2025-03-03 10:31:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488345192] [2025-03-03 10:31:02,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:03,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 10:31:03,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 10:31:03,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:03,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488345192] [2025-03-03 10:31:03,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488345192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:03,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:03,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392703655] [2025-03-03 10:31:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:03,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:03,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:03,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:03,240 INFO L87 Difference]: Start difference. First operand 977 states and 1168 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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 10:31:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:03,552 INFO L93 Difference]: Finished difference Result 2091 states and 2483 transitions. [2025-03-03 10:31:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:03,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-03-03 10:31:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:03,555 INFO L225 Difference]: With dead ends: 2091 [2025-03-03 10:31:03,555 INFO L226 Difference]: Without dead ends: 1116 [2025-03-03 10:31:03,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:31:03,557 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:03,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 82 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-03-03 10:31:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-03-03 10:31:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1766816143497758) internal successors, (1312), 1115 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states 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 10:31:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1312 transitions. [2025-03-03 10:31:03,573 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1312 transitions. Word has length 162 [2025-03-03 10:31:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:03,573 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1312 transitions. [2025-03-03 10:31:03,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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 10:31:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1312 transitions. [2025-03-03 10:31:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 10:31:03,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:03,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:03,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:31:03,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1872215878, now seen corresponding path program 1 times [2025-03-03 10:31:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454769376] [2025-03-03 10:31:03,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:03,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 10:31:03,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 10:31:03,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:03,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:03,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454769376] [2025-03-03 10:31:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454769376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449209302] [2025-03-03 10:31:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:03,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:03,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:03,709 INFO L87 Difference]: Start difference. First operand 1116 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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 10:31:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:04,050 INFO L93 Difference]: Finished difference Result 2369 states and 2857 transitions. [2025-03-03 10:31:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-03-03 10:31:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:04,055 INFO L225 Difference]: With dead ends: 2369 [2025-03-03 10:31:04,055 INFO L226 Difference]: Without dead ends: 1394 [2025-03-03 10:31:04,056 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 10:31:04,057 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:04,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-03 10:31:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2025-03-03 10:31:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states 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 10:31:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2025-03-03 10:31:04,076 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 201 [2025-03-03 10:31:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:04,077 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2025-03-03 10:31:04,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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 10:31:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2025-03-03 10:31:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 10:31:04,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:04,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:04,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:31:04,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:04,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1862568561, now seen corresponding path program 1 times [2025-03-03 10:31:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97356484] [2025-03-03 10:31:04,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:04,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 10:31:04,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 10:31:04,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:04,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 10:31:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97356484] [2025-03-03 10:31:04,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97356484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:04,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:04,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:31:04,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215048011] [2025-03-03 10:31:04,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:04,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:31:04,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:04,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:31:04,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:31:04,436 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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 10:31:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:04,730 INFO L93 Difference]: Finished difference Result 2387 states and 2794 transitions. [2025-03-03 10:31:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:31:04,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 223 [2025-03-03 10:31:04,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:04,736 INFO L225 Difference]: With dead ends: 2387 [2025-03-03 10:31:04,737 INFO L226 Difference]: Without dead ends: 1255 [2025-03-03 10:31:04,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:31:04,739 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 107 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:04,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 17 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-03 10:31:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-03 10:31:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1626794258373205) internal successors, (1458), 1254 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states 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 10:31:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1458 transitions. [2025-03-03 10:31:04,762 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1458 transitions. Word has length 223 [2025-03-03 10:31:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:04,763 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1458 transitions. [2025-03-03 10:31:04,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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 10:31:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1458 transitions. [2025-03-03 10:31:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-03 10:31:04,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:04,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:31:04,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:31:04,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:04,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:04,767 INFO L85 PathProgramCache]: Analyzing trace with hash -101887299, now seen corresponding path program 1 times [2025-03-03 10:31:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:04,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071230088] [2025-03-03 10:31:04,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:04,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-03 10:31:04,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-03 10:31:04,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:04,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:05,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071230088] [2025-03-03 10:31:05,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071230088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:05,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:05,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:31:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887384243] [2025-03-03 10:31:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:05,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:31:05,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:05,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:31:05,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:31:05,087 INFO L87 Difference]: Start difference. First operand 1255 states and 1458 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 10:31:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:05,506 INFO L93 Difference]: Finished difference Result 2424 states and 2825 transitions. [2025-03-03 10:31:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:31:05,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2025-03-03 10:31:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:05,511 INFO L225 Difference]: With dead ends: 2424 [2025-03-03 10:31:05,511 INFO L226 Difference]: Without dead ends: 1255 [2025-03-03 10:31:05,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:31:05,513 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:05,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 25 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-03 10:31:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-03 10:31:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1578947368421053) internal successors, (1452), 1254 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states 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 10:31:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1452 transitions. [2025-03-03 10:31:05,539 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1452 transitions. Word has length 237 [2025-03-03 10:31:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:05,539 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1452 transitions. [2025-03-03 10:31:05,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 10:31:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1452 transitions. [2025-03-03 10:31:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 10:31:05,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:05,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:05,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:31:05,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:05,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash -189198493, now seen corresponding path program 1 times [2025-03-03 10:31:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167669987] [2025-03-03 10:31:05,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:05,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 10:31:05,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 10:31:05,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:05,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 10:31:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:05,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167669987] [2025-03-03 10:31:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167669987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:05,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:31:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918823398] [2025-03-03 10:31:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:31:05,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:05,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:31:05,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:31:05,963 INFO L87 Difference]: Start difference. First operand 1255 states and 1452 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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 10:31:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:06,320 INFO L93 Difference]: Finished difference Result 2387 states and 2777 transitions. [2025-03-03 10:31:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 273 [2025-03-03 10:31:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:06,323 INFO L225 Difference]: With dead ends: 2387 [2025-03-03 10:31:06,324 INFO L226 Difference]: Without dead ends: 1255 [2025-03-03 10:31:06,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:31:06,326 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:06,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 19 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-03 10:31:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-03 10:31:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1523125996810208) internal successors, (1445), 1254 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states 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 10:31:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1445 transitions. [2025-03-03 10:31:06,345 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1445 transitions. Word has length 273 [2025-03-03 10:31:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:06,345 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1445 transitions. [2025-03-03 10:31:06,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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 10:31:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1445 transitions. [2025-03-03 10:31:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-03 10:31:06,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:06,348 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:31:06,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:31:06,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:06,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash 17616159, now seen corresponding path program 1 times [2025-03-03 10:31:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047319023] [2025-03-03 10:31:06,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:06,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-03 10:31:06,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 10:31:06,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:06,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 10:31:06,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047319023] [2025-03-03 10:31:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047319023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:06,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:06,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:06,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937672692] [2025-03-03 10:31:06,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:06,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:06,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:06,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:06,518 INFO L87 Difference]: Start difference. First operand 1255 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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 10:31:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:06,890 INFO L93 Difference]: Finished difference Result 2647 states and 3118 transitions. [2025-03-03 10:31:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:06,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 297 [2025-03-03 10:31:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:06,895 INFO L225 Difference]: With dead ends: 2647 [2025-03-03 10:31:06,895 INFO L226 Difference]: Without dead ends: 1533 [2025-03-03 10:31:06,896 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 10:31:06,896 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:06,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 223 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-03-03 10:31:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1394. [2025-03-03 10:31:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.1478822684852836) internal successors, (1599), 1393 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states 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 10:31:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1599 transitions. [2025-03-03 10:31:06,924 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1599 transitions. Word has length 297 [2025-03-03 10:31:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:06,925 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1599 transitions. [2025-03-03 10:31:06,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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 10:31:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1599 transitions. [2025-03-03 10:31:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 10:31:06,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:06,930 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:06,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:31:06,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:06,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash -185676293, now seen corresponding path program 1 times [2025-03-03 10:31:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:06,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707376647] [2025-03-03 10:31:06,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:06,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 10:31:06,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 10:31:06,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:06,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-03 10:31:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707376647] [2025-03-03 10:31:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707376647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:07,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:07,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896412568] [2025-03-03 10:31:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:07,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:07,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:07,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:07,325 INFO L87 Difference]: Start difference. First operand 1394 states and 1599 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 10:31:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:07,695 INFO L93 Difference]: Finished difference Result 2647 states and 3053 transitions. [2025-03-03 10:31:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:07,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 348 [2025-03-03 10:31:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:07,701 INFO L225 Difference]: With dead ends: 2647 [2025-03-03 10:31:07,701 INFO L226 Difference]: Without dead ends: 1394 [2025-03-03 10:31:07,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 10:31:07,704 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 115 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:07,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 159 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-03 10:31:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2025-03-03 10:31:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1228070175438596) internal successors, (1408), 1254 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states 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 10:31:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1408 transitions. [2025-03-03 10:31:07,722 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1408 transitions. Word has length 348 [2025-03-03 10:31:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:07,722 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1408 transitions. [2025-03-03 10:31:07,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 10:31:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1408 transitions. [2025-03-03 10:31:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-03 10:31:07,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:07,725 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:07,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:31:07,726 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:07,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1369786643, now seen corresponding path program 1 times [2025-03-03 10:31:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:07,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266234390] [2025-03-03 10:31:07,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:07,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-03 10:31:07,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-03 10:31:07,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:07,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 10:31:07,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266234390] [2025-03-03 10:31:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266234390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:07,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411710850] [2025-03-03 10:31:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:07,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:07,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:07,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:07,881 INFO L87 Difference]: Start difference. First operand 1255 states and 1408 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 10:31:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:08,236 INFO L93 Difference]: Finished difference Result 3203 states and 3628 transitions. [2025-03-03 10:31:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:08,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 350 [2025-03-03 10:31:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:08,242 INFO L225 Difference]: With dead ends: 3203 [2025-03-03 10:31:08,242 INFO L226 Difference]: Without dead ends: 2089 [2025-03-03 10:31:08,244 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 10:31:08,244 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:08,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 204 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-03-03 10:31:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2025-03-03 10:31:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.1077586206896552) internal successors, (2313), 2088 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states 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 10:31:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2313 transitions. [2025-03-03 10:31:08,273 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2313 transitions. Word has length 350 [2025-03-03 10:31:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:08,273 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2313 transitions. [2025-03-03 10:31:08,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 10:31:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2313 transitions. [2025-03-03 10:31:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 10:31:08,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:08,278 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:08,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:31:08,278 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:08,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1516959076, now seen corresponding path program 1 times [2025-03-03 10:31:08,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:08,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882101125] [2025-03-03 10:31:08,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:08,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 10:31:08,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 10:31:08,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:08,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-03 10:31:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882101125] [2025-03-03 10:31:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882101125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:08,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:08,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059734335] [2025-03-03 10:31:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:08,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:08,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:08,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:08,455 INFO L87 Difference]: Start difference. First operand 2089 states and 2313 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 10:31:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:08,798 INFO L93 Difference]: Finished difference Result 4313 states and 4816 transitions. [2025-03-03 10:31:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 363 [2025-03-03 10:31:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:08,799 INFO L225 Difference]: With dead ends: 4313 [2025-03-03 10:31:08,799 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:31:08,802 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 10:31:08,802 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 93 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:08,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 220 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:31:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:31:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states 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 10:31:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:31:08,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 363 [2025-03-03 10:31:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:08,803 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:31:08,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 10:31:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:31:08,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:31:08,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:31:08,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:31:08,808 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:08,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:31:08,943 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:31:08,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:31:08 BoogieIcfgContainer [2025-03-03 10:31:08,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:31:08,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:31:08,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:31:08,958 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:31:08,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:59" (3/4) ... [2025-03-03 10:31:08,961 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:31:08,976 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:31:08,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:31:08,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:31:08,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:31:09,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:31:09,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:31:09,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:31:09,070 INFO L158 Benchmark]: Toolchain (without parser) took 10665.05ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 111.6MB in the beginning and 201.1MB in the end (delta: -89.5MB). Peak memory consumption was 205.5MB. Max. memory is 16.1GB. [2025-03-03 10:31:09,070 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:31:09,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.92ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 84.7MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:31:09,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.33ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 76.8MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:31:09,070 INFO L158 Benchmark]: Boogie Preprocessor took 72.21ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 68.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:31:09,071 INFO L158 Benchmark]: IcfgBuilder took 1052.52ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 68.0MB in the beginning and 321.9MB in the end (delta: -253.9MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2025-03-03 10:31:09,071 INFO L158 Benchmark]: TraceAbstraction took 9008.30ms. Allocated memory was 360.7MB in the beginning and 436.2MB in the end (delta: 75.5MB). Free memory was 321.0MB in the beginning and 213.7MB in the end (delta: 107.3MB). Peak memory consumption was 180.5MB. Max. memory is 16.1GB. [2025-03-03 10:31:09,071 INFO L158 Benchmark]: Witness Printer took 110.98ms. Allocated memory is still 436.2MB. Free memory was 213.7MB in the beginning and 201.1MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:31:09,072 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.14ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.92ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 84.7MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.33ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 76.8MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.21ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 68.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1052.52ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 68.0MB in the beginning and 321.9MB in the end (delta: -253.9MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9008.30ms. Allocated memory was 360.7MB in the beginning and 436.2MB in the end (delta: 75.5MB). Free memory was 321.0MB in the beginning and 213.7MB in the end (delta: 107.3MB). Peak memory consumption was 180.5MB. Max. memory is 16.1GB. * Witness Printer took 110.98ms. Allocated memory is still 436.2MB. Free memory was 213.7MB in the beginning and 201.1MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. 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 - PositiveResult [Line: 161]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1179 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1179 mSDsluCounter, 1549 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 630 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5415 IncrementalHoareTripleChecker+Invalid, 6045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 630 mSolverCounterUnsat, 1469 mSDtfsCounter, 5415 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2089occurred in iteration=12, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 556 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2880 NumberOfCodeBlocks, 2880 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2867 ConstructedInterpolants, 0 QuantifiedInterpolants, 8601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2264/2264 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: ((((((((a10 <= 0) && (14 == a4)) && (a12 == 0)) && (9 <= a19)) || ((((14 == a4) && (a12 == 0)) && (a19 == 8)) && (41 <= a1))) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (a10 != 0))) || (((14 == a4) && (a12 == 0)) && (a19 == 6))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:31:09,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE