./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:42:19,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:42:19,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:42:19,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:42:19,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:42:19,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:42:19,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:42:19,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:42:19,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:42:19,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:42:19,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:42:19,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:42:19,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:42:19,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:42:19,524 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:42:19,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:42:19,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:42:19,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:42:19,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:42:19,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:42:19,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:42:19,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:42:19,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:42:19,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:42:19,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:42:19,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:42:19,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:42:19,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:42:19,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:42:19,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:42:19,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:42:19,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:42:19,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:42:19,527 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 -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2025-03-03 09:42:19,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:42:19,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:42:19,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:42:19,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:42:19,756 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:42:19,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2025-03-03 09:42:20,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8747d0e6b/61f4456070b646559ff0a2444f04d137/FLAGc3dfd1668 [2025-03-03 09:42:21,104 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:42:21,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2025-03-03 09:42:21,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8747d0e6b/61f4456070b646559ff0a2444f04d137/FLAGc3dfd1668 [2025-03-03 09:42:21,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8747d0e6b/61f4456070b646559ff0a2444f04d137 [2025-03-03 09:42:21,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:42:21,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:42:21,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:42:21,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:42:21,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:42:21,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bab302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21, skipping insertion in model container [2025-03-03 09:42:21,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:42:21,246 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/bitvector/byte_add-1.i[1166,1179] [2025-03-03 09:42:21,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:42:21,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:42:21,305 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/bitvector/byte_add-1.i[1166,1179] [2025-03-03 09:42:21,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:42:21,346 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:42:21,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21 WrapperNode [2025-03-03 09:42:21,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:42:21,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:42:21,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:42:21,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:42:21,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,380 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2025-03-03 09:42:21,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:42:21,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:42:21,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:42:21,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:42:21,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,398 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 09:42:21,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:42:21,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:42:21,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:42:21,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:42:21,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (1/1) ... [2025-03-03 09:42:21,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:42:21,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:21,445 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 09:42:21,449 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 09:42:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:42:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:42:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:42:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:42:21,513 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:42:21,514 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:42:21,758 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-03 09:42:21,758 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:42:21,774 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:42:21,774 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:42:21,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:21 BoogieIcfgContainer [2025-03-03 09:42:21,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:42:21,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:42:21,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:42:21,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:42:21,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:42:21" (1/3) ... [2025-03-03 09:42:21,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb4b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:21, skipping insertion in model container [2025-03-03 09:42:21,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:21" (2/3) ... [2025-03-03 09:42:21,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb4b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:21, skipping insertion in model container [2025-03-03 09:42:21,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:21" (3/3) ... [2025-03-03 09:42:21,783 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2025-03-03 09:42:21,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:42:21,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add-1.i that has 1 procedures, 51 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:42:21,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:42:21,835 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;@9502b32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:42:21,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:42:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 09:42:21,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:21,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:21,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:21,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash 256418395, now seen corresponding path program 1 times [2025-03-03 09:42:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923451452] [2025-03-03 09:42:21,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:21,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 09:42:21,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:42:21,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:21,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:22,100 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 09:42:22,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:22,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923451452] [2025-03-03 09:42:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923451452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:22,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:22,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:42:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592055648] [2025-03-03 09:42:22,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:22,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:42:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:22,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:42:22,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:42:22,124 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:22,275 INFO L93 Difference]: Finished difference Result 115 states and 196 transitions. [2025-03-03 09:42:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:42:22,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 09:42:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:22,282 INFO L225 Difference]: With dead ends: 115 [2025-03-03 09:42:22,282 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 09:42:22,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:42:22,287 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:22,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 90 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 09:42:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-03 09:42:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 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 09:42:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-03-03 09:42:22,326 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2025-03-03 09:42:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:22,327 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-03-03 09:42:22,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-03-03 09:42:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:42:22,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:22,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:22,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:42:22,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:22,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -150396971, now seen corresponding path program 1 times [2025-03-03 09:42:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:22,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481943552] [2025-03-03 09:42:22,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:22,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:22,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 09:42:22,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:42:22,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:22,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:22,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:22,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481943552] [2025-03-03 09:42:22,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481943552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:22,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:22,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:42:22,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474060776] [2025-03-03 09:42:22,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:22,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:42:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:22,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:42:22,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:42:22,480 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 09:42:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:22,690 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2025-03-03 09:42:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:42:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 09:42:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:22,691 INFO L225 Difference]: With dead ends: 164 [2025-03-03 09:42:22,691 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 09:42:22,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:42:22,692 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 92 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:22,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 107 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:42:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 09:42:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2025-03-03 09:42:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 states have internal predecessors, (139), 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 09:42:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2025-03-03 09:42:22,705 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2025-03-03 09:42:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:22,705 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2025-03-03 09:42:22,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 09:42:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2025-03-03 09:42:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:42:22,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:22,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:22,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:42:22,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:22,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1774093583, now seen corresponding path program 1 times [2025-03-03 09:42:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537209699] [2025-03-03 09:42:22,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:22,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:42:22,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:42:22,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:22,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:42:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537209699] [2025-03-03 09:42:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537209699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:22,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:22,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:42:22,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480302016] [2025-03-03 09:42:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:22,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:42:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:22,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:42:22,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:42:22,857 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:22,983 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2025-03-03 09:42:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:42:22,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 09:42:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:22,985 INFO L225 Difference]: With dead ends: 238 [2025-03-03 09:42:22,987 INFO L226 Difference]: Without dead ends: 160 [2025-03-03 09:42:22,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:42:22,988 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 75 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:22,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 179 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-03 09:42:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 98. [2025-03-03 09:42:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 97 states have internal predecessors, (149), 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 09:42:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2025-03-03 09:42:22,994 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 27 [2025-03-03 09:42:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:22,994 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2025-03-03 09:42:22,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2025-03-03 09:42:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:42:22,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:22,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:22,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:42:22,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:22,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1362530234, now seen corresponding path program 1 times [2025-03-03 09:42:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583538236] [2025-03-03 09:42:22,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:23,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 09:42:23,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:42:23,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:23,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:42:23,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:23,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583538236] [2025-03-03 09:42:23,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583538236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:23,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:23,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:42:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634635313] [2025-03-03 09:42:23,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:23,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:42:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:23,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:42:23,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:42:23,134 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 09:42:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:23,246 INFO L93 Difference]: Finished difference Result 244 states and 367 transitions. [2025-03-03 09:42:23,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:42:23,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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) Word has length 28 [2025-03-03 09:42:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:23,247 INFO L225 Difference]: With dead ends: 244 [2025-03-03 09:42:23,247 INFO L226 Difference]: Without dead ends: 166 [2025-03-03 09:42:23,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:42:23,248 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 70 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:23,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 171 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-03 09:42:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109. [2025-03-03 09:42:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 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 09:42:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2025-03-03 09:42:23,260 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2025-03-03 09:42:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2025-03-03 09:42:23,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 09:42:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2025-03-03 09:42:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:42:23,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:23,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:23,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:42:23,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:23,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1502995180, now seen corresponding path program 1 times [2025-03-03 09:42:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-03-03 09:42:23,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:23,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:42:23,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:42:23,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:23,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:23,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:23,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-03-03 09:42:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006242003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278103995] [2025-03-03 09:42:23,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:23,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:23,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:23,379 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 09:42:23,381 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 09:42:23,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:42:23,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:42:23,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:23,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:23,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:42:23,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:42:23,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:42:23,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278103995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:23,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:42:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-03-03 09:42:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406294666] [2025-03-03 09:42:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:23,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:42:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:23,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:42:23,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:42:23,486 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:23,633 INFO L93 Difference]: Finished difference Result 230 states and 363 transitions. [2025-03-03 09:42:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:42:23,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 09:42:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:23,635 INFO L225 Difference]: With dead ends: 230 [2025-03-03 09:42:23,635 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 09:42:23,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:42:23,635 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:23,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 142 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 09:42:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2025-03-03 09:42:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 137 states have internal predecessors, (196), 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 09:42:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2025-03-03 09:42:23,642 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 29 [2025-03-03 09:42:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:23,642 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2025-03-03 09:42:23,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2025-03-03 09:42:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 09:42:23,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:23,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:23,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:42:23,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:23,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:23,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1919697766, now seen corresponding path program 1 times [2025-03-03 09:42:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000783449] [2025-03-03 09:42:23,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:23,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:42:23,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:42:23,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:23,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:23,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:23,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000783449] [2025-03-03 09:42:23,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000783449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144676673] [2025-03-03 09:42:23,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:23,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:23,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:23,952 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 09:42:23,953 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 09:42:23,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 09:42:24,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 09:42:24,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:24,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:24,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:42:24,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:42:24,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:42:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144676673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:24,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:42:24,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-03 09:42:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492592789] [2025-03-03 09:42:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:24,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:42:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:24,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:42:24,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:42:24,038 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:24,170 INFO L93 Difference]: Finished difference Result 288 states and 427 transitions. [2025-03-03 09:42:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:42:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 09:42:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:24,171 INFO L225 Difference]: With dead ends: 288 [2025-03-03 09:42:24,171 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 09:42:24,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:42:24,173 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:24,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 142 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 09:42:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2025-03-03 09:42:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 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 09:42:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2025-03-03 09:42:24,184 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 35 [2025-03-03 09:42:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:24,184 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2025-03-03 09:42:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2025-03-03 09:42:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:42:24,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:24,185 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:24,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:42:24,385 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,SelfDestructingSolverStorable5 [2025-03-03 09:42:24,385 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1062085122, now seen corresponding path program 1 times [2025-03-03 09:42:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684952951] [2025-03-03 09:42:24,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:24,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 09:42:24,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:42:24,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:24,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:42:24,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:24,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684952951] [2025-03-03 09:42:24,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684952951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:24,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:24,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:42:24,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055048336] [2025-03-03 09:42:24,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:24,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:42:24,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:24,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:42:24,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:42:24,495 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:24,671 INFO L93 Difference]: Finished difference Result 516 states and 714 transitions. [2025-03-03 09:42:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:42:24,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 09:42:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:24,672 INFO L225 Difference]: With dead ends: 516 [2025-03-03 09:42:24,672 INFO L226 Difference]: Without dead ends: 385 [2025-03-03 09:42:24,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:42:24,673 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 152 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:24,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 295 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:42:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-03 09:42:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 161. [2025-03-03 09:42:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 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 09:42:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2025-03-03 09:42:24,681 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 41 [2025-03-03 09:42:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:24,681 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2025-03-03 09:42:24,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2025-03-03 09:42:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 09:42:24,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:24,686 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:42:24,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1222718162, now seen corresponding path program 1 times [2025-03-03 09:42:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001142986] [2025-03-03 09:42:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:24,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 09:42:24,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:42:24,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:24,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:42:24,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:24,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001142986] [2025-03-03 09:42:24,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001142986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:24,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:24,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:42:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368688307] [2025-03-03 09:42:24,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:24,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:42:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:24,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:42:24,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:42:24,808 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:24,986 INFO L93 Difference]: Finished difference Result 496 states and 689 transitions. [2025-03-03 09:42:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:42:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 09:42:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:24,987 INFO L225 Difference]: With dead ends: 496 [2025-03-03 09:42:24,987 INFO L226 Difference]: Without dead ends: 366 [2025-03-03 09:42:24,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:42:24,988 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:24,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 260 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:42:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-03 09:42:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 161. [2025-03-03 09:42:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 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 09:42:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2025-03-03 09:42:25,004 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 42 [2025-03-03 09:42:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:25,004 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2025-03-03 09:42:25,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2025-03-03 09:42:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:42:25,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:25,005 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:25,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:42:25,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:25,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:25,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1555663649, now seen corresponding path program 1 times [2025-03-03 09:42:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-03-03 09:42:25,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:25,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 09:42:25,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:42:25,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:25,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:42:25,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:25,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-03-03 09:42:25,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495241362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:25,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:25,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:42:25,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486619979] [2025-03-03 09:42:25,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:25,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:42:25,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:25,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:42:25,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:42:25,129 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 09:42:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:25,481 INFO L93 Difference]: Finished difference Result 645 states and 888 transitions. [2025-03-03 09:42:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:42:25,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 43 [2025-03-03 09:42:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:25,483 INFO L225 Difference]: With dead ends: 645 [2025-03-03 09:42:25,483 INFO L226 Difference]: Without dead ends: 514 [2025-03-03 09:42:25,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:42:25,483 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 307 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:25,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 556 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:42:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-03 09:42:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 149. [2025-03-03 09:42:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.385135135135135) internal successors, (205), 148 states have internal predecessors, (205), 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 09:42:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 205 transitions. [2025-03-03 09:42:25,490 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 205 transitions. Word has length 43 [2025-03-03 09:42:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:25,490 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 205 transitions. [2025-03-03 09:42:25,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 09:42:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2025-03-03 09:42:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:42:25,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:25,491 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:25,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:42:25,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:25,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash -784733699, now seen corresponding path program 1 times [2025-03-03 09:42:25,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897125547] [2025-03-03 09:42:25,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:25,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:42:25,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:42:25,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:25,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:42:25,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:25,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897125547] [2025-03-03 09:42:25,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897125547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:25,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:25,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:42:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057162439] [2025-03-03 09:42:25,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:25,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:42:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:25,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:42:25,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:42:25,565 INFO L87 Difference]: Start difference. First operand 149 states and 205 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 09:42:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:25,583 INFO L93 Difference]: Finished difference Result 220 states and 298 transitions. [2025-03-03 09:42:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:42:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 48 [2025-03-03 09:42:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:25,585 INFO L225 Difference]: With dead ends: 220 [2025-03-03 09:42:25,586 INFO L226 Difference]: Without dead ends: 179 [2025-03-03 09:42:25,586 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 09:42:25,587 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:25,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:42:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-03 09:42:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-03 09:42:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.353932584269663) internal successors, (241), 178 states have internal predecessors, (241), 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 09:42:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 241 transitions. [2025-03-03 09:42:25,596 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 241 transitions. Word has length 48 [2025-03-03 09:42:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:25,597 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 241 transitions. [2025-03-03 09:42:25,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 09:42:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 241 transitions. [2025-03-03 09:42:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:42:25,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:25,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:25,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:42:25,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:25,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1326556670, now seen corresponding path program 1 times [2025-03-03 09:42:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:25,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082660914] [2025-03-03 09:42:25,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:25,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:42:25,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:42:25,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:25,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:42:25,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082660914] [2025-03-03 09:42:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082660914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008106610] [2025-03-03 09:42:25,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:25,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:25,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:25,726 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 09:42:25,728 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 09:42:25,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:42:25,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:42:25,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:25,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:25,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:42:25,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:42:25,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:42:25,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008106610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:25,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:42:25,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2025-03-03 09:42:25,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726946089] [2025-03-03 09:42:25,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:25,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:42:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:25,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:42:25,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:42:25,828 INFO L87 Difference]: Start difference. First operand 179 states and 241 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:25,914 INFO L93 Difference]: Finished difference Result 526 states and 711 transitions. [2025-03-03 09:42:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:42:25,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 09:42:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:25,916 INFO L225 Difference]: With dead ends: 526 [2025-03-03 09:42:25,916 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 09:42:25,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:42:25,916 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:25,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 175 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 09:42:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 304. [2025-03-03 09:42:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 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 09:42:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 403 transitions. [2025-03-03 09:42:25,928 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 403 transitions. Word has length 48 [2025-03-03 09:42:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:25,928 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 403 transitions. [2025-03-03 09:42:25,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 403 transitions. [2025-03-03 09:42:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:42:25,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:25,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:25,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:42:26,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:26,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:26,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2133813035, now seen corresponding path program 1 times [2025-03-03 09:42:26,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:26,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555954773] [2025-03-03 09:42:26,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:26,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:26,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:42:26,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:42:26,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:26,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:42:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555954773] [2025-03-03 09:42:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555954773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935887593] [2025-03-03 09:42:26,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:26,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:26,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:26,238 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 09:42:26,240 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 09:42:26,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 09:42:26,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:42:26,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:26,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:26,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:42:26,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:42:26,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:42:26,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935887593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:26,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:42:26,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-03 09:42:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100941319] [2025-03-03 09:42:26,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:26,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:42:26,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:26,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:42:26,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:42:26,315 INFO L87 Difference]: Start difference. First operand 304 states and 403 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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 09:42:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:26,489 INFO L93 Difference]: Finished difference Result 813 states and 1103 transitions. [2025-03-03 09:42:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:42:26,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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) Word has length 49 [2025-03-03 09:42:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:26,491 INFO L225 Difference]: With dead ends: 813 [2025-03-03 09:42:26,491 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 09:42:26,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:42:26,492 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 104 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:26,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 278 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 09:42:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 469. [2025-03-03 09:42:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.3162393162393162) internal successors, (616), 468 states have internal predecessors, (616), 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 09:42:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 616 transitions. [2025-03-03 09:42:26,511 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 616 transitions. Word has length 49 [2025-03-03 09:42:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:26,511 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 616 transitions. [2025-03-03 09:42:26,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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 09:42:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 616 transitions. [2025-03-03 09:42:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:42:26,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:26,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:26,518 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 09:42:26,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:26,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:26,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1518950401, now seen corresponding path program 1 times [2025-03-03 09:42:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41926371] [2025-03-03 09:42:26,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:26,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:42:26,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:42:26,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:26,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:42:26,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:26,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41926371] [2025-03-03 09:42:26,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41926371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:26,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:26,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:42:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085318960] [2025-03-03 09:42:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:26,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:42:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:26,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:42:26,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:42:26,839 INFO L87 Difference]: Start difference. First operand 469 states and 616 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:27,177 INFO L93 Difference]: Finished difference Result 2209 states and 2875 transitions. [2025-03-03 09:42:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:42:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 09:42:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:27,182 INFO L225 Difference]: With dead ends: 2209 [2025-03-03 09:42:27,182 INFO L226 Difference]: Without dead ends: 1793 [2025-03-03 09:42:27,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:42:27,184 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 251 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:27,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 469 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:42:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-03 09:42:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 457. [2025-03-03 09:42:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.3245614035087718) internal successors, (604), 456 states have internal predecessors, (604), 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 09:42:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 604 transitions. [2025-03-03 09:42:27,211 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 604 transitions. Word has length 50 [2025-03-03 09:42:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:27,211 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 604 transitions. [2025-03-03 09:42:27,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:42:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 604 transitions. [2025-03-03 09:42:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:42:27,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:27,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:27,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:42:27,213 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:27,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1888731518, now seen corresponding path program 1 times [2025-03-03 09:42:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588057641] [2025-03-03 09:42:27,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:27,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:27,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:42:27,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:42:27,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:27,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:42:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588057641] [2025-03-03 09:42:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588057641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:27,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:27,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:42:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492672642] [2025-03-03 09:42:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:27,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:42:27,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:27,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:42:27,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:42:27,294 INFO L87 Difference]: Start difference. First operand 457 states and 604 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 09:42:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:27,425 INFO L93 Difference]: Finished difference Result 1417 states and 1866 transitions. [2025-03-03 09:42:27,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:42:27,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 52 [2025-03-03 09:42:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:27,428 INFO L225 Difference]: With dead ends: 1417 [2025-03-03 09:42:27,428 INFO L226 Difference]: Without dead ends: 933 [2025-03-03 09:42:27,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:42:27,428 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:27,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 135 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-03 09:42:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 821. [2025-03-03 09:42:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 1.3060975609756098) internal successors, (1071), 820 states have internal predecessors, (1071), 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 09:42:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1071 transitions. [2025-03-03 09:42:27,454 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1071 transitions. Word has length 52 [2025-03-03 09:42:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:27,454 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1071 transitions. [2025-03-03 09:42:27,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 09:42:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1071 transitions. [2025-03-03 09:42:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:42:27,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:27,455 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:27,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:42:27,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:27,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:27,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2037821496, now seen corresponding path program 1 times [2025-03-03 09:42:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:27,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681125002] [2025-03-03 09:42:27,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:27,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:42:27,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:42:27,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:27,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:42:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681125002] [2025-03-03 09:42:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681125002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:27,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018625420] [2025-03-03 09:42:27,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:27,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:27,549 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 09:42:27,551 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 09:42:27,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:42:27,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:42:27,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:27,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:27,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:42:27,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:42:27,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:42:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018625420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:27,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:42:27,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-03-03 09:42:27,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384853094] [2025-03-03 09:42:27,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:27,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:42:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:27,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:42:27,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:42:27,637 INFO L87 Difference]: Start difference. First operand 821 states and 1071 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 09:42:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:27,918 INFO L93 Difference]: Finished difference Result 1841 states and 2416 transitions. [2025-03-03 09:42:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:42:27,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 53 [2025-03-03 09:42:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:27,922 INFO L225 Difference]: With dead ends: 1841 [2025-03-03 09:42:27,922 INFO L226 Difference]: Without dead ends: 1384 [2025-03-03 09:42:27,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:42:27,924 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 230 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:27,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 388 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:42:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-03 09:42:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1180. [2025-03-03 09:42:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 1.2994062765055132) internal successors, (1532), 1179 states have internal predecessors, (1532), 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 09:42:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1532 transitions. [2025-03-03 09:42:27,964 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1532 transitions. Word has length 53 [2025-03-03 09:42:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:27,965 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1532 transitions. [2025-03-03 09:42:27,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 09:42:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1532 transitions. [2025-03-03 09:42:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 09:42:27,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:27,966 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:27,975 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 09:42:28,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:42:28,170 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:28,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1538012059, now seen corresponding path program 1 times [2025-03-03 09:42:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968489748] [2025-03-03 09:42:28,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:28,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 09:42:28,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:42:28,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:28,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:42:29,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:29,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968489748] [2025-03-03 09:42:29,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968489748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:29,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851783079] [2025-03-03 09:42:29,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:29,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:29,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:29,571 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 09:42:29,572 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 09:42:29,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 09:42:29,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:42:29,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:29,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:29,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 09:42:29,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:42:42,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:42:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851783079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:47,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:42:47,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 57 [2025-03-03 09:42:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685106152] [2025-03-03 09:42:47,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:47,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-03 09:42:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:47,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-03 09:42:47,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=2777, Unknown=1, NotChecked=0, Total=3192 [2025-03-03 09:42:47,768 INFO L87 Difference]: Start difference. First operand 1180 states and 1532 transitions. Second operand has 57 states, 57 states have (on average 2.4035087719298245) internal successors, (137), 57 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:05,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 09:43:19,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 09:43:25,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 09:43:30,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 09:43:38,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 09:43:41,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 09:43:51,947 WARN L286 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 74 DAG size of output: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)