./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/linear_search.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/loops/linear_search.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 5daf86ff8189a9471a20a947a9c78ff63bc56ed2dde2c379166a5ef7ff47fae4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:46:26,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:46:26,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:46:26,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:46:26,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:46:26,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:46:26,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:46:26,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:46:26,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:46:26,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:46:26,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:46:26,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:46:26,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:46:26,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:46:26,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:46:26,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:46:26,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:46:26,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:46:26,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:46:26,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:46:26,766 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 -> 5daf86ff8189a9471a20a947a9c78ff63bc56ed2dde2c379166a5ef7ff47fae4 [2025-03-16 17:46:26,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:46:26,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:46:26,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:46:26,987 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:46:26,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:46:26,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/linear_search.c [2025-03-16 17:46:28,119 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee9b2931/aaa8d30ee3c8435e8946025055d25a37/FLAG934853397 [2025-03-16 17:46:28,340 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:46:28,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/linear_search.c [2025-03-16 17:46:28,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee9b2931/aaa8d30ee3c8435e8946025055d25a37/FLAG934853397 [2025-03-16 17:46:28,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee9b2931/aaa8d30ee3c8435e8946025055d25a37 [2025-03-16 17:46:28,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:46:28,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:46:28,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:46:28,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:46:28,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:46:28,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5136b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28, skipping insertion in model container [2025-03-16 17:46:28,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:46:28,521 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/loops/linear_search.c[383,396] [2025-03-16 17:46:28,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:46:28,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:46:28,549 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/loops/linear_search.c[383,396] [2025-03-16 17:46:28,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:46:28,563 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:46:28,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28 WrapperNode [2025-03-16 17:46:28,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:46:28,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:46:28,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:46:28,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:46:28,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,584 INFO L138 Inliner]: procedures = 17, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2025-03-16 17:46:28,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:46:28,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:46:28,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:46:28,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:46:28,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,598 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-16 17:46:28,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:46:28,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:46:28,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:46:28,607 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:46:28,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (1/1) ... [2025-03-16 17:46:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:46:28,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:46:28,631 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-16 17:46:28,634 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-16 17:46:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:46:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:46:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:46:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:46:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:46:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:46:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:46:28,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:46:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:46:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:46:28,713 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:46:28,714 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:46:28,809 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-16 17:46:28,809 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:46:28,815 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:46:28,815 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:46:28,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:46:28 BoogieIcfgContainer [2025-03-16 17:46:28,816 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:46:28,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:46:28,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:46:28,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:46:28,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:46:28" (1/3) ... [2025-03-16 17:46:28,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1813f8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:46:28, skipping insertion in model container [2025-03-16 17:46:28,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:46:28" (2/3) ... [2025-03-16 17:46:28,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1813f8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:46:28, skipping insertion in model container [2025-03-16 17:46:28,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:46:28" (3/3) ... [2025-03-16 17:46:28,825 INFO L128 eAbstractionObserver]: Analyzing ICFG linear_search.c [2025-03-16 17:46:28,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:46:28,836 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linear_search.c that has 1 procedures, 15 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 17:46:28,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:46:28,884 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;@27e7c4be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:46:28,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:46:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 17:46:28,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:28,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:28,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:28,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1300485330, now seen corresponding path program 1 times [2025-03-16 17:46:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433281595] [2025-03-16 17:46:28,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:28,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:28,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:46:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:46:28,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:28,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:29,037 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-16 17:46:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:29,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433281595] [2025-03-16 17:46:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433281595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:46:29,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:46:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:46:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980968776] [2025-03-16 17:46:29,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:46:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:46:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:29,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:46:29,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:46:29,059 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:46:29,067 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2025-03-16 17:46:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:46:29,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-16 17:46:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:46:29,073 INFO L225 Difference]: With dead ends: 24 [2025-03-16 17:46:29,073 INFO L226 Difference]: Without dead ends: 11 [2025-03-16 17:46:29,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:46:29,077 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:46:29,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:46:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-16 17:46:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-16 17:46:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2025-03-16 17:46:29,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 7 [2025-03-16 17:46:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:46:29,101 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-03-16 17:46:29,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2025-03-16 17:46:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:46:29,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:29,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:29,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:46:29,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash -690488465, now seen corresponding path program 1 times [2025-03-16 17:46:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473511275] [2025-03-16 17:46:29,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:29,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:46:29,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:46:29,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:29,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:29,264 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-16 17:46:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473511275] [2025-03-16 17:46:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473511275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:46:29,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:46:29,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:46:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593716033] [2025-03-16 17:46:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:46:29,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:46:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:29,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:46:29,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:46:29,266 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:46:29,278 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-03-16 17:46:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:46:29,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:46:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:46:29,279 INFO L225 Difference]: With dead ends: 15 [2025-03-16 17:46:29,279 INFO L226 Difference]: Without dead ends: 11 [2025-03-16 17:46:29,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:46:29,280 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:46:29,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:46:29,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-16 17:46:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-16 17:46:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-16 17:46:29,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2025-03-16 17:46:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:46:29,282 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-16 17:46:29,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-03-16 17:46:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:46:29,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:29,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:29,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:46:29,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:29,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash -690428883, now seen corresponding path program 1 times [2025-03-16 17:46:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583108475] [2025-03-16 17:46:29,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:29,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:46:29,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:46:29,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:29,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:29,477 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-16 17:46:29,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:29,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583108475] [2025-03-16 17:46:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583108475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:46:29,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:46:29,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:46:29,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199636772] [2025-03-16 17:46:29,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:46:29,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:46:29,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:29,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:46:29,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:46:29,479 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:46:29,502 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2025-03-16 17:46:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:46:29,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:46:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:46:29,504 INFO L225 Difference]: With dead ends: 19 [2025-03-16 17:46:29,504 INFO L226 Difference]: Without dead ends: 14 [2025-03-16 17:46:29,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 17:46:29,505 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:46:29,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:46:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-16 17:46:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-16 17:46:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-03-16 17:46:29,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2025-03-16 17:46:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:46:29,507 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-16 17:46:29,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2025-03-16 17:46:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 17:46:29,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:29,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:29,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:46:29,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:29,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash -51093324, now seen corresponding path program 1 times [2025-03-16 17:46:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217990222] [2025-03-16 17:46:29,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:29,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:46:29,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:46:29,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:29,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:29,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217990222] [2025-03-16 17:46:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217990222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:46:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:46:29,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:46:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726635240] [2025-03-16 17:46:29,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:46:29,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:46:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:29,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:46:29,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:46:29,606 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:46:29,633 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-03-16 17:46:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:46:29,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-16 17:46:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:46:29,634 INFO L225 Difference]: With dead ends: 28 [2025-03-16 17:46:29,634 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 17:46:29,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:46:29,635 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:46:29,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:46:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 17:46:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2025-03-16 17:46:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-03-16 17:46:29,637 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2025-03-16 17:46:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:46:29,637 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-16 17:46:29,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-03-16 17:46:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 17:46:29,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:29,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:29,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:46:29,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:29,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1691717011, now seen corresponding path program 1 times [2025-03-16 17:46:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900223012] [2025-03-16 17:46:29,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:29,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:46:29,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:46:29,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:29,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:29,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:29,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900223012] [2025-03-16 17:46:29,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900223012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:46:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076826774] [2025-03-16 17:46:29,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:29,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:46:29,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:46:29,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:46:29,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:46:29,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 17:46:29,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 17:46:29,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:29,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:29,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 17:46:29,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:46:30,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-16 17:46:30,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2025-03-16 17:46:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:30,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:46:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:30,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076826774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:46:30,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:46:30,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-03-16 17:46:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110948187] [2025-03-16 17:46:30,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:46:30,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 17:46:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:30,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 17:46:30,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-03-16 17:46:30,860 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:46:31,497 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-03-16 17:46:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 17:46:31,498 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-16 17:46:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:46:31,499 INFO L225 Difference]: With dead ends: 42 [2025-03-16 17:46:31,499 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 17:46:31,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=383, Unknown=0, NotChecked=0, Total=600 [2025-03-16 17:46:31,501 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:46:31,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 20 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:46:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 17:46:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-16 17:46:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 17:46:31,513 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2025-03-16 17:46:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:46:31,513 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 17:46:31,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 17:46:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 17:46:31,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:31,516 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:31,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:46:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:46:31,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:31,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:31,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2117681223, now seen corresponding path program 1 times [2025-03-16 17:46:31,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505430323] [2025-03-16 17:46:31,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:31,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:31,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:46:31,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:46:31,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:31,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:31,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:31,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505430323] [2025-03-16 17:46:31,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505430323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:46:31,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872618245] [2025-03-16 17:46:31,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:31,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:46:31,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:46:31,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:46:31,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:46:31,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:46:31,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:46:31,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:31,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:31,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:46:31,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:46:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:31,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:46:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872618245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:46:31,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:46:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-16 17:46:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195062291] [2025-03-16 17:46:31,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:46:31,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:46:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:31,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:46:31,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:46:31,935 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:46:32,019 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2025-03-16 17:46:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:46:32,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 17 [2025-03-16 17:46:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:46:32,019 INFO L225 Difference]: With dead ends: 48 [2025-03-16 17:46:32,020 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 17:46:32,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:46:32,020 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:46:32,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 30 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:46:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 17:46:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2025-03-16 17:46:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-03-16 17:46:32,026 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2025-03-16 17:46:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:46:32,026 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-03-16 17:46:32,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2025-03-16 17:46:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 17:46:32,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:32,026 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:32,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:46:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 17:46:32,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:32,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash -374870888, now seen corresponding path program 1 times [2025-03-16 17:46:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955300275] [2025-03-16 17:46:32,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:32,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:46:32,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:46:32,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:32,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:34,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:34,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955300275] [2025-03-16 17:46:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955300275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:46:34,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160876159] [2025-03-16 17:46:34,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:46:34,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:46:34,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:46:34,271 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:46:34,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:46:34,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:46:34,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:46:34,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:46:34,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:34,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-16 17:46:34,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:46:34,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-16 17:46:34,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2025-03-16 17:46:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:34,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:46:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:36,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160876159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:46:36,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:46:36,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 27 [2025-03-16 17:46:36,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983509067] [2025-03-16 17:46:36,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:46:36,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 17:46:36,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:36,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 17:46:36,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2025-03-16 17:46:36,524 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:46:42,623 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2025-03-16 17:46:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 17:46:42,624 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 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 17 [2025-03-16 17:46:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:46:42,624 INFO L225 Difference]: With dead ends: 88 [2025-03-16 17:46:42,624 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 17:46:42,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=622, Invalid=2134, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 17:46:42,626 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:46:42,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 30 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:46:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 17:46:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2025-03-16 17:46:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-03-16 17:46:42,637 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 17 [2025-03-16 17:46:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:46:42,639 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-03-16 17:46:42,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-03-16 17:46:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 17:46:42,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:42,640 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:42,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:46:42,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:46:42,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash -168380475, now seen corresponding path program 2 times [2025-03-16 17:46:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550039404] [2025-03-16 17:46:42,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:46:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:42,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-16 17:46:42,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 25 statements. [2025-03-16 17:46:42,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 17:46:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 17:46:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550039404] [2025-03-16 17:46:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550039404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:46:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728621494] [2025-03-16 17:46:43,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:46:43,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:46:43,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:46:43,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:46:43,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:46:43,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-16 17:46:43,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 25 statements. [2025-03-16 17:46:43,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 17:46:43,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:43,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 17:46:43,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:46:43,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-16 17:46:43,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-03-16 17:46:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 17:46:43,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:46:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 17:46:44,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728621494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:46:44,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:46:44,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-16 17:46:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069273207] [2025-03-16 17:46:44,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:46:44,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 17:46:44,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:44,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 17:46:44,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-16 17:46:44,260 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:46:44,552 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2025-03-16 17:46:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 17:46:44,553 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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 25 [2025-03-16 17:46:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:46:44,554 INFO L225 Difference]: With dead ends: 56 [2025-03-16 17:46:44,555 INFO L226 Difference]: Without dead ends: 51 [2025-03-16 17:46:44,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2025-03-16 17:46:44,556 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:46:44,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 14 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:46:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-16 17:46:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-16 17:46:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-16 17:46:44,567 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 25 [2025-03-16 17:46:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:46:44,567 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-16 17:46:44,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:46:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-16 17:46:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 17:46:44,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:46:44,568 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:46:44,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:46:44,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:46:44,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:46:44,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:46:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1424272842, now seen corresponding path program 2 times [2025-03-16 17:46:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:46:44,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377988570] [2025-03-16 17:46:44,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:46:44,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:46:44,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-16 17:46:44,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:46:44,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:46:44,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:47,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:46:47,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377988570] [2025-03-16 17:46:47,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377988570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:46:47,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974779013] [2025-03-16 17:46:47,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:46:47,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:46:47,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:46:47,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:46:47,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:46:47,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-16 17:46:47,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:46:47,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:46:47,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:46:47,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-16 17:46:47,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:46:47,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-16 17:46:48,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2025-03-16 17:46:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:48,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:46:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:46:52,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974779013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:46:52,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:46:52,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 17] total 39 [2025-03-16 17:46:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837892620] [2025-03-16 17:46:52,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:46:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 17:46:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:46:52,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 17:46:52,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 17:46:52,897 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 39 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:47:21,569 WARN L286 SmtUtils]: Spent 19.33s on a formula simplification. DAG size of input: 120 DAG size of output: 120 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 17:47:30,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 17:47:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:47:42,254 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2025-03-16 17:47:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-16 17:47:42,254 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 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 29 [2025-03-16 17:47:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:47:42,255 INFO L225 Difference]: With dead ends: 142 [2025-03-16 17:47:42,255 INFO L226 Difference]: Without dead ends: 108 [2025-03-16 17:47:42,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=1584, Invalid=7157, Unknown=1, NotChecked=0, Total=8742 [2025-03-16 17:47:42,260 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 196 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:47:42,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 59 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 17:47:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-16 17:47:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 76. [2025-03-16 17:47:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:47:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2025-03-16 17:47:42,274 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 29 [2025-03-16 17:47:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:47:42,275 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2025-03-16 17:47:42,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:47:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2025-03-16 17:47:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:47:42,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:47:42,275 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:47:42,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 17:47:42,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:47:42,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:47:42,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:47:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1543275695, now seen corresponding path program 2 times [2025-03-16 17:47:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:47:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910991132] [2025-03-16 17:47:42,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:47:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:47:42,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-16 17:47:42,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:47:42,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:47:42,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:47:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:47:42,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:47:42,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910991132] [2025-03-16 17:47:42,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910991132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:47:42,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413711873] [2025-03-16 17:47:42,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:47:42,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:47:42,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:47:42,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:47:42,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:47:42,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-16 17:47:42,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:47:42,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:47:42,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:47:42,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 17:47:42,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:47:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:47:42,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:47:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:47:42,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413711873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:47:42,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:47:42,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-16 17:47:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657390779] [2025-03-16 17:47:42,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:47:42,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 17:47:42,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:47:42,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 17:47:42,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:47:42,802 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:47:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:47:43,199 INFO L93 Difference]: Finished difference Result 208 states and 287 transitions. [2025-03-16 17:47:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 17:47:43,199 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 17:47:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:47:43,200 INFO L225 Difference]: With dead ends: 208 [2025-03-16 17:47:43,200 INFO L226 Difference]: Without dead ends: 164 [2025-03-16 17:47:43,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2025-03-16 17:47:43,201 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:47:43,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 62 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:47:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-16 17:47:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2025-03-16 17:47:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.25503355704698) internal successors, (187), 149 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:47:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 187 transitions. [2025-03-16 17:47:43,226 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 187 transitions. Word has length 33 [2025-03-16 17:47:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:47:43,226 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 187 transitions. [2025-03-16 17:47:43,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:47:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 187 transitions. [2025-03-16 17:47:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 17:47:43,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:47:43,227 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:47:43,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 17:47:43,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:47:43,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:47:43,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:47:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 597636092, now seen corresponding path program 3 times [2025-03-16 17:47:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:47:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073523518] [2025-03-16 17:47:43,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:47:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:47:43,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 9 equivalence classes. [2025-03-16 17:47:43,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:47:43,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-16 17:47:43,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:48:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:48:02,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:48:02,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073523518] [2025-03-16 17:48:02,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073523518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:48:02,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799936186] [2025-03-16 17:48:02,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:48:02,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:48:02,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:48:02,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:48:02,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:48:02,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 9 equivalence classes. [2025-03-16 17:48:02,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:48:02,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-16 17:48:02,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:48:02,973 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-16 17:48:02,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:48:03,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-16 17:48:04,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2025-03-16 17:48:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:48:05,943 INFO L312 TraceCheckSpWp]: Computing backward predicates...