./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-new/nested-1.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-new/nested-1.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 3baf312ca85439572472b3c02ed304b3157fa97373d6ada535e5a723c6c0219a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:52:25,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:52:25,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:52:25,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:52:25,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:52:25,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:52:25,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:52:25,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:52:25,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:52:25,800 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:52:25,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:52:25,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:52:25,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:52:25,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:52:25,800 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:52:25,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:52:25,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:52:25,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:52:25,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:52:25,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:52:25,802 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 -> 3baf312ca85439572472b3c02ed304b3157fa97373d6ada535e5a723c6c0219a [2025-03-16 17:52:26,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:52:26,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:52:26,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:52:26,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:52:26,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:52:26,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-new/nested-1.i [2025-03-16 17:52:27,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa2c0f2f/21b21a55f9d34e32b2e2f3c6aa81b083/FLAG973ca3cb5 [2025-03-16 17:52:27,340 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:52:27,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/nested-1.i [2025-03-16 17:52:27,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa2c0f2f/21b21a55f9d34e32b2e2f3c6aa81b083/FLAG973ca3cb5 [2025-03-16 17:52:27,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa2c0f2f/21b21a55f9d34e32b2e2f3c6aa81b083 [2025-03-16 17:52:27,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:52:27,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:52:27,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:52:27,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:52:27,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:52:27,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2b0628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27, skipping insertion in model container [2025-03-16 17:52:27,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:52:27,829 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-new/nested-1.i[891,904] [2025-03-16 17:52:27,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:52:27,850 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:52:27,858 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-new/nested-1.i[891,904] [2025-03-16 17:52:27,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:52:27,876 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:52:27,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27 WrapperNode [2025-03-16 17:52:27,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:52:27,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:52:27,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:52:27,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:52:27,884 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:52:27" (1/1) ... [2025-03-16 17:52:27,890 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:52:27" (1/1) ... [2025-03-16 17:52:27,903 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2025-03-16 17:52:27,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:52:27,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:52:27,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:52:27,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:52:27,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,919 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:52:27,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:52:27,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:52:27,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:52:27,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:52:27,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (1/1) ... [2025-03-16 17:52:27,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:52:27,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:52:27,953 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:52:27,955 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:52:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:52:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:52:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:52:27,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:52:28,011 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:52:28,012 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:52:28,108 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-16 17:52:28,108 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:52:28,114 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:52:28,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:52:28,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:52:28 BoogieIcfgContainer [2025-03-16 17:52:28,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:52:28,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:52:28,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:52:28,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:52:28,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:52:27" (1/3) ... [2025-03-16 17:52:28,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7dc0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:52:28, skipping insertion in model container [2025-03-16 17:52:28,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:52:27" (2/3) ... [2025-03-16 17:52:28,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7dc0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:52:28, skipping insertion in model container [2025-03-16 17:52:28,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:52:28" (3/3) ... [2025-03-16 17:52:28,122 INFO L128 eAbstractionObserver]: Analyzing ICFG nested-1.i [2025-03-16 17:52:28,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:52:28,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested-1.i that has 1 procedures, 12 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 17:52:28,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:52:28,183 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;@3f1961d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:52:28,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:52:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 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:52:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:52:28,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:28,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:52:28,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:28,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1448534679, now seen corresponding path program 1 times [2025-03-16 17:52:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662816293] [2025-03-16 17:52:28,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:52:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:28,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:52:28,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:52:28,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:52:28,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:28,370 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:52:28,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:28,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662816293] [2025-03-16 17:52:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662816293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:52:28,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:52:28,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:52:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075877314] [2025-03-16 17:52:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:52:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:52:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:28,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:52:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:52:28,393 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:52:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:28,429 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-16 17:52:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:52:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:52:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:28,436 INFO L225 Difference]: With dead ends: 22 [2025-03-16 17:52:28,436 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 17:52:28,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:52:28,442 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:28,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:52:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 17:52:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-16 17:52:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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:52:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-16 17:52:28,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2025-03-16 17:52:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:28,468 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-16 17:52:28,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:52:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-03-16 17:52:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 17:52:28,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:28,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:52:28,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:52:28,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:28,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash 475285593, now seen corresponding path program 1 times [2025-03-16 17:52:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:28,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145393951] [2025-03-16 17:52:28,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:52:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:28,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 17:52:28,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 17:52:28,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:52:28,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:28,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:28,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145393951] [2025-03-16 17:52:28,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145393951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:52:28,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:52:28,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:52:28,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553873487] [2025-03-16 17:52:28,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:52:28,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:52:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:28,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:52:28,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:52:28,533 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:52:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:28,549 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2025-03-16 17:52:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:52:28,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-16 17:52:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:28,550 INFO L225 Difference]: With dead ends: 15 [2025-03-16 17:52:28,550 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 17:52:28,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:52:28,552 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 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:52:28,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:52:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 17:52:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-16 17:52:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:52:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-03-16 17:52:28,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2025-03-16 17:52:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-16 17:52:28,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:52:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2025-03-16 17:52:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:52:28,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:28,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:52:28,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:52:28,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:28,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1849906764, now seen corresponding path program 1 times [2025-03-16 17:52:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056269945] [2025-03-16 17:52:28,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:52:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:28,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:52:28,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:52:28,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:52:28,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:28,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056269945] [2025-03-16 17:52:28,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056269945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:52:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385080050] [2025-03-16 17:52:28,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:52:28,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:28,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:52:28,638 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:52:28,639 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:52:28,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:52:28,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:52:28,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:52:28,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:28,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:52:28,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:52:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:28,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:52:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:52:28,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385080050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:52:28,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:52:28,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-16 17:52:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712685454] [2025-03-16 17:52:28,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:52:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:52:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:28,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:52:28,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:52:28,758 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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:52:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:28,798 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2025-03-16 17:52:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:52:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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) Word has length 9 [2025-03-16 17:52:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:28,799 INFO L225 Difference]: With dead ends: 19 [2025-03-16 17:52:28,799 INFO L226 Difference]: Without dead ends: 13 [2025-03-16 17:52:28,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-16 17:52:28,800 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:28,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:52:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-16 17:52:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-16 17:52:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:52:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-16 17:52:28,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2025-03-16 17:52:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:28,803 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-16 17:52:28,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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:52:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-16 17:52:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 17:52:28,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:28,805 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:52:28,811 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:52:29,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:29,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:29,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1499353831, now seen corresponding path program 2 times [2025-03-16 17:52:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:29,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949367009] [2025-03-16 17:52:29,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:52:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:29,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-16 17:52:29,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:52:29,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:52:29,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 17:52:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949367009] [2025-03-16 17:52:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949367009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:52:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244021355] [2025-03-16 17:52:29,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:52:29,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:29,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:52:29,098 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:52:29,099 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:52:29,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-16 17:52:29,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 17:52:29,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:52:29,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:29,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:52:29,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:52:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 17:52:29,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:52:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 17:52:29,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244021355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:52:29,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:52:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-16 17:52:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679883978] [2025-03-16 17:52:29,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:52:29,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:52:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:29,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:52:29,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:52:29,215 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:52:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:29,269 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-16 17:52:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:52:29,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-16 17:52:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:29,270 INFO L225 Difference]: With dead ends: 34 [2025-03-16 17:52:29,270 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 17:52:29,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-16 17:52:29,270 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:29,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 17 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:52:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 17:52:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 17:52:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:52:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-16 17:52:29,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 12 [2025-03-16 17:52:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:29,277 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-16 17:52:29,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:52:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-16 17:52:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:52:29,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:29,278 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-16 17:52:29,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:52:29,479 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,SelfDestructingSolverStorable3 [2025-03-16 17:52:29,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:29,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -981593185, now seen corresponding path program 3 times [2025-03-16 17:52:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053824190] [2025-03-16 17:52:29,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:52:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:29,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 13 equivalence classes. [2025-03-16 17:52:29,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 18 of 30 statements. [2025-03-16 17:52:29,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 17:52:29,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 17:52:29,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053824190] [2025-03-16 17:52:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053824190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:52:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144743324] [2025-03-16 17:52:29,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:52:29,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:29,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:52:29,598 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:52:29,599 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:52:29,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 13 equivalence classes. [2025-03-16 17:52:29,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 18 of 30 statements. [2025-03-16 17:52:29,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 17:52:29,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:29,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 17:52:29,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:52:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 17:52:29,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:52:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 17:52:29,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144743324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:52:29,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:52:29,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-16 17:52:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075884157] [2025-03-16 17:52:29,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:52:29,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 17:52:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:29,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 17:52:29,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2025-03-16 17:52:29,850 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:52:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:29,940 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2025-03-16 17:52:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 17:52:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-16 17:52:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:29,942 INFO L225 Difference]: With dead ends: 77 [2025-03-16 17:52:29,942 INFO L226 Difference]: Without dead ends: 55 [2025-03-16 17:52:29,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2025-03-16 17:52:29,943 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:29,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:52:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-16 17:52:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-16 17:52:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:52:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-03-16 17:52:29,965 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 30 [2025-03-16 17:52:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:29,965 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-03-16 17:52:29,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:52:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-03-16 17:52:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 17:52:29,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:29,969 INFO L218 NwaCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-16 17:52:29,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:52:30,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:30,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:30,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:30,170 INFO L85 PathProgramCache]: Analyzing trace with hash 133515039, now seen corresponding path program 4 times [2025-03-16 17:52:30,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:30,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051442117] [2025-03-16 17:52:30,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:52:30,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:30,177 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-16 17:52:30,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 17:52:30,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:52:30,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 17:52:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051442117] [2025-03-16 17:52:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051442117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:52:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436422354] [2025-03-16 17:52:30,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:52:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:52:30,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:52:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:52:30,418 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-16 17:52:30,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 17:52:30,444 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:52:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:30,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 17:52:30,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:52:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 17:52:30,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:52:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 17:52:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436422354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:52:30,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:52:30,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-16 17:52:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983888841] [2025-03-16 17:52:30,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:52:30,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 17:52:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:30,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 17:52:30,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2025-03-16 17:52:30,763 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:52:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:30,868 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2025-03-16 17:52:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 17:52:30,869 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 17:52:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:30,869 INFO L225 Difference]: With dead ends: 130 [2025-03-16 17:52:30,870 INFO L226 Difference]: Without dead ends: 127 [2025-03-16 17:52:30,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2025-03-16 17:52:30,870 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:30,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 28 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:52:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-16 17:52:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-16 17:52:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.0873015873015872) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:52:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2025-03-16 17:52:30,895 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 54 [2025-03-16 17:52:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:30,895 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2025-03-16 17:52:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:52:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2025-03-16 17:52:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 17:52:30,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:52:30,898 INFO L218 NwaCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-16 17:52:30,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:52:31,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:52:31,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:52:31,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:52:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1762114581, now seen corresponding path program 5 times [2025-03-16 17:52:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:52:31,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398867924] [2025-03-16 17:52:31,099 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:52:31,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:52:31,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 126 statements into 61 equivalence classes. [2025-03-16 17:52:31,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 17:52:31,171 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2025-03-16 17:52:31,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:52:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:52:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:52:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398867924] [2025-03-16 17:52:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398867924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:52:36,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:52:36,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2025-03-16 17:52:36,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637311176] [2025-03-16 17:52:36,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:52:36,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2025-03-16 17:52:36,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:52:36,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2025-03-16 17:52:36,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2025-03-16 17:52:36,081 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 104 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 103 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:52:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:52:36,991 INFO L93 Difference]: Finished difference Result 5122 states and 5582 transitions. [2025-03-16 17:52:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-03-16 17:52:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 103 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 17:52:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:52:36,996 INFO L225 Difference]: With dead ends: 5122 [2025-03-16 17:52:36,996 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:52:37,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2025-03-16 17:52:37,012 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 163 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:52:37,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 936 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:52:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:52:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:52:37,014 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 17:52:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:52:37,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2025-03-16 17:52:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:52:37,016 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:52:37,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 103 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:52:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:52:37,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:52:37,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:52:37,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 17:52:37,021 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2025-03-16 17:52:37,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 17:52:42,068 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 672 DAG size of output: 672 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)