./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/string_concat-noarr.i --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/loop-invgen/string_concat-noarr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30a4b942034eaa47a8fcc8fdf4549d1d63a9a60d59b585da2a353c9626604750 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:32:53,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:32:53,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:32:53,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:32:53,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:32:53,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:32:53,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:32:53,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:32:53,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:32:53,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:32:53,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:32:53,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:32:53,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:32:53,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:32:53,401 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:32:53,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:32:53,402 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:32:53,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:32:53,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:32:53,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:32:53,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:32:53,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:32:53,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:32:53,404 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 -> 30a4b942034eaa47a8fcc8fdf4549d1d63a9a60d59b585da2a353c9626604750 [2025-03-03 13:32:53,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:32:53,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:32:53,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:32:53,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:32:53,631 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:32:53,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/string_concat-noarr.i [2025-03-03 13:32:54,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbed3311/b9a59d3673e940c196378b83bccfa803/FLAG59defb983 [2025-03-03 13:32:54,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:32:54,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/string_concat-noarr.i [2025-03-03 13:32:54,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbed3311/b9a59d3673e940c196378b83bccfa803/FLAG59defb983 [2025-03-03 13:32:54,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddbed3311/b9a59d3673e940c196378b83bccfa803 [2025-03-03 13:32:54,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:32:54,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:32:54,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:32:54,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:32:54,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:32:54,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:32:54" (1/1) ... [2025-03-03 13:32:54,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae78ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:54, skipping insertion in model container [2025-03-03 13:32:54,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:32:54" (1/1) ... [2025-03-03 13:32:54,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:32:55,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/string_concat-noarr.i[893,906] [2025-03-03 13:32:55,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:32:55,096 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:32:55,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/string_concat-noarr.i[893,906] [2025-03-03 13:32:55,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:32:55,114 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:32:55,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55 WrapperNode [2025-03-03 13:32:55,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:32:55,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:32:55,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:32:55,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:32:55,120 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:32:55" (1/1) ... [2025-03-03 13:32:55,126 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:32:55" (1/1) ... [2025-03-03 13:32:55,138 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-03-03 13:32:55,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:32:55,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:32:55,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:32:55,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:32:55,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,149 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:32:55,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:32:55,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:32:55,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:32:55,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:32:55,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (1/1) ... [2025-03-03 13:32:55,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:32:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:55,173 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:32:55,175 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:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:32:55,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:32:55,228 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:32:55,230 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:32:55,320 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 13:32:55,320 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:32:55,326 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:32:55,326 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:32:55,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:32:55 BoogieIcfgContainer [2025-03-03 13:32:55,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:32:55,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:32:55,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:32:55,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:32:55,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:32:54" (1/3) ... [2025-03-03 13:32:55,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5800d14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:32:55, skipping insertion in model container [2025-03-03 13:32:55,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:32:55" (2/3) ... [2025-03-03 13:32:55,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5800d14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:32:55, skipping insertion in model container [2025-03-03 13:32:55,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:32:55" (3/3) ... [2025-03-03 13:32:55,333 INFO L128 eAbstractionObserver]: Analyzing ICFG string_concat-noarr.i [2025-03-03 13:32:55,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:32:55,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG string_concat-noarr.i that has 1 procedures, 19 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:32:55,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:32:55,389 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;@2b683134, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:32:55,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:32:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 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:32:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 13:32:55,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:55,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:55,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:32:55,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash -983653709, now seen corresponding path program 1 times [2025-03-03 13:32:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827436580] [2025-03-03 13:32:55,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:55,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:55,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:32:55,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:32:55,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:55,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:55,500 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:32:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:55,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827436580] [2025-03-03 13:32:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827436580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:32:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325754157] [2025-03-03 13:32:55,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:55,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:32:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:55,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:32:55,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:32:55,523 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:55,532 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-03 13:32:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:32:55,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 13:32:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:55,537 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:32:55,538 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 13:32:55,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:32:55,542 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:55,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 13:32:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 13:32:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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:32:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-03 13:32:55,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2025-03-03 13:32:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:55,566 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-03 13:32:55,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-03-03 13:32:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:32:55,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:55,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:32:55,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:32:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1776385451, now seen corresponding path program 1 times [2025-03-03 13:32:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635801524] [2025-03-03 13:32:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:55,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:55,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:32:55,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:32:55,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:55,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:55,764 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:32:55,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635801524] [2025-03-03 13:32:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635801524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:32:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:32:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:32:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888534679] [2025-03-03 13:32:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:32:55,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:32:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:55,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:32:55,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:55,768 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:55,806 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-03-03 13:32:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:32:55,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 13:32:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:55,808 INFO L225 Difference]: With dead ends: 23 [2025-03-03 13:32:55,808 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 13:32:55,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:32:55,808 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:55,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:32:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 13:32:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2025-03-03 13:32:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-03-03 13:32:55,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2025-03-03 13:32:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:55,813 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-03-03 13:32:55,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-03-03 13:32:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:32:55,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:55,814 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:55,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:32:55,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:32:55,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1970880106, now seen corresponding path program 1 times [2025-03-03 13:32:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:55,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403679740] [2025-03-03 13:32:55,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:55,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:32:55,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:32:55,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:55,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:55,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:55,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403679740] [2025-03-03 13:32:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403679740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:32:55,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121097143] [2025-03-03 13:32:55,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:32:55,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:32:55,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:55,951 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:32:55,953 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:32:55,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:32:55,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:32:55,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:32:55,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:55,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:32:56,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:32:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:56,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:32:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121097143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:32:56,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:32:56,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 13:32:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497605227] [2025-03-03 13:32:56,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:32:56,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:32:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:56,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:32:56,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:32:56,124 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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:32:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:56,200 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-03-03 13:32:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:32:56,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:32:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:56,201 INFO L225 Difference]: With dead ends: 46 [2025-03-03 13:32:56,201 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 13:32:56,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:32:56,201 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:56,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:32:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 13:32:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2025-03-03 13:32:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 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:32:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-03-03 13:32:56,204 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2025-03-03 13:32:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:56,205 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-03-03 13:32:56,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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:32:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-03-03 13:32:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:32:56,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:56,205 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:56,211 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:32:56,405 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:32:56,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:32:56,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash 521336281, now seen corresponding path program 2 times [2025-03-03 13:32:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:56,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558259460] [2025-03-03 13:32:56,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:32:56,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:56,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:32:56,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:32:56,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:32:56,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:56,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:56,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558259460] [2025-03-03 13:32:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558259460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:32:56,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433619493] [2025-03-03 13:32:56,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:32:56,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:32:56,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:56,553 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:32:56,556 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:32:56,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-03 13:32:56,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:32:56,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:32:56,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:56,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 13:32:56,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:32:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:56,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:32:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433619493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:32:56,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:32:56,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-03 13:32:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923352103] [2025-03-03 13:32:56,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:32:56,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:32:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:56,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:32:56,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:32:56,743 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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:32:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:56,831 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2025-03-03 13:32:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:32:56,831 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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) Word has length 21 [2025-03-03 13:32:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:56,833 INFO L225 Difference]: With dead ends: 90 [2025-03-03 13:32:56,833 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 13:32:56,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:32:56,833 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:56,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 48 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:32:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 13:32:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2025-03-03 13:32:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:32:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-03-03 13:32:56,841 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 21 [2025-03-03 13:32:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:56,841 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-03-03 13:32:56,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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:32:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-03-03 13:32:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:32:56,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:56,842 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:56,848 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:32:57,047 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:32:57,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:32:57,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash -485321825, now seen corresponding path program 3 times [2025-03-03 13:32:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904424785] [2025-03-03 13:32:57,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:32:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:57,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 11 equivalence classes. [2025-03-03 13:32:57,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:32:57,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 13:32:57,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:57,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:57,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904424785] [2025-03-03 13:32:57,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904424785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:32:57,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806863455] [2025-03-03 13:32:57,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:32:57,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:32:57,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:57,274 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:32:57,276 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:32:57,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 11 equivalence classes. [2025-03-03 13:32:57,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:32:57,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 13:32:57,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:57,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 13:32:57,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:32:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:57,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:32:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806863455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:32:57,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:32:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-03-03 13:32:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970817980] [2025-03-03 13:32:57,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:32:57,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 13:32:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:57,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 13:32:57,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2025-03-03 13:32:57,614 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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:32:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:57,807 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2025-03-03 13:32:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:32:57,808 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 13:32:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:57,809 INFO L225 Difference]: With dead ends: 210 [2025-03-03 13:32:57,809 INFO L226 Difference]: Without dead ends: 195 [2025-03-03 13:32:57,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2025-03-03 13:32:57,810 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 177 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:57,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 89 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:32:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-03 13:32:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 102. [2025-03-03 13:32:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 101 states have internal predecessors, (114), 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:32:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2025-03-03 13:32:57,826 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 33 [2025-03-03 13:32:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:57,827 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2025-03-03 13:32:57,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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:32:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2025-03-03 13:32:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 13:32:57,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:57,828 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:57,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:32:58,028 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:32:58,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:32:58,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash -931535829, now seen corresponding path program 4 times [2025-03-03 13:32:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:58,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620961880] [2025-03-03 13:32:58,030 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:32:58,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:58,036 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-03 13:32:58,055 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 13:32:58,055 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:32:58,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:32:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620961880] [2025-03-03 13:32:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620961880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:32:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736012447] [2025-03-03 13:32:58,566 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:32:58,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:32:58,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:32:58,568 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:32:58,569 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:32:58,599 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-03 13:32:58,621 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 13:32:58,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:32:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:32:58,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 13:32:58,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:32:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:58,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:32:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:32:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736012447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:32:59,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:32:59,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 49 [2025-03-03 13:32:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276463716] [2025-03-03 13:32:59,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:32:59,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 13:32:59,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:32:59,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 13:32:59,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 13:32:59,370 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 49 states have internal predecessors, (110), 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:32:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:32:59,748 INFO L93 Difference]: Finished difference Result 558 states and 628 transitions. [2025-03-03 13:32:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 13:32:59,749 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 49 states have internal predecessors, (110), 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 57 [2025-03-03 13:32:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:32:59,751 INFO L225 Difference]: With dead ends: 558 [2025-03-03 13:32:59,751 INFO L226 Difference]: Without dead ends: 531 [2025-03-03 13:32:59,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 13:32:59,755 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 408 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:32:59,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 144 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:32:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-03 13:32:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 198. [2025-03-03 13:32:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.1269035532994924) internal successors, (222), 197 states have internal predecessors, (222), 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:32:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2025-03-03 13:32:59,774 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 57 [2025-03-03 13:32:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:32:59,774 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2025-03-03 13:32:59,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 49 states have internal predecessors, (110), 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:32:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2025-03-03 13:32:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 13:32:59,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:32:59,778 INFO L218 NwaCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:32:59,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:32:59,979 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:32:59,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:32:59,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:32:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1507665597, now seen corresponding path program 5 times [2025-03-03 13:32:59,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:32:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195220545] [2025-03-03 13:32:59,979 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:32:59,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:32:59,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 105 statements into 47 equivalence classes. [2025-03-03 13:33:00,035 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 13:33:00,036 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-03 13:33:00,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195220545] [2025-03-03 13:33:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195220545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:33:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890247450] [2025-03-03 13:33:01,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:33:01,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:01,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:01,424 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:33:01,426 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:33:01,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 105 statements into 47 equivalence classes. [2025-03-03 13:33:01,515 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 13:33:01,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-03 13:33:01,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:01,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 13:33:01,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:33:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:01,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:33:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890247450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:33:03,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:33:03,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 98 [2025-03-03 13:33:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457842063] [2025-03-03 13:33:03,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:33:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-03-03 13:33:03,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:03,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-03-03 13:33:03,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2025-03-03 13:33:03,648 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 98 states, 98 states have (on average 2.122448979591837) internal successors, (208), 98 states have internal predecessors, (208), 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:33:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:05,270 INFO L93 Difference]: Finished difference Result 1686 states and 1828 transitions. [2025-03-03 13:33:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-03 13:33:05,270 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.122448979591837) internal successors, (208), 98 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 13:33:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:05,275 INFO L225 Difference]: With dead ends: 1686 [2025-03-03 13:33:05,275 INFO L226 Difference]: Without dead ends: 1635 [2025-03-03 13:33:05,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2025-03-03 13:33:05,278 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1131 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:05,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 273 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:33:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2025-03-03 13:33:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 390. [2025-03-03 13:33:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.1259640102827764) internal successors, (438), 389 states have internal predecessors, (438), 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:33:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 438 transitions. [2025-03-03 13:33:05,311 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 438 transitions. Word has length 105 [2025-03-03 13:33:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:05,312 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 438 transitions. [2025-03-03 13:33:05,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.122448979591837) internal successors, (208), 98 states have internal predecessors, (208), 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:33:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 438 transitions. [2025-03-03 13:33:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 13:33:05,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:05,314 INFO L218 NwaCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:05,320 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:33:05,518 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:33:05,518 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:05,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash 78517107, now seen corresponding path program 6 times [2025-03-03 13:33:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:05,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772750956] [2025-03-03 13:33:05,519 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:33:05,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:05,529 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 201 statements into 95 equivalence classes. [2025-03-03 13:33:05,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 13:33:05,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-03 13:33:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:09,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:09,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772750956] [2025-03-03 13:33:09,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772750956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:33:09,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925603465] [2025-03-03 13:33:09,372 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:33:09,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:09,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:09,374 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:33:09,375 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:33:09,421 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 201 statements into 95 equivalence classes. [2025-03-03 13:33:09,555 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 13:33:09,555 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-03 13:33:09,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:09,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-03 13:33:09,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:33:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:09,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:33:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925603465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:33:16,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:33:16,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2025-03-03 13:33:16,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100515258] [2025-03-03 13:33:16,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:33:16,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 195 states [2025-03-03 13:33:16,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:16,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2025-03-03 13:33:16,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18533, Invalid=19297, Unknown=0, NotChecked=0, Total=37830 [2025-03-03 13:33:16,694 INFO L87 Difference]: Start difference. First operand 390 states and 438 transitions. Second operand has 195 states, 195 states have (on average 2.0923076923076924) internal successors, (408), 195 states have internal predecessors, (408), 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:33:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:35,375 INFO L93 Difference]: Finished difference Result 5670 states and 5956 transitions. [2025-03-03 13:33:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2025-03-03 13:33:35,376 INFO L78 Accepts]: Start accepts. Automaton has has 195 states, 195 states have (on average 2.0923076923076924) internal successors, (408), 195 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-03-03 13:33:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:35,389 INFO L225 Difference]: With dead ends: 5670 [2025-03-03 13:33:35,389 INFO L226 Difference]: Without dead ends: 5571 [2025-03-03 13:33:35,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=18533, Invalid=19297, Unknown=0, NotChecked=0, Total=37830 [2025-03-03 13:33:35,393 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2587 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 1398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2587 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1398 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:35,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2587 Valid, 504 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1398 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 13:33:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2025-03-03 13:33:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 774. [2025-03-03 13:33:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.1254851228978007) internal successors, (870), 773 states have internal predecessors, (870), 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:33:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 870 transitions. [2025-03-03 13:33:35,530 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 870 transitions. Word has length 201 [2025-03-03 13:33:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:35,531 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 870 transitions. [2025-03-03 13:33:35,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 195 states, 195 states have (on average 2.0923076923076924) internal successors, (408), 195 states have internal predecessors, (408), 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:33:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 870 transitions. [2025-03-03 13:33:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-03 13:33:35,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:35,535 INFO L218 NwaCegarLoop]: trace histogram [191, 190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:35,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:33:35,738 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:33:35,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:35,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash -316028973, now seen corresponding path program 7 times [2025-03-03 13:33:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:35,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596382142] [2025-03-03 13:33:35,740 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:33:35,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:35,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-03 13:33:35,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-03 13:33:35,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:35,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:49,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596382142] [2025-03-03 13:33:49,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596382142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:33:49,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438727392] [2025-03-03 13:33:49,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:33:49,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:49,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:49,800 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:33:49,802 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:33:49,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-03 13:33:49,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-03 13:33:49,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:49,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:49,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-03 13:33:50,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:34:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 36290 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:34:09,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:34:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438727392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:34:09,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:34:09,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [193] imperfect sequences [194] total 385 [2025-03-03 13:34:09,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607653191] [2025-03-03 13:34:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:34:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-03-03 13:34:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:34:09,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-03-03 13:34:09,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37057, Invalid=110783, Unknown=0, NotChecked=0, Total=147840 [2025-03-03 13:34:09,460 INFO L87 Difference]: Start difference. First operand 774 states and 870 transitions. Second operand has 193 states, 193 states have (on average 2.0362694300518136) internal successors, (393), 193 states have internal predecessors, (393), 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:34:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:34:19,686 INFO L93 Difference]: Finished difference Result 28042 states and 28232 transitions. [2025-03-03 13:34:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2025-03-03 13:34:19,686 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 2.0362694300518136) internal successors, (393), 193 states have internal predecessors, (393), 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 393 [2025-03-03 13:34:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:34:19,696 INFO L225 Difference]: With dead ends: 28042 [2025-03-03 13:34:19,696 INFO L226 Difference]: Without dead ends: 1194 [2025-03-03 13:34:19,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36480 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=37057, Invalid=110783, Unknown=0, NotChecked=0, Total=147840 [2025-03-03 13:34:19,722 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 616 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:34:19,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1215 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:34:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-03-03 13:34:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1190. [2025-03-03 13:34:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.007569386038688) internal successors, (1198), 1189 states have internal predecessors, (1198), 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:34:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1198 transitions. [2025-03-03 13:34:19,841 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1198 transitions. Word has length 393 [2025-03-03 13:34:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:34:19,841 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1198 transitions. [2025-03-03 13:34:19,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 2.0362694300518136) internal successors, (393), 193 states have internal predecessors, (393), 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:34:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1198 transitions. [2025-03-03 13:34:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-03 13:34:19,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:34:19,845 INFO L218 NwaCegarLoop]: trace histogram [100, 99, 92, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:34:19,853 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:34:20,045 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:34:20,046 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:34:20,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:34:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1350653203, now seen corresponding path program 1 times [2025-03-03 13:34:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:34:20,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965927990] [2025-03-03 13:34:20,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:34:20,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:34:20,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-03 13:34:20,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-03 13:34:20,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:34:20,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat