./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i --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/loop-zilu/benchmark23_conjunctive.i -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 c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:59:55,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:59:55,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:59:55,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:59:55,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:59:55,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:59:55,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:59:55,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:59:55,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:59:55,814 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:59:55,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:59:55,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:59:55,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:59:55,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:59:55,814 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:59:55,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:59:55,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:59:55,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:59:55,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:59:55,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:59:55,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:59:55,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:59:55,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:59:55,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:59:55,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:59:55,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:59:55,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:59:55,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:59:55,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:59:55,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:59:55,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:59:55,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:59:55,818 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 -> c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 [2025-03-16 17:59:56,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:59:56,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:59:56,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:59:56,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:59:56,036 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:59:56,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2025-03-16 17:59:57,099 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804cb982a/fbc66d5bf5954e5e9ea21e05d501ac94/FLAG77022921e [2025-03-16 17:59:57,302 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:59:57,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2025-03-16 17:59:57,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804cb982a/fbc66d5bf5954e5e9ea21e05d501ac94/FLAG77022921e [2025-03-16 17:59:57,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804cb982a/fbc66d5bf5954e5e9ea21e05d501ac94 [2025-03-16 17:59:57,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:59:57,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:59:57,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:59:57,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:59:57,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:59:57,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5621c79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57, skipping insertion in model container [2025-03-16 17:59:57,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:59:57,790 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/loop-zilu/benchmark23_conjunctive.i[873,886] [2025-03-16 17:59:57,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:59:57,807 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:59:57,815 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/loop-zilu/benchmark23_conjunctive.i[873,886] [2025-03-16 17:59:57,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:59:57,825 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:59:57,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57 WrapperNode [2025-03-16 17:59:57,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:59:57,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:59:57,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:59:57,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:59:57,831 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:59:57" (1/1) ... [2025-03-16 17:59:57,835 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:59:57" (1/1) ... [2025-03-16 17:59:57,843 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2025-03-16 17:59:57,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:59:57,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:59:57,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:59:57,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:59:57,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,855 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 17:59:57,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:59:57,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:59:57,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:59:57,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:59:57,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (1/1) ... [2025-03-16 17:59:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:59:57,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:57,886 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:59:57,889 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:59:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:59:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:59:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:59:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:59:57,939 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:59:57,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:59:58,011 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-16 17:59:58,012 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:59:58,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:59:58,017 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:59:58,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:59:58 BoogieIcfgContainer [2025-03-16 17:59:58,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:59:58,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:59:58,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:59:58,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:59:58,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:59:57" (1/3) ... [2025-03-16 17:59:58,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fdf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:59:58, skipping insertion in model container [2025-03-16 17:59:58,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:59:57" (2/3) ... [2025-03-16 17:59:58,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fdf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:59:58, skipping insertion in model container [2025-03-16 17:59:58,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:59:58" (3/3) ... [2025-03-16 17:59:58,024 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.i [2025-03-16 17:59:58,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:59:58,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark23_conjunctive.i that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 17:59:58,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:59:58,082 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;@71ff1c0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:59:58,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:59:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:59:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-16 17:59:58,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:58,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-16 17:59:58,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:58,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 40045990, now seen corresponding path program 1 times [2025-03-16 17:59:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358061614] [2025-03-16 17:59:58,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:58,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 17:59:58,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 17:59:58,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:58,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:58,218 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:59:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358061614] [2025-03-16 17:59:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358061614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:59:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:59:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:59:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078859623] [2025-03-16 17:59:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:59:58,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:59:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:58,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:59:58,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:58,240 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:59:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:58,270 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2025-03-16 17:59:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:59:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-16 17:59:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:58,279 INFO L225 Difference]: With dead ends: 18 [2025-03-16 17:59:58,279 INFO L226 Difference]: Without dead ends: 7 [2025-03-16 17:59:58,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:59:58,284 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 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:59:58,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-16 17:59:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-16 17:59:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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:59:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-16 17:59:58,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-16 17:59:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:58,308 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-16 17:59:58,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:59:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-16 17:59:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:59:58,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:58,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:59:58,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:59:58,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:58,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1241457438, now seen corresponding path program 1 times [2025-03-16 17:59:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:58,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608883731] [2025-03-16 17:59:58,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:58,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:59:58,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:59:58,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608883731] [2025-03-16 17:59:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608883731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798508631] [2025-03-16 17:59:58,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:59:58,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:58,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:58,382 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:59:58,383 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:59:58,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:59:58,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:59:58,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:59:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:58,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:59:58,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:58,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:59:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798508631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:58,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 17:59:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281342607] [2025-03-16 17:59:58,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:58,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:59:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:58,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:59:58,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:59:58,474 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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:59:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:58,501 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-03-16 17:59:58,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:59:58,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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 6 [2025-03-16 17:59:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:58,502 INFO L225 Difference]: With dead ends: 13 [2025-03-16 17:59:58,502 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 17:59:58,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:59:58,503 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:58,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 17:59:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-16 17:59:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:59:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-16 17:59:58,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2025-03-16 17:59:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:58,507 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-16 17:59:58,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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:59:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-16 17:59:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:59:58,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:58,508 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-03-16 17:59:58,516 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:59:58,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:58,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:58,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash 326675366, now seen corresponding path program 2 times [2025-03-16 17:59:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:58,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527545678] [2025-03-16 17:59:58,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:59:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:58,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-16 17:59:58,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:59:58,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:59:58,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:58,812 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:59:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527545678] [2025-03-16 17:59:58,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527545678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194792659] [2025-03-16 17:59:58,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:59:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:58,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:58,818 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:59:58,819 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:59:58,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-16 17:59:58,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:59:58,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:59:58,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:58,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:59:58,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:58,862 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:59:58,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:58,920 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:59:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194792659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:58,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-16 17:59:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790349804] [2025-03-16 17:59:58,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:58,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 17:59:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:58,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 17:59:58,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-16 17:59:58,921 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:59:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:58,944 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2025-03-16 17:59:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 17:59:58,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:59:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:58,945 INFO L225 Difference]: With dead ends: 19 [2025-03-16 17:59:58,945 INFO L226 Difference]: Without dead ends: 16 [2025-03-16 17:59:58,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-16 17:59:58,946 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:58,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-16 17:59:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-16 17:59:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:59:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-16 17:59:58,951 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2025-03-16 17:59:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:58,951 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-16 17:59:58,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:59:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-16 17:59:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:59:58,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:58,952 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-16 17:59:58,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:59:59,152 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,SelfDestructingSolverStorable2 [2025-03-16 17:59:59,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1576204454, now seen corresponding path program 3 times [2025-03-16 17:59:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550588198] [2025-03-16 17:59:59,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:59:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:59,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-03-16 17:59:59,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:59:59,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 17:59:59,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:59,345 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:59:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:59:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550588198] [2025-03-16 17:59:59,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550588198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:59:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489702978] [2025-03-16 17:59:59,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:59:59,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:59,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:59:59,347 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:59:59,348 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:59:59,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-03-16 17:59:59,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:59:59,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 17:59:59,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:59:59,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 17:59:59,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:59:59,419 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:59:59,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:59:59,633 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:59:59,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489702978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:59:59,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:59:59,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-03-16 17:59:59,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349949226] [2025-03-16 17:59:59,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:59:59,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 17:59:59,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:59:59,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 17:59:59,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-16 17:59:59,635 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:59:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:59:59,688 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-03-16 17:59:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 17:59:59,689 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-16 17:59:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:59:59,689 INFO L225 Difference]: With dead ends: 31 [2025-03-16 17:59:59,689 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 17:59:59,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-16 17:59:59,690 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:59:59,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:59:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 17:59:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-16 17:59:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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:59:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-03-16 17:59:59,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2025-03-16 17:59:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:59:59,696 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-03-16 17:59:59,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:59:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-03-16 17:59:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 17:59:59,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:59:59,697 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1] [2025-03-16 17:59:59,703 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:59:59,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:59:59,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:59:59,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:59:59,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1898861222, now seen corresponding path program 4 times [2025-03-16 17:59:59,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:59:59,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321238885] [2025-03-16 17:59:59,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:59:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:59:59,906 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-16 17:59:59,922 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 17:59:59,922 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:59:59,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:00,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:00:00,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321238885] [2025-03-16 18:00:00,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321238885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:00:00,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131444425] [2025-03-16 18:00:00,307 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:00:00,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:00,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:00,310 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 18:00:00,311 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 18:00:00,335 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-16 18:00:00,350 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 18:00:00,350 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 18:00:00,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:00,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 18:00:00,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:00,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:01,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131444425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:01,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:00:01,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2025-03-16 18:00:01,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125125038] [2025-03-16 18:00:01,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:01,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 18:00:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:00:01,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 18:00:01,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 18:00:01,082 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:00:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:01,126 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2025-03-16 18:00:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-16 18:00:01,127 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-16 18:00:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:01,127 INFO L225 Difference]: With dead ends: 55 [2025-03-16 18:00:01,127 INFO L226 Difference]: Without dead ends: 52 [2025-03-16 18:00:01,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 18:00:01,129 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:01,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:00:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-16 18:00:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-16 18:00:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:00:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2025-03-16 18:00:01,134 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 27 [2025-03-16 18:00:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:01,134 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2025-03-16 18:00:01,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:00:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2025-03-16 18:00:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 18:00:01,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:01,136 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1] [2025-03-16 18:00:01,142 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 18:00:01,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:01,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:01,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:01,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1635780262, now seen corresponding path program 5 times [2025-03-16 18:00:01,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:00:01,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745561030] [2025-03-16 18:00:01,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 18:00:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:00:01,345 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 24 equivalence classes. [2025-03-16 18:00:01,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 18:00:01,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-16 18:00:01,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:02,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:00:02,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745561030] [2025-03-16 18:00:02,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745561030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:00:02,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402079788] [2025-03-16 18:00:02,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 18:00:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:02,505 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 18:00:02,506 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 18:00:02,530 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 24 equivalence classes. [2025-03-16 18:00:02,557 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 18:00:02,557 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-16 18:00:02,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:02,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-16 18:00:02,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:02,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:05,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402079788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:05,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:00:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2025-03-16 18:00:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031064672] [2025-03-16 18:00:05,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:05,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-16 18:00:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:00:05,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-16 18:00:05,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-16 18:00:05,525 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 96 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 18:00:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:05,680 INFO L93 Difference]: Finished difference Result 103 states and 150 transitions. [2025-03-16 18:00:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-16 18:00:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 18:00:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:05,684 INFO L225 Difference]: With dead ends: 103 [2025-03-16 18:00:05,688 INFO L226 Difference]: Without dead ends: 100 [2025-03-16 18:00:05,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-16 18:00:05,691 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:05,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:00:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-16 18:00:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-16 18:00:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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 18:00:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2025-03-16 18:00:05,709 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 51 [2025-03-16 18:00:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:05,709 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2025-03-16 18:00:05,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 18:00:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2025-03-16 18:00:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 18:00:05,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:05,716 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1] [2025-03-16 18:00:05,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 18:00:05,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:05,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:05,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash 261058214, now seen corresponding path program 6 times [2025-03-16 18:00:05,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:00:05,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527438533] [2025-03-16 18:00:05,919 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 18:00:05,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:00:05,943 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 99 statements into 48 equivalence classes. [2025-03-16 18:00:06,036 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:00:06,043 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-16 18:00:06,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:10,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:00:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527438533] [2025-03-16 18:00:10,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527438533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:00:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581955418] [2025-03-16 18:00:10,204 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 18:00:10,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:10,207 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 18:00:10,208 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 18:00:10,248 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 99 statements into 48 equivalence classes. [2025-03-16 18:00:10,349 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:00:10,349 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-16 18:00:10,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:10,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-16 18:00:10,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:10,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581955418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:15,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:00:15,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2025-03-16 18:00:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684123474] [2025-03-16 18:00:15,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:15,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-03-16 18:00:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:00:15,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-03-16 18:00:15,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-03-16 18:00:15,384 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 102 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 18:00:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:15,522 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2025-03-16 18:00:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-16 18:00:15,524 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 0 states have call successors, (0), 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 99 [2025-03-16 18:00:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:15,525 INFO L225 Difference]: With dead ends: 109 [2025-03-16 18:00:15,525 INFO L226 Difference]: Without dead ends: 106 [2025-03-16 18:00:15,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 103 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-03-16 18:00:15,527 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:15,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:00:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-16 18:00:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-16 18:00:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 18:00:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2025-03-16 18:00:15,547 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 99 [2025-03-16 18:00:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:15,548 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2025-03-16 18:00:15,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 18:00:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2025-03-16 18:00:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 18:00:15,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:15,550 INFO L218 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1] [2025-03-16 18:00:15,564 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 18:00:15,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:15,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:15,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:15,754 INFO L85 PathProgramCache]: Analyzing trace with hash -794068058, now seen corresponding path program 7 times [2025-03-16 18:00:15,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:00:15,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034328182] [2025-03-16 18:00:15,755 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 18:00:15,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:00:15,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 18:00:15,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 18:00:15,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:15,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:00:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034328182] [2025-03-16 18:00:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034328182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:00:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852123335] [2025-03-16 18:00:21,264 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 18:00:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:00:21,266 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 18:00:21,267 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 18:00:21,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 18:00:21,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 18:00:21,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:00:21,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:21,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 205 conjuncts are in the unsatisfiable core [2025-03-16 18:00:21,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:00:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:21,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:00:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852123335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:00:22,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:00:22,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 105 [2025-03-16 18:00:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429092266] [2025-03-16 18:00:22,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:00:22,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-03-16 18:00:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:00:22,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-03-16 18:00:22,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2025-03-16 18:00:22,018 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand has 105 states, 105 states have (on average 1.019047619047619) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 18:00:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:25,849 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2025-03-16 18:00:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-03-16 18:00:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.019047619047619) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 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 105 [2025-03-16 18:00:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:25,854 INFO L225 Difference]: With dead ends: 110 [2025-03-16 18:00:25,854 INFO L226 Difference]: Without dead ends: 107 [2025-03-16 18:00:25,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2025-03-16 18:00:25,859 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 10711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:25,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 10711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10711 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 18:00:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-16 18:00:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-16 18:00:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 18:00:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2025-03-16 18:00:25,874 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2025-03-16 18:00:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:25,875 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2025-03-16 18:00:25,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.019047619047619) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 18:00:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2025-03-16 18:00:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 18:00:25,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:00:25,875 INFO L218 NwaCegarLoop]: trace histogram [101, 1, 1, 1, 1, 1] [2025-03-16 18:00:25,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 18:00:26,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:00:26,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:00:26,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:00:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1153725726, now seen corresponding path program 8 times [2025-03-16 18:00:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:00:26,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703504636] [2025-03-16 18:00:26,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:00:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:00:26,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-16 18:00:26,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 18:00:26,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:00:26,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:00:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:00:31,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:00:31,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703504636] [2025-03-16 18:00:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703504636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:00:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:00:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2025-03-16 18:00:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923396581] [2025-03-16 18:00:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:00:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2025-03-16 18:00:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:00:31,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2025-03-16 18:00:31,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2025-03-16 18:00:31,844 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 103 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 18:00:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:00:32,121 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2025-03-16 18:00:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-16 18:00:32,122 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 18:00:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:00:32,122 INFO L225 Difference]: With dead ends: 107 [2025-03-16 18:00:32,122 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 18:00:32,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2025-03-16 18:00:32,125 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:00:32,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:00:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 18:00:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 18:00:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 18:00:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 18:00:32,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2025-03-16 18:00:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:00:32,128 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 18:00:32,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.029126213592233) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 18:00:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 18:00:32,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 18:00:32,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:00:32,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:00:32,132 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1] [2025-03-16 18:00:32,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 18:00:33,346 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:00:33,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:00:33 BoogieIcfgContainer [2025-03-16 18:00:33,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:00:33,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:00:33,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:00:33,397 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:00:33,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:59:58" (3/4) ... [2025-03-16 18:00:33,403 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 18:00:33,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-16 18:00:33,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 18:00:33,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 18:00:33,422 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 18:00:33,532 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:00:33,532 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:00:33,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:00:33,532 INFO L158 Benchmark]: Toolchain (without parser) took 35858.66ms. Allocated memory was 201.3MB in the beginning and 486.5MB in the end (delta: 285.2MB). Free memory was 155.6MB in the beginning and 276.7MB in the end (delta: -121.0MB). Peak memory consumption was 157.9MB. Max. memory is 16.1GB. [2025-03-16 18:00:33,535 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:00:33,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.30ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 144.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:00:33,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.36ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 143.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:00:33,536 INFO L158 Benchmark]: Boogie Preprocessor took 14.83ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 142.8MB in the end (delta: 748.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:00:33,536 INFO L158 Benchmark]: IcfgBuilder took 158.22ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 131.8MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:00:33,537 INFO L158 Benchmark]: TraceAbstraction took 35377.47ms. Allocated memory was 201.3MB in the beginning and 486.5MB in the end (delta: 285.2MB). Free memory was 131.5MB in the beginning and 285.1MB in the end (delta: -153.6MB). Peak memory consumption was 243.7MB. Max. memory is 16.1GB. [2025-03-16 18:00:33,537 INFO L158 Benchmark]: Witness Printer took 135.04ms. Allocated memory is still 486.5MB. Free memory was 285.1MB in the beginning and 276.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:00:33,540 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.30ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 144.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.36ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 143.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.83ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 142.8MB in the end (delta: 748.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 158.22ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 131.8MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35377.47ms. Allocated memory was 201.3MB in the beginning and 486.5MB in the end (delta: 285.2MB). Free memory was 131.5MB in the beginning and 285.1MB in the end (delta: -153.6MB). Peak memory consumption was 243.7MB. Max. memory is 16.1GB. * Witness Printer took 135.04ms. Allocated memory is still 486.5MB. Free memory was 285.1MB in the beginning and 276.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 12 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 9, TraceHistogramMax: 101, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11537 IncrementalHoareTripleChecker+Invalid, 11542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 46 mSDtfsCounter, 11537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1015 GetRequests, 443 SyntacticMatches, 91 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=8, InterpolantAutomatonStates: 498, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 2939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1616 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 5151/37896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j == 124) && (62 == i)) || ((i == 11) && (22 == j))) || ((76 == j) && (i == 38))) || ((41 == i) && (82 == j))) || ((94 == i) && (j == 188))) || ((i == 15) && (30 == j))) || ((i == 63) && (j == 126))) || ((23 == i) && (46 == j))) || ((j == 80) && (40 == i))) || ((134 == j) && (67 == i))) || ((154 == j) && (77 == i))) || ((9 == i) && (j == 18))) || ((i == 4) && (j == 8))) || ((j == 166) && (i == 83))) || ((j == 12) && (6 == i))) || ((88 == i) && (176 == j))) || ((88 == j) && (44 == i))) || ((i == 26) && (52 == j))) || ((i == 39) && (j == 78))) || ((68 == j) && (i == 34))) || ((7 == i) && (14 == j))) || ((32 == j) && (16 == i))) || ((i == 93) && (j == 186))) || ((j == 180) && (i == 90))) || ((j == 26) && (i == 13))) || ((42 == i) && (84 == j))) || ((j == 38) && (19 == i))) || ((68 == i) && (j == 136))) || ((40 == j) && (i == 20))) || ((71 == i) && (142 == j))) || ((i == 8) && (16 == j))) || ((100 <= i) && (200 == j))) || ((56 == i) && (112 == j))) || ((2 == j) && (i == 1))) || ((91 == i) && (j == 182))) || ((156 == j) && (i == 78))) || ((35 == i) && (j == 70))) || ((j == 100) && (i == 50))) || ((j == 50) && (i == 25))) || ((i == 0) && (j == 0))) || ((j == 198) && (i == 99))) || ((108 == j) && (i == 54))) || ((i == 96) && (192 == j))) || ((j == 90) && (i == 45))) || ((144 == j) && (72 == i))) || ((57 == i) && (j == 114))) || ((i == 80) && (160 == j))) || ((i == 79) && (158 == j))) || ((190 == j) && (95 == i))) || ((i == 43) && (j == 86))) || ((j == 60) && (30 == i))) || ((46 == i) && (92 == j))) || ((106 == j) && (53 == i))) || ((i == 33) && (66 == j))) || ((i == 86) && (j == 172))) || ((64 == j) && (32 == i))) || ((i == 60) && (j == 120))) || ((5 == i) && (j == 10))) || ((j == 162) && (81 == i))) || ((29 == i) && (j == 58))) || ((14 == i) && (j == 28))) || ((94 == j) && (47 == i))) || ((i == 28) && (56 == j))) || ((62 == j) && (31 == i))) || ((194 == j) && (97 == i))) || ((i == 55) && (110 == j))) || ((j == 54) && (i == 27))) || ((j == 102) && (51 == i))) || ((164 == j) && (82 == i))) || ((138 == j) && (69 == i))) || ((64 == i) && (j == 128))) || ((j == 130) && (i == 65))) || ((i == 61) && (j == 122))) || ((6 == j) && (3 == i))) || ((104 == j) && (52 == i))) || ((98 == j) && (49 == i))) || ((j == 36) && (i == 18))) || ((196 == j) && (98 == i))) || ((i == 85) && (170 == j))) || ((i == 24) && (j == 48))) || ((152 == j) && (76 == i))) || ((i == 17) && (j == 34))) || ((j == 20) && (i == 10))) || ((66 == i) && (j == 132))) || ((i == 12) && (j == 24))) || ((j == 168) && (84 == i))) || ((i == 70) && (140 == j))) || ((92 == i) && (184 == j))) || ((j == 96) && (i == 48))) || ((j == 4) && (2 == i))) || ((21 == i) && (42 == j))) || ((22 == i) && (44 == j))) || ((146 == j) && (i == 73))) || ((116 == j) && (i == 58))) || ((178 == j) && (89 == i))) || ((i == 37) && (j == 74))) || ((i == 75) && (j == 150))) || ((i == 74) && (148 == j))) || ((i == 36) && (72 == j))) || ((87 == i) && (j == 174))) || ((j == 118) && (59 == i))) RESULT: Ultimate proved your program to be correct! [2025-03-16 18:00:33,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE