./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4548c451706b7658e6a882e8eef66dc3c360e6aea0e4326d7cc0b87e2b58239c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:37:44,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:37:44,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:37:44,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:37:44,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:37:44,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:37:44,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:37:44,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:37:44,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:37:44,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:37:44,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:37:44,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:37:44,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:37:44,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:37:44,621 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:37:44,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:37:44,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:37:44,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:37:44,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:37:44,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:37:44,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:37:44,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:37:44,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:37:44,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:37:44,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:37:44,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:37:44,624 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:37:44,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:37:44,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:37:44,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:37:44,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:37:44,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:37:44,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:37:44,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:37:44,624 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 -> 4548c451706b7658e6a882e8eef66dc3c360e6aea0e4326d7cc0b87e2b58239c [2025-03-03 13:37:44,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:37:44,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:37:44,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:37:44,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:37:44,874 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:37:44,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_3.c [2025-03-03 13:37:46,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b265a558c/2737350d805c4858b5a529229024c14d/FLAG4cf750c16 [2025-03-03 13:37:46,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:37:46,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_3.c [2025-03-03 13:37:46,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b265a558c/2737350d805c4858b5a529229024c14d/FLAG4cf750c16 [2025-03-03 13:37:46,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b265a558c/2737350d805c4858b5a529229024c14d [2025-03-03 13:37:46,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:37:46,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:37:46,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:37:46,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:37:46,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:37:46,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6209fa57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46, skipping insertion in model container [2025-03-03 13:37:46,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:37:46,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_3.c[318,331] [2025-03-03 13:37:46,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:37:46,744 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:37:46,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_3.c[318,331] [2025-03-03 13:37:46,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:37:46,764 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:37:46,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46 WrapperNode [2025-03-03 13:37:46,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:37:46,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:37:46,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:37:46,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:37:46,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,785 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-03 13:37:46,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:37:46,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:37:46,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:37:46,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:37:46,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,800 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:37:46,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:37:46,804 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:37:46,804 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:37:46,804 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:37:46,805 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (1/1) ... [2025-03-03 13:37:46,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:37:46,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:46,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:37:46,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:37:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:37:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:37:46,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:37:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:37:46,883 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:37:46,884 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:37:46,963 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 13:37:46,964 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:37:46,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:37:46,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:37:46,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:37:46 BoogieIcfgContainer [2025-03-03 13:37:46,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:37:46,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:37:46,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:37:46,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:37:46,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:37:46" (1/3) ... [2025-03-03 13:37:46,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdd903f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:37:46, skipping insertion in model container [2025-03-03 13:37:46,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:46" (2/3) ... [2025-03-03 13:37:46,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdd903f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:37:46, skipping insertion in model container [2025-03-03 13:37:46,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:37:46" (3/3) ... [2025-03-03 13:37:46,980 INFO L128 eAbstractionObserver]: Analyzing ICFG mono-crafted_3.c [2025-03-03 13:37:46,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:37:46,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mono-crafted_3.c that has 1 procedures, 12 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:37:47,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:37:47,035 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;@40c1aba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:37:47,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:37:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 13:37:47,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:47,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 13:37:47,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:47,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1300681946, now seen corresponding path program 1 times [2025-03-03 13:37:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:47,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148305413] [2025-03-03 13:37:47,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:47,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 13:37:47,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 13:37:47,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:47,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:47,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:47,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148305413] [2025-03-03 13:37:47,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148305413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:37:47,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:37:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:37:47,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086120060] [2025-03-03 13:37:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:37:47,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:37:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:47,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:37:47,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:37:47,205 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-03 13:37:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:47,234 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2025-03-03 13:37:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:37:47,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-03 13:37:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:47,241 INFO L225 Difference]: With dead ends: 24 [2025-03-03 13:37:47,241 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 13:37:47,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:37:47,247 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:47,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 13:37:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-03 13:37:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) 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-03 13:37:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-03-03 13:37:47,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2025-03-03 13:37:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:47,271 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-03 13:37:47,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-03 13:37:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2025-03-03 13:37:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:37:47,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:47,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:47,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:37:47,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:47,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash 93296440, now seen corresponding path program 1 times [2025-03-03 13:37:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:47,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124706360] [2025-03-03 13:37:47,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:47,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:37:47,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:37:47,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:37:47,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124706360] [2025-03-03 13:37:47,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124706360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:37:47,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:37:47,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:37:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616711206] [2025-03-03 13:37:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:37:47,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:37:47,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:47,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:37:47,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:37:47,317 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-03 13:37:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:47,329 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-03-03 13:37:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:37:47,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-03 13:37:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:47,330 INFO L225 Difference]: With dead ends: 14 [2025-03-03 13:37:47,330 INFO L226 Difference]: Without dead ends: 11 [2025-03-03 13:37:47,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:37:47,330 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:47,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-03 13:37:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-03 13:37:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-03 13:37:47,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2025-03-03 13:37:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:47,333 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-03 13:37:47,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-03 13:37:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-03-03 13:37:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:37:47,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:47,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:37:47,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1402745908, now seen corresponding path program 1 times [2025-03-03 13:37:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782732050] [2025-03-03 13:37:47,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:47,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:37:47,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:37:47,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:47,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:37:47,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:47,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782732050] [2025-03-03 13:37:47,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782732050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:47,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717847805] [2025-03-03 13:37:47,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:47,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:47,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:47,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:37:47,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:37:47,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:37:47,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:37:47,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:47,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:47,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:37:47,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:37:47,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:37:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717847805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:47,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 13:37:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628290979] [2025-03-03 13:37:47,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:47,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:37:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:47,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:37:47,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:37:47,525 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:47,597 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-03-03 13:37:47,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:37:47,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-03 13:37:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:47,598 INFO L225 Difference]: With dead ends: 24 [2025-03-03 13:37:47,598 INFO L226 Difference]: Without dead ends: 17 [2025-03-03 13:37:47,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:37:47,599 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:47,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-03 13:37:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-03 13:37:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-03-03 13:37:47,607 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2025-03-03 13:37:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:47,607 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-03-03 13:37:47,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-03-03 13:37:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:37:47,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:47,608 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:47,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:37:47,808 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-03 13:37:47,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:47,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash -989479020, now seen corresponding path program 1 times [2025-03-03 13:37:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389193521] [2025-03-03 13:37:47,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:47,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:37:47,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:37:47,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:47,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:47,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:47,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389193521] [2025-03-03 13:37:47,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389193521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929474828] [2025-03-03 13:37:47,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:47,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:47,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:47,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:37:47,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:37:47,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:37:47,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:37:47,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:47,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:47,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:37:47,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:47,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:48,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929474828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:48,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:48,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 13:37:48,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458699528] [2025-03-03 13:37:48,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:48,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:37:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:48,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:37:48,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:37:48,021 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:48,056 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2025-03-03 13:37:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:37:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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 16 [2025-03-03 13:37:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:48,057 INFO L225 Difference]: With dead ends: 36 [2025-03-03 13:37:48,057 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 13:37:48,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:37:48,058 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:48,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 13:37:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 13:37:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-03 13:37:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-03 13:37:48,061 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2025-03-03 13:37:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:48,061 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-03 13:37:48,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-03 13:37:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:37:48,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:48,063 INFO L218 NwaCegarLoop]: trace histogram [8, 6, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:48,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:37:48,263 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-03 13:37:48,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:48,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash 693261836, now seen corresponding path program 2 times [2025-03-03 13:37:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:48,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158257882] [2025-03-03 13:37:48,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:37:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:48,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:37:48,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:37:48,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:48,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158257882] [2025-03-03 13:37:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158257882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239356121] [2025-03-03 13:37:48,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:37:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:48,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:48,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:37:48,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:37:48,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:37:48,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:37:48,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:48,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:48,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:37:48,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:48,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:48,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239356121] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:48,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:48,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-03 13:37:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33386614] [2025-03-03 13:37:48,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:48,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:37:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:48,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:37:48,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:37:48,670 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:48,730 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2025-03-03 13:37:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:37:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 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 24 [2025-03-03 13:37:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:48,732 INFO L225 Difference]: With dead ends: 52 [2025-03-03 13:37:48,732 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 13:37:48,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:37:48,733 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:48,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:37:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 13:37:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-03 13:37:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-03-03 13:37:48,743 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2025-03-03 13:37:48,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:48,743 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-03-03 13:37:48,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-03-03 13:37:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:37:48,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:48,744 INFO L218 NwaCegarLoop]: trace histogram [16, 14, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:48,750 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-03 13:37:48,945 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-03 13:37:48,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:48,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1094870276, now seen corresponding path program 3 times [2025-03-03 13:37:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378896659] [2025-03-03 13:37:48,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:37:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:48,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 17 equivalence classes. [2025-03-03 13:37:48,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 14 of 40 statements. [2025-03-03 13:37:48,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:37:48,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:37:49,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378896659] [2025-03-03 13:37:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378896659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900804170] [2025-03-03 13:37:49,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:37:49,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:49,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:49,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:37:49,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:37:49,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 17 equivalence classes. [2025-03-03 13:37:49,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 14 of 40 statements. [2025-03-03 13:37:49,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:37:49,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:49,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:37:49,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:37:49,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:37:49,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900804170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:49,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:49,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 13:37:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353819641] [2025-03-03 13:37:49,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:37:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:49,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:37:49,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:37:49,188 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:49,209 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-03-03 13:37:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:37:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 40 [2025-03-03 13:37:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:49,211 INFO L225 Difference]: With dead ends: 54 [2025-03-03 13:37:49,211 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 13:37:49,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:37:49,211 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 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-03 13:37:49,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 13:37:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-03-03 13:37:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-03-03 13:37:49,216 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 40 [2025-03-03 13:37:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:49,216 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-03-03 13:37:49,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-03-03 13:37:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 13:37:49,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:49,217 INFO L218 NwaCegarLoop]: trace histogram [16, 14, 6, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:49,223 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-03 13:37:49,418 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-03 13:37:49,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:49,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash -629105156, now seen corresponding path program 4 times [2025-03-03 13:37:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:49,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123225871] [2025-03-03 13:37:49,418 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:37:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:49,426 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-03 13:37:49,439 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:37:49,439 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:37:49,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 46 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:37:49,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:49,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123225871] [2025-03-03 13:37:49,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123225871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:49,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382215575] [2025-03-03 13:37:49,540 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:37:49,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:49,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:49,543 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-03 13:37:49,544 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-03 13:37:49,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-03 13:37:49,597 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 13:37:49,598 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:37:49,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:49,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 13:37:49,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:37:49,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:37:50,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382215575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:50,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:50,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 17] total 40 [2025-03-03 13:37:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200075722] [2025-03-03 13:37:50,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:50,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 13:37:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:50,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 13:37:50,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1020, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 13:37:50,213 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:50,779 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2025-03-03 13:37:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 13:37:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 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 44 [2025-03-03 13:37:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:50,781 INFO L225 Difference]: With dead ends: 99 [2025-03-03 13:37:50,781 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 13:37:50,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1680, Invalid=3150, Unknown=0, NotChecked=0, Total=4830 [2025-03-03 13:37:50,785 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:50,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:37:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 13:37:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2025-03-03 13:37:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-03-03 13:37:50,793 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 44 [2025-03-03 13:37:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:50,793 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-03-03 13:37:50,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-03-03 13:37:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 13:37:50,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:50,794 INFO L218 NwaCegarLoop]: trace histogram [32, 30, 7, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:50,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:37:50,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:50,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:50,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash -730079320, now seen corresponding path program 5 times [2025-03-03 13:37:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650108840] [2025-03-03 13:37:50,998 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:37:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:51,007 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 33 equivalence classes. [2025-03-03 13:37:51,055 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 13:37:51,057 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2025-03-03 13:37:51,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 13:37:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650108840] [2025-03-03 13:37:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650108840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175320675] [2025-03-03 13:37:51,939 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:37:51,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:51,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:51,941 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-03 13:37:51,943 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-03 13:37:51,980 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 33 equivalence classes. [2025-03-03 13:37:52,010 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 13:37:52,010 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2025-03-03 13:37:52,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:52,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-03 13:37:52,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 13:37:52,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 13:37:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175320675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:53,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:53,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2025-03-03 13:37:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657594574] [2025-03-03 13:37:53,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-03 13:37:53,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:53,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-03 13:37:53,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 13:37:53,206 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 64 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:53,386 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2025-03-03 13:37:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-03 13:37:53,387 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 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 77 [2025-03-03 13:37:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:53,388 INFO L225 Difference]: With dead ends: 158 [2025-03-03 13:37:53,388 INFO L226 Difference]: Without dead ends: 142 [2025-03-03 13:37:53,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 13:37:53,389 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:53,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:37:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-03 13:37:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-03 13:37:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.0283687943262412) internal successors, (145), 141 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2025-03-03 13:37:53,398 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 77 [2025-03-03 13:37:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:53,398 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2025-03-03 13:37:53,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2025-03-03 13:37:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 13:37:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:53,404 INFO L218 NwaCegarLoop]: trace histogram [64, 62, 7, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:53,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:37:53,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:53,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:53,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash 547021800, now seen corresponding path program 6 times [2025-03-03 13:37:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326477186] [2025-03-03 13:37:53,605 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:37:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:53,617 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 141 statements into 65 equivalence classes. [2025-03-03 13:37:53,628 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 29 of 141 statements. [2025-03-03 13:37:53,628 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-03 13:37:53,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4124 backedges. 190 proven. 28 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-03 13:37:53,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:53,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326477186] [2025-03-03 13:37:53,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326477186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:53,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522388357] [2025-03-03 13:37:53,697 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:37:53,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:53,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:53,699 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-03 13:37:53,700 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-03 13:37:53,738 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 141 statements into 65 equivalence classes. [2025-03-03 13:37:53,751 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 29 of 141 statements. [2025-03-03 13:37:53,751 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-03 13:37:53,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:53,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:37:53,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4124 backedges. 190 proven. 28 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-03 13:37:53,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4124 backedges. 190 proven. 28 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-03 13:37:54,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522388357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:54,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:54,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-03-03 13:37:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513974362] [2025-03-03 13:37:54,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:54,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:37:54,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:54,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:37:54,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:37:54,073 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:54,098 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2025-03-03 13:37:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:37:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 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 141 [2025-03-03 13:37:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:54,100 INFO L225 Difference]: With dead ends: 160 [2025-03-03 13:37:54,102 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 13:37:54,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:37:54,103 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:54,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:54,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 13:37:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2025-03-03 13:37:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2025-03-03 13:37:54,114 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 141 [2025-03-03 13:37:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:54,118 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2025-03-03 13:37:54,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2025-03-03 13:37:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 13:37:54,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:54,121 INFO L218 NwaCegarLoop]: trace histogram [64, 62, 16, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:54,126 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-03 13:37:54,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:54,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:54,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1669170404, now seen corresponding path program 7 times [2025-03-03 13:37:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632338733] [2025-03-03 13:37:54,322 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:37:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:54,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 13:37:54,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 13:37:54,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:54,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 13:37:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:56,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632338733] [2025-03-03 13:37:56,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632338733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:56,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814166749] [2025-03-03 13:37:56,745 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:37:56,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:56,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:56,747 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:37:56,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:37:56,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 13:37:56,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 13:37:56,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:56,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:56,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-03 13:37:56,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 13:37:57,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:38:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 13:38:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814166749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:38:00,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:38:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2025-03-03 13:38:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018480161] [2025-03-03 13:38:00,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:38:00,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2025-03-03 13:38:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:38:00,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2025-03-03 13:38:00,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2025-03-03 13:38:00,170 INFO L87 Difference]: Start difference. First operand 151 states and 154 transitions. Second operand has 129 states, 129 states have (on average 2.054263565891473) internal successors, (265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:38:00,424 INFO L93 Difference]: Finished difference Result 304 states and 374 transitions. [2025-03-03 13:38:00,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-03 13:38:00,425 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 129 states have (on average 2.054263565891473) internal successors, (265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 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 150 [2025-03-03 13:38:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:38:00,426 INFO L225 Difference]: With dead ends: 304 [2025-03-03 13:38:00,426 INFO L226 Difference]: Without dead ends: 279 [2025-03-03 13:38:00,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2025-03-03 13:38:00,429 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:38:00,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:38:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-03 13:38:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-03 13:38:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.014388489208633) internal successors, (282), 278 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2025-03-03 13:38:00,442 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 150 [2025-03-03 13:38:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:38:00,442 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2025-03-03 13:38:00,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 2.054263565891473) internal successors, (265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2025-03-03 13:38:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 13:38:00,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:38:00,444 INFO L218 NwaCegarLoop]: trace histogram [128, 126, 16, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:38:00,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 13:38:00,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 13:38:00,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:38:00,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:38:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1437859172, now seen corresponding path program 8 times [2025-03-03 13:38:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:38:00,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922237344] [2025-03-03 13:38:00,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:38:00,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:38:00,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-03 13:38:00,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 13:38:00,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:38:00,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16520 backedges. 381 proven. 16002 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 13:38:08,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:38:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922237344] [2025-03-03 13:38:08,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922237344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:38:08,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721633176] [2025-03-03 13:38:08,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:38:08,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:08,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:38:08,715 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:38:08,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:38:08,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-03 13:38:08,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 13:38:08,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:38:08,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:08,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 254 conjuncts are in the unsatisfiable core [2025-03-03 13:38:08,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:38:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16520 backedges. 381 proven. 16002 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 13:38:09,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:38:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16520 backedges. 381 proven. 16002 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-03 13:38:21,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721633176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:38:21,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:38:21,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 257 [2025-03-03 13:38:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197471842] [2025-03-03 13:38:21,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:38:21,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 257 states [2025-03-03 13:38:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:38:21,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 257 interpolants. [2025-03-03 13:38:21,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32896, Invalid=32896, Unknown=0, NotChecked=0, Total=65792 [2025-03-03 13:38:21,202 INFO L87 Difference]: Start difference. First operand 279 states and 282 transitions. Second operand has 257 states, 257 states have (on average 2.027237354085603) internal successors, (521), 257 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:38:21,974 INFO L93 Difference]: Finished difference Result 560 states and 694 transitions. [2025-03-03 13:38:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2025-03-03 13:38:21,975 INFO L78 Accepts]: Start accepts. Automaton has has 257 states, 257 states have (on average 2.027237354085603) internal successors, (521), 257 states have internal predecessors, (521), 0 states have call successors, (0), 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 278 [2025-03-03 13:38:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:38:21,977 INFO L225 Difference]: With dead ends: 560 [2025-03-03 13:38:21,977 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 13:38:21,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=32896, Invalid=32896, Unknown=0, NotChecked=0, Total=65792 [2025-03-03 13:38:21,980 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:38:21,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:38:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 13:38:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-03 13:38:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.0074906367041199) internal successors, (538), 534 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 538 transitions. [2025-03-03 13:38:22,004 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 538 transitions. Word has length 278 [2025-03-03 13:38:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:38:22,005 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 538 transitions. [2025-03-03 13:38:22,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 257 states, 257 states have (on average 2.027237354085603) internal successors, (521), 257 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 538 transitions. [2025-03-03 13:38:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-03 13:38:22,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:38:22,009 INFO L218 NwaCegarLoop]: trace histogram [256, 254, 16, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:38:22,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 13:38:22,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:22,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:38:22,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:38:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1173819804, now seen corresponding path program 9 times [2025-03-03 13:38:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:38:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229433552] [2025-03-03 13:38:22,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:38:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:38:22,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 534 statements into 257 equivalence classes. [2025-03-03 13:38:22,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 26 of 534 statements. [2025-03-03 13:38:22,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:38:22,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 65672 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64398 trivial. 0 not checked. [2025-03-03 13:38:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:38:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229433552] [2025-03-03 13:38:22,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229433552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:38:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594018982] [2025-03-03 13:38:22,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:38:22,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:22,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:38:22,275 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:38:22,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 13:38:22,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 534 statements into 257 equivalence classes. [2025-03-03 13:38:22,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 26 of 534 statements. [2025-03-03 13:38:22,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:38:22,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:22,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:38:22,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:38:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 65672 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64398 trivial. 0 not checked. [2025-03-03 13:38:22,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:38:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 65672 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64398 trivial. 0 not checked. [2025-03-03 13:38:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594018982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:38:22,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:38:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 13:38:22,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806856929] [2025-03-03 13:38:22,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:38:22,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:38:22,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:38:22,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:38:22,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:38:22,475 INFO L87 Difference]: Start difference. First operand 535 states and 538 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:38:22,508 INFO L93 Difference]: Finished difference Result 563 states and 574 transitions. [2025-03-03 13:38:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:38:22,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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 534 [2025-03-03 13:38:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:38:22,512 INFO L225 Difference]: With dead ends: 563 [2025-03-03 13:38:22,512 INFO L226 Difference]: Without dead ends: 543 [2025-03-03 13:38:22,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1071 GetRequests, 1065 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:38:22,513 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:38:22,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:38:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-03 13:38:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-03-03 13:38:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.014760147601476) internal successors, (550), 542 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 550 transitions. [2025-03-03 13:38:22,538 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 550 transitions. Word has length 534 [2025-03-03 13:38:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:38:22,539 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 550 transitions. [2025-03-03 13:38:22,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 550 transitions. [2025-03-03 13:38:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-03 13:38:22,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:38:22,545 INFO L218 NwaCegarLoop]: trace histogram [260, 254, 16, 6, 1, 1, 1, 1, 1, 1] [2025-03-03 13:38:22,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:38:22,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 13:38:22,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:38:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:38:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1587738776, now seen corresponding path program 10 times [2025-03-03 13:38:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:38:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704503173] [2025-03-03 13:38:22,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:38:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:38:22,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 542 statements into 2 equivalence classes. [2025-03-03 13:38:22,797 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 542 of 542 statements. [2025-03-03 13:38:22,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:38:22,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 67736 backedges. 2830 proven. 136 refuted. 0 times theorem prover too weak. 64770 trivial. 0 not checked. [2025-03-03 13:38:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:38:23,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704503173] [2025-03-03 13:38:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704503173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:38:23,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509217900] [2025-03-03 13:38:23,408 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:38:23,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:38:23,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:38:23,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 13:38:23,536 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 542 statements into 2 equivalence classes. [2025-03-03 13:38:23,697 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 542 of 542 statements. [2025-03-03 13:38:23,697 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:38:23,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:23,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1708 conjuncts, 510 conjuncts are in the unsatisfiable core [2025-03-03 13:38:23,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:38:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 67736 backedges. 2805 proven. 64770 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 13:38:41,215 INFO L312 TraceCheckSpWp]: Computing backward predicates...