./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/diamond_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/diamond_1-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 278330930f6296a6ef523f9a21bb3281878247b5e50b78eb9077d2b7690716c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:29:58,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:29:58,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:29:58,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:29:58,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:29:58,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:29:58,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:29:58,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:29:58,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:29:58,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:29:58,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:29:58,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:29:58,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:29:58,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:29:58,538 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:29:58,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:29:58,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:29:58,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:29:58,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:29:58,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:29:58,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:29:58,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:29:58,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:29:58,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:29:58,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:29:58,541 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 -> 278330930f6296a6ef523f9a21bb3281878247b5e50b78eb9077d2b7690716c4 [2025-03-03 13:29:58,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:29:58,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:29:58,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:29:58,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:29:58,798 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:29:58,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/diamond_1-2.c [2025-03-03 13:29:59,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103b89e7e/680ac8737cb74005afe43f840e080cda/FLAGfb45084cc [2025-03-03 13:30:00,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:30:00,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_1-2.c [2025-03-03 13:30:00,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103b89e7e/680ac8737cb74005afe43f840e080cda/FLAGfb45084cc [2025-03-03 13:30:00,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103b89e7e/680ac8737cb74005afe43f840e080cda [2025-03-03 13:30:00,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:30:00,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:30:00,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:30:00,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:30:00,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:30:00,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b281dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00, skipping insertion in model container [2025-03-03 13:30:00,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:30:00,283 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-acceleration/diamond_1-2.c[373,386] [2025-03-03 13:30:00,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:30:00,302 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:30:00,309 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-acceleration/diamond_1-2.c[373,386] [2025-03-03 13:30:00,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:30:00,319 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:30:00,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00 WrapperNode [2025-03-03 13:30:00,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:30:00,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:30:00,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:30:00,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:30:00,325 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:30:00" (1/1) ... [2025-03-03 13:30:00,328 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:30:00" (1/1) ... [2025-03-03 13:30:00,336 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2025-03-03 13:30:00,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:30:00,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:30:00,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:30:00,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:30:00,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,348 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:30:00,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:30:00,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:30:00,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:30:00,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:30:00,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (1/1) ... [2025-03-03 13:30:00,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:30:00,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:30:00,375 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:30:00,380 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:30:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:30:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:30:00,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:30:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:30:00,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:30:00,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:30:00,499 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 13:30:00,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:30:00,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:30:00,505 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:30:00,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:30:00 BoogieIcfgContainer [2025-03-03 13:30:00,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:30:00,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:30:00,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:30:00,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:30:00,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:30:00" (1/3) ... [2025-03-03 13:30:00,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e48a8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:30:00, skipping insertion in model container [2025-03-03 13:30:00,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:30:00" (2/3) ... [2025-03-03 13:30:00,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e48a8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:30:00, skipping insertion in model container [2025-03-03 13:30:00,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:30:00" (3/3) ... [2025-03-03 13:30:00,511 INFO L128 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2025-03-03 13:30:00,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:30:00,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diamond_1-2.c that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:30:00,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:30:00,566 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;@4346b905, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:30:00,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:30:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 13:30:00,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:00,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 13:30:00,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:00,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash 40045990, now seen corresponding path program 1 times [2025-03-03 13:30:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:00,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714366624] [2025-03-03 13:30:00,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:30:00,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:00,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 13:30:00,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 13:30:00,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:30:00,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:00,727 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:30:00,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:00,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714366624] [2025-03-03 13:30:00,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714366624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:30:00,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:30:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:30:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981330406] [2025-03-03 13:30:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:30:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:30:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:00,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:30:00,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:30:00,750 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:00,777 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-03-03 13:30:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:30:00,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 13:30:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:00,785 INFO L225 Difference]: With dead ends: 20 [2025-03-03 13:30:00,785 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 13:30:00,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:30:00,789 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:00,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:30:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 13:30:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-03 13:30:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-03 13:30:00,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2025-03-03 13:30:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:00,810 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-03 13:30:00,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-03-03 13:30:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 13:30:00,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:00,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:30:00,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:30:00,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:00,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash -167646296, now seen corresponding path program 1 times [2025-03-03 13:30:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:00,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655941548] [2025-03-03 13:30:00,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:30:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:00,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:30:00,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:30:00,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:30:00,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:00,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:00,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655941548] [2025-03-03 13:30:00,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655941548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:30:00,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496146343] [2025-03-03 13:30:00,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:30:00,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:00,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:30:00,927 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:30:00,929 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:30:00,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:30:00,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:30:00,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:30:00,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:00,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:30:00,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:30:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:00,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:30:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496146343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:30:01,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:30:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 13:30:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362031947] [2025-03-03 13:30:01,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:30:01,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:30:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:01,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:30:01,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:30:01,028 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:30:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:01,085 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2025-03-03 13:30:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:30:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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 7 [2025-03-03 13:30:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:01,086 INFO L225 Difference]: With dead ends: 17 [2025-03-03 13:30:01,087 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 13:30:01,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:30:01,087 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:01,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:30:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 13:30:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 13:30:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-03-03 13:30:01,093 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 7 [2025-03-03 13:30:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:01,093 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-03 13:30:01,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:30:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2025-03-03 13:30:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:30:01,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:01,095 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-03 13:30:01,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:30:01,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:01,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:01,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2132188712, now seen corresponding path program 1 times [2025-03-03 13:30:01,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:01,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088927819] [2025-03-03 13:30:01,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:30:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:01,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:30:01,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:30:01,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:30:01,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:01,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:01,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088927819] [2025-03-03 13:30:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088927819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:30:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157887958] [2025-03-03 13:30:01,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:30:01,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:01,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:30:01,400 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:30:01,401 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:30:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:30:01,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:30:01,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:30:01,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:01,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:30:01,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:30:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:01,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:30:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157887958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:30:01,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:30:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 13:30:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39010878] [2025-03-03 13:30:01,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:30:01,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:30:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:01,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:30:01,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:30:01,504 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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:30:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:01,597 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2025-03-03 13:30:01,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:30:01,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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) Word has length 9 [2025-03-03 13:30:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:01,598 INFO L225 Difference]: With dead ends: 28 [2025-03-03 13:30:01,598 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 13:30:01,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:30:01,599 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:01,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 23 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:30:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 13:30:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2025-03-03 13:30:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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:30:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-03 13:30:01,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 9 [2025-03-03 13:30:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:01,603 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-03 13:30:01,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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:30:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-03-03 13:30:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:30:01,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:01,603 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2025-03-03 13:30:01,609 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:30:01,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 13:30:01,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash -147591504, now seen corresponding path program 2 times [2025-03-03 13:30:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:01,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94555906] [2025-03-03 13:30:01,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:30:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:01,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-03 13:30:01,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:30:01,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:30:01,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:01,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94555906] [2025-03-03 13:30:01,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94555906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:30:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610387161] [2025-03-03 13:30:01,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:30:01,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:01,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:30:01,970 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:30:01,972 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:30:01,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-03 13:30:01,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:30:01,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:30:01,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:01,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:30:02,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:30:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:02,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:30:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610387161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:30:02,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:30:02,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-03 13:30:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272384111] [2025-03-03 13:30:02,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:30:02,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:30:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:02,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:30:02,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:30:02,147 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:30:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:02,423 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2025-03-03 13:30:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 13:30:02,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:30:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:02,424 INFO L225 Difference]: With dead ends: 63 [2025-03-03 13:30:02,424 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 13:30:02,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=230, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:30:02,425 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:02,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:30:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 13:30:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 30. [2025-03-03 13:30:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2025-03-03 13:30:02,438 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 15 [2025-03-03 13:30:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:02,438 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2025-03-03 13:30:02,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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:30:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2025-03-03 13:30:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 13:30:02,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:02,438 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2025-03-03 13:30:02,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:30:02,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:02,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:02,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1099828268, now seen corresponding path program 2 times [2025-03-03 13:30:02,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:02,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511812354] [2025-03-03 13:30:02,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:30:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:02,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 13:30:02,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:30:02,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:30:02,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511812354] [2025-03-03 13:30:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511812354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:30:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562890586] [2025-03-03 13:30:02,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:30:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:02,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:30:02,765 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:30:02,766 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:30:02,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 13:30:02,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 13:30:02,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:30:02,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:02,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 13:30:02,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:30:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:02,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:30:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562890586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:30:02,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:30:02,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-03 13:30:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102986174] [2025-03-03 13:30:02,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:30:02,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:30:02,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:02,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:30:02,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:30:02,930 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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:30:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:03,370 INFO L93 Difference]: Finished difference Result 141 states and 209 transitions. [2025-03-03 13:30:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:30:03,371 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 13:30:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:03,372 INFO L225 Difference]: With dead ends: 141 [2025-03-03 13:30:03,372 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 13:30:03,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:30:03,374 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:03,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:30:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 13:30:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 74. [2025-03-03 13:30:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 73 states have internal predecessors, (108), 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:30:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2025-03-03 13:30:03,397 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 17 [2025-03-03 13:30:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:03,397 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2025-03-03 13:30:03,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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:30:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2025-03-03 13:30:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:30:03,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:03,398 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 3, 1, 1, 1, 1, 1] [2025-03-03 13:30:03,405 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:30:03,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:03,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:03,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2137842581, now seen corresponding path program 1 times [2025-03-03 13:30:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434841002] [2025-03-03 13:30:03,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:30:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:03,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:30:03,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:30:03,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:30:03,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 13:30:03,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434841002] [2025-03-03 13:30:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434841002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:30:03,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:30:03,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:30:03,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041125801] [2025-03-03 13:30:03,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:30:03,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:30:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:03,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:30:03,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:30:03,641 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:03,664 INFO L93 Difference]: Finished difference Result 127 states and 186 transitions. [2025-03-03 13:30:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:30:03,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 13:30:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:03,666 INFO L225 Difference]: With dead ends: 127 [2025-03-03 13:30:03,667 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 13:30:03,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:30:03,668 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:03,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:30:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 13:30:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2025-03-03 13:30:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 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:30:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2025-03-03 13:30:03,684 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 23 [2025-03-03 13:30:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:03,685 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2025-03-03 13:30:03,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2025-03-03 13:30:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:30:03,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:03,686 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2025-03-03 13:30:03,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:30:03,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:03,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1396317413, now seen corresponding path program 2 times [2025-03-03 13:30:03,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:03,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221089067] [2025-03-03 13:30:03,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:30:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:03,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-03 13:30:03,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:30:03,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:30:03,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 13:30:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221089067] [2025-03-03 13:30:03,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221089067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:30:03,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:30:03,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:30:03,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684174304] [2025-03-03 13:30:03,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:30:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:30:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:03,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:30:03,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:30:03,722 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:03,739 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-03-03 13:30:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:30:03,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 27 [2025-03-03 13:30:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:03,740 INFO L225 Difference]: With dead ends: 79 [2025-03-03 13:30:03,740 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 13:30:03,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:30:03,742 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:03,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:30:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 13:30:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 13:30:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2025-03-03 13:30:03,758 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 27 [2025-03-03 13:30:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:03,758 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2025-03-03 13:30:03,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:30:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2025-03-03 13:30:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 13:30:03,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:03,759 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1] [2025-03-03 13:30:03,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:30:03,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:03,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1859394370, now seen corresponding path program 3 times [2025-03-03 13:30:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595556482] [2025-03-03 13:30:03,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:30:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:03,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 13 equivalence classes. [2025-03-03 13:30:03,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:30:03,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-03 13:30:03,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595556482] [2025-03-03 13:30:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595556482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:30:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801929877] [2025-03-03 13:30:03,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:30:03,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:03,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:30:03,978 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:30:03,980 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:30:03,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 13 equivalence classes. [2025-03-03 13:30:04,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 13:30:04,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-03 13:30:04,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:04,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 13:30:04,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:30:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:04,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:30:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801929877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:30:04,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:30:04,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-03 13:30:04,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257201011] [2025-03-03 13:30:04,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:30:04,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 13:30:04,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:04,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 13:30:04,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:30:04,382 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 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:30:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:07,501 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2025-03-03 13:30:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 13:30:07,502 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 13:30:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:07,502 INFO L225 Difference]: With dead ends: 88 [2025-03-03 13:30:07,502 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 13:30:07,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=598, Invalid=1042, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 13:30:07,503 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:07,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:30:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 13:30:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 13:30:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 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:30:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2025-03-03 13:30:07,516 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 29 [2025-03-03 13:30:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:07,516 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2025-03-03 13:30:07,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 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:30:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2025-03-03 13:30:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:30:07,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:07,517 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1] [2025-03-03 13:30:07,522 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:30:07,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:07,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:07,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1974723532, now seen corresponding path program 3 times [2025-03-03 13:30:07,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:07,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585451021] [2025-03-03 13:30:07,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:30:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:07,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 15 equivalence classes. [2025-03-03 13:30:07,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:30:07,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-03 13:30:07,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:07,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585451021] [2025-03-03 13:30:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585451021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:30:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896076481] [2025-03-03 13:30:07,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:30:07,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:30:07,947 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:30:07,948 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:30:07,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 15 equivalence classes. [2025-03-03 13:30:07,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:30:07,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-03 13:30:07,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:07,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 13:30:07,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:30:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:08,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:30:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896076481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:30:08,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:30:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-03-03 13:30:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529721400] [2025-03-03 13:30:08,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:30:08,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 13:30:08,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:08,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 13:30:08,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 13:30:08,367 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:30:18,334 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2025-03-03 13:30:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 13:30:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 13:30:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:30:18,335 INFO L225 Difference]: With dead ends: 120 [2025-03-03 13:30:18,335 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 13:30:18,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=780, Invalid=1382, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 13:30:18,336 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:30:18,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 50 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:30:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 13:30:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-03 13:30:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.0258620689655173) internal successors, (119), 116 states have internal predecessors, (119), 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:30:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2025-03-03 13:30:18,346 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 33 [2025-03-03 13:30:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:30:18,346 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2025-03-03 13:30:18,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:30:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2025-03-03 13:30:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 13:30:18,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:30:18,348 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1] [2025-03-03 13:30:18,354 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:30:18,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:18,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:30:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:30:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1248239450, now seen corresponding path program 4 times [2025-03-03 13:30:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:30:18,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771550170] [2025-03-03 13:30:18,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:30:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:30:18,553 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-03 13:30:18,565 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:30:18,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:30:18,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:19,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:30:19,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771550170] [2025-03-03 13:30:19,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771550170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:30:19,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916825466] [2025-03-03 13:30:19,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:30:19,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:30:19,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:30:19,069 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:30:19,070 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:30:19,097 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-03 13:30:19,126 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:30:19,126 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:30:19,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:30:19,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 13:30:19,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:30:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:19,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:30:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:30:20,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916825466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:30:20,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:30:20,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2025-03-03 13:30:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861580458] [2025-03-03 13:30:20,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:30:20,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-03 13:30:20,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:30:20,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-03 13:30:20,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 13:30:20,041 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 57 states have internal predecessors, (113), 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)