./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/interleave_bits.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:02:12,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:02:12,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:02:12,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:02:12,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:02:12,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:02:12,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:02:12,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:02:12,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:02:12,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:02:12,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:02:12,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:02:12,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:02:12,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:02:12,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:02:12,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:02:12,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:02:12,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:02:12,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:02:12,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:02:12,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:02:12,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:02:12,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:02:12,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:12,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:02:12,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:02:12,984 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-03-16 14:02:13,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:02:13,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:02:13,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:02:13,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:02:13,223 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:02:13,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-16 14:02:14,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54961c538/05a19b39d7a940c9a396c31ff9c6d798/FLAG5f4aa0127 [2025-03-16 14:02:14,631 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:02:14,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-16 14:02:14,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54961c538/05a19b39d7a940c9a396c31ff9c6d798/FLAG5f4aa0127 [2025-03-16 14:02:14,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54961c538/05a19b39d7a940c9a396c31ff9c6d798 [2025-03-16 14:02:14,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:02:14,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:02:14,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:02:14,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:02:14,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:02:14,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14, skipping insertion in model container [2025-03-16 14:02:14,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:02:14,758 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/interleave_bits.i[1175,1188] [2025-03-16 14:02:14,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:02:14,783 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:02:14,789 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/interleave_bits.i[1175,1188] [2025-03-16 14:02:14,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:02:14,809 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:02:14,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14 WrapperNode [2025-03-16 14:02:14,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:02:14,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:02:14,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:02:14,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:02:14,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,838 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 232 [2025-03-16 14:02:14,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:02:14,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:02:14,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:02:14,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:02:14,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,856 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:02:14,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:02:14,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:02:14,869 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:02:14,869 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:02:14,870 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (1/1) ... [2025-03-16 14:02:14,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:14,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:14,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:02:14,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:02:14,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:02:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:02:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:02:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:02:14,970 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:02:14,972 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:02:15,992 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-16 14:02:15,993 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:02:16,031 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:02:16,032 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-16 14:02:16,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:16 BoogieIcfgContainer [2025-03-16 14:02:16,032 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:02:16,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:02:16,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:02:16,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:02:16,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:02:14" (1/3) ... [2025-03-16 14:02:16,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451cee92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:02:16, skipping insertion in model container [2025-03-16 14:02:16,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:14" (2/3) ... [2025-03-16 14:02:16,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451cee92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:02:16, skipping insertion in model container [2025-03-16 14:02:16,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:16" (3/3) ... [2025-03-16 14:02:16,040 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-03-16 14:02:16,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:02:16,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:02:16,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:02:16,091 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;@345899a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:02:16,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:02:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 88 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 14:02:16,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:16,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:16,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:16,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1934969952, now seen corresponding path program 1 times [2025-03-16 14:02:16,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:16,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818690902] [2025-03-16 14:02:16,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:16,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:16,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 14:02:16,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 14:02:16,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:16,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:16,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818690902] [2025-03-16 14:02:16,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818690902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:16,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:16,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:02:16,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728828268] [2025-03-16 14:02:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:16,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:02:16,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:16,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:02:16,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:02:16,465 INFO L87 Difference]: Start difference. First operand has 89 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 88 states have internal predecessors, (136), 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 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:16,552 INFO L93 Difference]: Finished difference Result 196 states and 303 transitions. [2025-03-16 14:02:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:02:16,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-16 14:02:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:16,558 INFO L225 Difference]: With dead ends: 196 [2025-03-16 14:02:16,558 INFO L226 Difference]: Without dead ends: 105 [2025-03-16 14:02:16,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:02:16,563 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:16,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 200 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-16 14:02:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2025-03-16 14:02:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 92 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2025-03-16 14:02:16,586 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 30 [2025-03-16 14:02:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:16,586 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2025-03-16 14:02:16,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2025-03-16 14:02:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 14:02:16,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:16,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:16,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:02:16,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:16,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:16,588 INFO L85 PathProgramCache]: Analyzing trace with hash 501846741, now seen corresponding path program 1 times [2025-03-16 14:02:16,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:16,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448853866] [2025-03-16 14:02:16,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:16,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:16,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 14:02:16,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 14:02:16,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:16,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:16,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448853866] [2025-03-16 14:02:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448853866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292775143] [2025-03-16 14:02:16,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:16,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:16,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:16,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:02:16,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 14:02:16,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 14:02:16,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:16,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:16,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:02:16,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:16,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:16,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292775143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:16,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:16,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-16 14:02:16,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534995886] [2025-03-16 14:02:16,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:16,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:02:16,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:16,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:02:16,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:02:16,926 INFO L87 Difference]: Start difference. First operand 93 states and 141 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:17,110 INFO L93 Difference]: Finished difference Result 235 states and 363 transitions. [2025-03-16 14:02:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:02:17,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-16 14:02:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:17,112 INFO L225 Difference]: With dead ends: 235 [2025-03-16 14:02:17,112 INFO L226 Difference]: Without dead ends: 150 [2025-03-16 14:02:17,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:02:17,113 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 157 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:17,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 493 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:02:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-16 14:02:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-16 14:02:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.523489932885906) internal successors, (227), 149 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2025-03-16 14:02:17,121 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 40 [2025-03-16 14:02:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:17,121 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2025-03-16 14:02:17,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2025-03-16 14:02:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 14:02:17,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:17,124 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:17,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:17,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:17,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:17,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -48167808, now seen corresponding path program 1 times [2025-03-16 14:02:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568305986] [2025-03-16 14:02:17,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:17,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 14:02:17,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 14:02:17,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:17,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:02:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568305986] [2025-03-16 14:02:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568305986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077727032] [2025-03-16 14:02:17,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:17,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:17,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:17,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:17,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:02:17,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 14:02:17,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 14:02:17,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:17,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:17,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:02:17,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:02:17,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:02:17,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077727032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:17,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-16 14:02:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43368891] [2025-03-16 14:02:17,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:17,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 14:02:17,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:17,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 14:02:17,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:02:17,753 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:17,987 INFO L93 Difference]: Finished difference Result 255 states and 389 transitions. [2025-03-16 14:02:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:02:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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 74 [2025-03-16 14:02:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:17,988 INFO L225 Difference]: With dead ends: 255 [2025-03-16 14:02:17,988 INFO L226 Difference]: Without dead ends: 150 [2025-03-16 14:02:17,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:02:17,989 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 232 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:17,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 651 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:02:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-16 14:02:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-16 14:02:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4966442953020134) internal successors, (223), 149 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-16 14:02:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2025-03-16 14:02:18,002 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 74 [2025-03-16 14:02:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:18,002 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2025-03-16 14:02:18,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2025-03-16 14:02:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 14:02:18,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:18,004 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:18,010 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-16 14:02:18,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 14:02:18,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:18,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:18,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1633737478, now seen corresponding path program 2 times [2025-03-16 14:02:18,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:18,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999378846] [2025-03-16 14:02:18,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:18,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-16 14:02:18,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 14:02:18,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:18,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:18,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:18,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999378846] [2025-03-16 14:02:18,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999378846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:18,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474687241] [2025-03-16 14:02:18,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:18,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:18,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:18,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:18,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:02:18,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-16 14:02:18,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 14:02:18,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:18,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:18,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 14:02:18,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:18,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474687241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:18,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:18,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-16 14:02:18,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170880157] [2025-03-16 14:02:18,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:18,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:02:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:18,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:02:18,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:02:18,717 INFO L87 Difference]: Start difference. First operand 150 states and 223 transitions. Second operand has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 12 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:19,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:19,140 INFO L93 Difference]: Finished difference Result 345 states and 517 transitions. [2025-03-16 14:02:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 14:02:19,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 12 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 14:02:19,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:19,142 INFO L225 Difference]: With dead ends: 345 [2025-03-16 14:02:19,142 INFO L226 Difference]: Without dead ends: 282 [2025-03-16 14:02:19,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:19,143 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 557 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:19,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1114 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:02:19,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-16 14:02:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-16 14:02:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4768683274021353) internal successors, (415), 281 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 415 transitions. [2025-03-16 14:02:19,162 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 415 transitions. Word has length 76 [2025-03-16 14:02:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:19,163 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 415 transitions. [2025-03-16 14:02:19,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 12 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2025-03-16 14:02:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 14:02:19,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:19,166 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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-16 14:02:19,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:19,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:19,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:19,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2102780440, now seen corresponding path program 3 times [2025-03-16 14:02:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053153281] [2025-03-16 14:02:19,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 14:02:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:19,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 11 equivalence classes. [2025-03-16 14:02:19,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 148 statements. [2025-03-16 14:02:19,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 14:02:19,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-16 14:02:19,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:19,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053153281] [2025-03-16 14:02:19,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053153281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:19,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:19,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 14:02:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531262917] [2025-03-16 14:02:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:19,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 14:02:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:19,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 14:02:19,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:02:19,759 INFO L87 Difference]: Start difference. First operand 282 states and 415 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:20,144 INFO L93 Difference]: Finished difference Result 882 states and 1345 transitions. [2025-03-16 14:02:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 14:02:20,144 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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 148 [2025-03-16 14:02:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:20,148 INFO L225 Difference]: With dead ends: 882 [2025-03-16 14:02:20,148 INFO L226 Difference]: Without dead ends: 610 [2025-03-16 14:02:20,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:02:20,150 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 107 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:20,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 913 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:02:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-16 14:02:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 603. [2025-03-16 14:02:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.4385382059800664) internal successors, (866), 602 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 866 transitions. [2025-03-16 14:02:20,182 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 866 transitions. Word has length 148 [2025-03-16 14:02:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:20,182 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 866 transitions. [2025-03-16 14:02:20,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 866 transitions. [2025-03-16 14:02:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 14:02:20,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:20,185 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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-16 14:02:20,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:02:20,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:20,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash -309234274, now seen corresponding path program 1 times [2025-03-16 14:02:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335872842] [2025-03-16 14:02:20,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:20,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:02:20,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:02:20,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:20,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-16 14:02:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:20,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335872842] [2025-03-16 14:02:20,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335872842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:20,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:20,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986894951] [2025-03-16 14:02:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:20,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:20,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:20,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:20,490 INFO L87 Difference]: Start difference. First operand 603 states and 866 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:20,565 INFO L93 Difference]: Finished difference Result 1389 states and 2018 transitions. [2025-03-16 14:02:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 149 [2025-03-16 14:02:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:20,568 INFO L225 Difference]: With dead ends: 1389 [2025-03-16 14:02:20,568 INFO L226 Difference]: Without dead ends: 811 [2025-03-16 14:02:20,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:20,571 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 7 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:20,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 306 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-16 14:02:20,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2025-03-16 14:02:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.3962962962962964) internal successors, (1131), 810 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1131 transitions. [2025-03-16 14:02:20,600 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1131 transitions. Word has length 149 [2025-03-16 14:02:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:20,601 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1131 transitions. [2025-03-16 14:02:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1131 transitions. [2025-03-16 14:02:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 14:02:20,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:20,603 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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-16 14:02:20,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:02:20,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:20,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash -556301917, now seen corresponding path program 1 times [2025-03-16 14:02:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:20,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658584159] [2025-03-16 14:02:20,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:20,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:02:20,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:02:20,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:21,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:21,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658584159] [2025-03-16 14:02:21,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658584159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:21,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572021751] [2025-03-16 14:02:21,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:21,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:21,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:21,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:02:21,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:02:21,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:02:21,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:21,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:21,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 14:02:21,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-16 14:02:21,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-16 14:02:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572021751] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:21,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:21,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 6] total 17 [2025-03-16 14:02:21,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907013932] [2025-03-16 14:02:21,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:21,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:02:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:21,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:02:21,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:21,182 INFO L87 Difference]: Start difference. First operand 811 states and 1131 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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-16 14:02:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:21,249 INFO L93 Difference]: Finished difference Result 822 states and 1146 transitions. [2025-03-16 14:02:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:02:21,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 149 [2025-03-16 14:02:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:21,252 INFO L225 Difference]: With dead ends: 822 [2025-03-16 14:02:21,253 INFO L226 Difference]: Without dead ends: 814 [2025-03-16 14:02:21,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:21,254 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:21,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 203 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-03-16 14:02:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2025-03-16 14:02:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.3972939729397293) internal successors, (1136), 813 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1136 transitions. [2025-03-16 14:02:21,273 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1136 transitions. Word has length 149 [2025-03-16 14:02:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:21,273 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1136 transitions. [2025-03-16 14:02:21,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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-16 14:02:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1136 transitions. [2025-03-16 14:02:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 14:02:21,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:21,275 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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-16 14:02:21,282 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-16 14:02:21,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:21,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:21,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash -757005058, now seen corresponding path program 1 times [2025-03-16 14:02:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214559587] [2025-03-16 14:02:21,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:21,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:02:21,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:02:21,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:21,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:21,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214559587] [2025-03-16 14:02:21,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214559587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020024859] [2025-03-16 14:02:21,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:21,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:21,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:21,847 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-16 14:02:21,849 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-16 14:02:21,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:02:21,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:02:21,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:21,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:21,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 14:02:21,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-16 14:02:21,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-16 14:02:22,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020024859] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:22,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:22,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12, 5] total 17 [2025-03-16 14:02:22,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956002781] [2025-03-16 14:02:22,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:22,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:22,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:22,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:22,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:22,060 INFO L87 Difference]: Start difference. First operand 814 states and 1136 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-16 14:02:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:23,047 INFO L93 Difference]: Finished difference Result 882 states and 1238 transitions. [2025-03-16 14:02:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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 149 [2025-03-16 14:02:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:23,051 INFO L225 Difference]: With dead ends: 882 [2025-03-16 14:02:23,051 INFO L226 Difference]: Without dead ends: 873 [2025-03-16 14:02:23,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:23,052 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 32 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:23,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 289 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:02:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-16 14:02:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2025-03-16 14:02:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.4059633027522935) internal successors, (1226), 872 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1226 transitions. [2025-03-16 14:02:23,069 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1226 transitions. Word has length 149 [2025-03-16 14:02:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:23,070 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1226 transitions. [2025-03-16 14:02:23,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-16 14:02:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1226 transitions. [2025-03-16 14:02:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 14:02:23,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:23,072 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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-16 14:02:23,079 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-16 14:02:23,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:23,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:23,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash 387155232, now seen corresponding path program 1 times [2025-03-16 14:02:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-16 14:02:23,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:23,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:02:23,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:02:23,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:23,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-16 14:02:23,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:23,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-16 14:02:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563412460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:23,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429963816] [2025-03-16 14:02:23,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:23,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:23,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:23,456 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-16 14:02:23,458 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-16 14:02:23,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:02:23,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:02:23,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:23,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 14:02:23,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 102 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-16 14:02:23,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-16 14:02:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429963816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:23,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2025-03-16 14:02:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193086714] [2025-03-16 14:02:23,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 14:02:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:23,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 14:02:23,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:02:23,997 INFO L87 Difference]: Start difference. First operand 873 states and 1226 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:24,193 INFO L93 Difference]: Finished difference Result 2059 states and 2860 transitions. [2025-03-16 14:02:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:02:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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 149 [2025-03-16 14:02:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:24,197 INFO L225 Difference]: With dead ends: 2059 [2025-03-16 14:02:24,197 INFO L226 Difference]: Without dead ends: 1284 [2025-03-16 14:02:24,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:02:24,199 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 70 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:24,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 784 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:02:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-03-16 14:02:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2025-03-16 14:02:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1283 states have (on average 1.3452844894777864) internal successors, (1726), 1283 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1726 transitions. [2025-03-16 14:02:24,221 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1726 transitions. Word has length 149 [2025-03-16 14:02:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:24,221 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1726 transitions. [2025-03-16 14:02:24,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1726 transitions. [2025-03-16 14:02:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 14:02:24,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:24,224 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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-16 14:02:24,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:24,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:24,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1607080817, now seen corresponding path program 1 times [2025-03-16 14:02:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:24,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814029216] [2025-03-16 14:02:24,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:24,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:24,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 14:02:24,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:02:24,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:24,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814029216] [2025-03-16 14:02:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814029216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605162295] [2025-03-16 14:02:24,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:24,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:24,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:24,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:24,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:02:24,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 14:02:24,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:02:24,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:24,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:24,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 14:02:24,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-16 14:02:24,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-16 14:02:24,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605162295] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:24,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:24,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 6] total 19 [2025-03-16 14:02:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168016960] [2025-03-16 14:02:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:24,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:24,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:24,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:24,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:02:24,903 INFO L87 Difference]: Start difference. First operand 1284 states and 1726 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-16 14:02:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:25,031 INFO L93 Difference]: Finished difference Result 1327 states and 1786 transitions. [2025-03-16 14:02:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:25,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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 150 [2025-03-16 14:02:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:25,035 INFO L225 Difference]: With dead ends: 1327 [2025-03-16 14:02:25,035 INFO L226 Difference]: Without dead ends: 1299 [2025-03-16 14:02:25,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:02:25,036 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:25,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-16 14:02:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1299. [2025-03-16 14:02:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1298 states have (on average 1.3428351309707243) internal successors, (1743), 1298 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1743 transitions. [2025-03-16 14:02:25,059 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1743 transitions. Word has length 150 [2025-03-16 14:02:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:25,059 INFO L471 AbstractCegarLoop]: Abstraction has 1299 states and 1743 transitions. [2025-03-16 14:02:25,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-16 14:02:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1743 transitions. [2025-03-16 14:02:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 14:02:25,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:25,061 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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-16 14:02:25,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:25,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:25,266 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:25,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash 538293731, now seen corresponding path program 1 times [2025-03-16 14:02:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472292089] [2025-03-16 14:02:25,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:25,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:25,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 14:02:25,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:02:25,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:25,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472292089] [2025-03-16 14:02:25,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472292089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663057042] [2025-03-16 14:02:25,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:25,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:25,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:25,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:25,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 14:02:25,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 14:02:25,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:02:25,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:25,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:25,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 14:02:25,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-16 14:02:25,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-16 14:02:25,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663057042] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:25,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 6] total 17 [2025-03-16 14:02:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213765866] [2025-03-16 14:02:25,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:25,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:02:25,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:25,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:02:25,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:25,690 INFO L87 Difference]: Start difference. First operand 1299 states and 1743 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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-16 14:02:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:25,742 INFO L93 Difference]: Finished difference Result 1379 states and 1863 transitions. [2025-03-16 14:02:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:02:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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 150 [2025-03-16 14:02:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:25,746 INFO L225 Difference]: With dead ends: 1379 [2025-03-16 14:02:25,746 INFO L226 Difference]: Without dead ends: 1303 [2025-03-16 14:02:25,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:25,748 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:25,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 203 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-16 14:02:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2025-03-16 14:02:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1302 states have (on average 1.3433179723502304) internal successors, (1749), 1302 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1749 transitions. [2025-03-16 14:02:25,768 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1749 transitions. Word has length 150 [2025-03-16 14:02:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:25,768 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1749 transitions. [2025-03-16 14:02:25,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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-16 14:02:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1749 transitions. [2025-03-16 14:02:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 14:02:25,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:25,770 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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-16 14:02:25,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:25,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 14:02:25,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:25,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1212665974, now seen corresponding path program 1 times [2025-03-16 14:02:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033140337] [2025-03-16 14:02:25,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:25,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:25,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 14:02:26,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:02:26,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:26,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 99 proven. 9 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-16 14:02:26,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033140337] [2025-03-16 14:02:26,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033140337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:26,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625727019] [2025-03-16 14:02:26,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:26,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:26,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:26,123 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:26,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 14:02:26,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 14:02:26,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:02:26,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:26,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:26,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 14:02:26,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 99 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-16 14:02:26,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 171 proven. 9 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-16 14:02:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625727019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:26,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2025-03-16 14:02:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139039069] [2025-03-16 14:02:26,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:26,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 14:02:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:26,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 14:02:26,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:02:26,644 INFO L87 Difference]: Start difference. First operand 1303 states and 1749 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:26,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:26,817 INFO L93 Difference]: Finished difference Result 2970 states and 3946 transitions. [2025-03-16 14:02:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:02:26,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-16 14:02:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:26,821 INFO L225 Difference]: With dead ends: 2970 [2025-03-16 14:02:26,822 INFO L226 Difference]: Without dead ends: 1752 [2025-03-16 14:02:26,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:02:26,823 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 81 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:26,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 582 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:02:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-03-16 14:02:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2025-03-16 14:02:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 1.3015419760137064) internal successors, (2279), 1751 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2279 transitions. [2025-03-16 14:02:26,853 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2279 transitions. Word has length 150 [2025-03-16 14:02:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:26,853 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2279 transitions. [2025-03-16 14:02:26,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2279 transitions. [2025-03-16 14:02:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 14:02:26,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:26,856 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 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] [2025-03-16 14:02:26,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 14:02:27,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:27,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:27,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:27,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1076633314, now seen corresponding path program 2 times [2025-03-16 14:02:27,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:27,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038016934] [2025-03-16 14:02:27,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:27,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:27,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-16 14:02:27,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:02:27,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:27,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038016934] [2025-03-16 14:02:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038016934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309618367] [2025-03-16 14:02:27,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:27,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:27,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:27,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:27,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 14:02:27,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-16 14:02:27,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 14:02:27,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:27,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:27,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 14:02:27,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-16 14:02:27,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:02:27,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309618367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:27,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:02:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2025-03-16 14:02:27,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978016744] [2025-03-16 14:02:27,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:27,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:27,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:27,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:27,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 14:02:27,446 INFO L87 Difference]: Start difference. First operand 1752 states and 2279 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:27,518 INFO L93 Difference]: Finished difference Result 2923 states and 3868 transitions. [2025-03-16 14:02:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:27,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-16 14:02:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:27,522 INFO L225 Difference]: With dead ends: 2923 [2025-03-16 14:02:27,522 INFO L226 Difference]: Without dead ends: 1754 [2025-03-16 14:02:27,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 14:02:27,524 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:27,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 209 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2025-03-16 14:02:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2025-03-16 14:02:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1753 states have (on average 1.3011979463776384) internal successors, (2281), 1753 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2281 transitions. [2025-03-16 14:02:27,552 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2281 transitions. Word has length 150 [2025-03-16 14:02:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:27,553 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2281 transitions. [2025-03-16 14:02:27,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2281 transitions. [2025-03-16 14:02:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 14:02:27,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:27,555 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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-16 14:02:27,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:27,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 14:02:27,759 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:27,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash 749743176, now seen corresponding path program 1 times [2025-03-16 14:02:27,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:27,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256822199] [2025-03-16 14:02:27,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:27,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:02:27,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:02:27,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:27,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256822199] [2025-03-16 14:02:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256822199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666727145] [2025-03-16 14:02:28,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:28,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:28,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:28,044 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:28,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 14:02:28,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:02:28,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:02:28,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:28,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:28,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 14:02:28,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-16 14:02:28,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-16 14:02:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666727145] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:28,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:28,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12, 5] total 17 [2025-03-16 14:02:28,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499218895] [2025-03-16 14:02:28,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:28,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:28,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:28,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:28,184 INFO L87 Difference]: Start difference. First operand 1754 states and 2281 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:28,308 INFO L93 Difference]: Finished difference Result 1775 states and 2306 transitions. [2025-03-16 14:02:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-03-16 14:02:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:28,313 INFO L225 Difference]: With dead ends: 1775 [2025-03-16 14:02:28,313 INFO L226 Difference]: Without dead ends: 1748 [2025-03-16 14:02:28,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-16 14:02:28,314 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:28,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2025-03-16 14:02:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748. [2025-03-16 14:02:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.299942759015455) internal successors, (2271), 1747 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2271 transitions. [2025-03-16 14:02:28,340 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2271 transitions. Word has length 151 [2025-03-16 14:02:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:28,341 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2271 transitions. [2025-03-16 14:02:28,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2271 transitions. [2025-03-16 14:02:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 14:02:28,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:28,344 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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-16 14:02:28,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:28,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:02:28,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:28,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1846850124, now seen corresponding path program 1 times [2025-03-16 14:02:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384588570] [2025-03-16 14:02:28,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:28,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:02:28,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:02:28,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:28,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:28,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384588570] [2025-03-16 14:02:28,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384588570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454435917] [2025-03-16 14:02:28,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:28,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:28,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:28,808 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:28,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 14:02:28,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:02:28,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:02:28,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:28,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:28,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 14:02:28,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-16 14:02:28,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-16 14:02:28,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454435917] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:28,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:28,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 6] total 19 [2025-03-16 14:02:28,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960364951] [2025-03-16 14:02:28,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:28,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:28,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:28,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:02:28,972 INFO L87 Difference]: Start difference. First operand 1748 states and 2271 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:29,172 INFO L93 Difference]: Finished difference Result 1902 states and 2498 transitions. [2025-03-16 14:02:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-03-16 14:02:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:29,176 INFO L225 Difference]: With dead ends: 1902 [2025-03-16 14:02:29,176 INFO L226 Difference]: Without dead ends: 1756 [2025-03-16 14:02:29,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:02:29,177 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:29,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 379 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:02:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2025-03-16 14:02:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1756. [2025-03-16 14:02:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1755 states have (on average 1.2997150997150997) internal successors, (2281), 1755 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2281 transitions. [2025-03-16 14:02:29,204 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2281 transitions. Word has length 151 [2025-03-16 14:02:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:29,205 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2281 transitions. [2025-03-16 14:02:29,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2281 transitions. [2025-03-16 14:02:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 14:02:29,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:29,207 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 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-16 14:02:29,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 14:02:29,408 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:29,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash -382062253, now seen corresponding path program 1 times [2025-03-16 14:02:29,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:29,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569226938] [2025-03-16 14:02:29,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:29,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:29,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:02:29,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:02:29,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:29,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:29,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569226938] [2025-03-16 14:02:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569226938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:29,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45746308] [2025-03-16 14:02:29,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:29,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:29,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:29,642 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:29,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 14:02:29,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:02:29,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:02:29,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:29,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:29,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 14:02:29,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 37 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:30,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 56 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45746308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:30,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:30,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 39 [2025-03-16 14:02:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087298625] [2025-03-16 14:02:30,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:30,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 14:02:30,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:30,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 14:02:30,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1067, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 14:02:30,839 INFO L87 Difference]: Start difference. First operand 1756 states and 2281 transitions. Second operand has 39 states, 39 states have (on average 10.0) internal successors, (390), 39 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:40,636 INFO L93 Difference]: Finished difference Result 3428 states and 4500 transitions. [2025-03-16 14:02:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-16 14:02:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.0) internal successors, (390), 39 states have internal predecessors, (390), 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 151 [2025-03-16 14:02:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:40,642 INFO L225 Difference]: With dead ends: 3428 [2025-03-16 14:02:40,642 INFO L226 Difference]: Without dead ends: 3114 [2025-03-16 14:02:40,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2134, Invalid=4186, Unknown=0, NotChecked=0, Total=6320 [2025-03-16 14:02:40,644 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 2958 mSDsluCounter, 3855 mSDsCounter, 0 mSdLazyCounter, 4739 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 4812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:40,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2958 Valid, 4139 Invalid, 4812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4739 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 14:02:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2025-03-16 14:02:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2287. [2025-03-16 14:02:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 2286 states have (on average 1.2944006999125108) internal successors, (2959), 2286 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2959 transitions. [2025-03-16 14:02:40,675 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2959 transitions. Word has length 151 [2025-03-16 14:02:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:40,676 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 2959 transitions. [2025-03-16 14:02:40,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.0) internal successors, (390), 39 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2959 transitions. [2025-03-16 14:02:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 14:02:40,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:40,679 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 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-16 14:02:40,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:40,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 14:02:40,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:40,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1972868259, now seen corresponding path program 2 times [2025-03-16 14:02:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-03-16 14:02:40,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:40,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 187 statements into 2 equivalence classes. [2025-03-16 14:02:40,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:02:40,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:40,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:41,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-03-16 14:02:41,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208791508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473234977] [2025-03-16 14:02:41,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:41,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:41,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:41,259 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:41,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-16 14:02:41,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 187 statements into 2 equivalence classes. [2025-03-16 14:02:41,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:02:41,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:41,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:41,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:02:41,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2025-03-16 14:02:41,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:02:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473234977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:41,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:02:41,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-16 14:02:41,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12775077] [2025-03-16 14:02:41,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:41,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:41,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:41,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-16 14:02:41,409 INFO L87 Difference]: Start difference. First operand 2287 states and 2959 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:41,518 INFO L93 Difference]: Finished difference Result 4208 states and 5583 transitions. [2025-03-16 14:02:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2025-03-16 14:02:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:41,524 INFO L225 Difference]: With dead ends: 4208 [2025-03-16 14:02:41,524 INFO L226 Difference]: Without dead ends: 2688 [2025-03-16 14:02:41,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-16 14:02:41,526 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 44 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:41,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 421 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2025-03-16 14:02:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2334. [2025-03-16 14:02:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 2333 states have (on average 1.3086155165023574) internal successors, (3053), 2333 states have internal predecessors, (3053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3053 transitions. [2025-03-16 14:02:41,563 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3053 transitions. Word has length 187 [2025-03-16 14:02:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:41,563 INFO L471 AbstractCegarLoop]: Abstraction has 2334 states and 3053 transitions. [2025-03-16 14:02:41,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3053 transitions. [2025-03-16 14:02:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 14:02:41,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:41,567 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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-16 14:02:41,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-16 14:02:41,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:41,768 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:41,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1866448187, now seen corresponding path program 1 times [2025-03-16 14:02:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:41,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954014105] [2025-03-16 14:02:41,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:41,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:41,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 14:02:41,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:02:41,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:41,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954014105] [2025-03-16 14:02:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954014105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:42,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911697425] [2025-03-16 14:02:42,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:42,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:42,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:42,089 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:42,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-16 14:02:42,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 14:02:42,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:02:42,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:42,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:42,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 14:02:42,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2025-03-16 14:02:42,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-03-16 14:02:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911697425] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:42,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15, 6] total 22 [2025-03-16 14:02:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727882739] [2025-03-16 14:02:42,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:42,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:42,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:42,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-16 14:02:42,268 INFO L87 Difference]: Start difference. First operand 2334 states and 3053 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:42,393 INFO L93 Difference]: Finished difference Result 2418 states and 3171 transitions. [2025-03-16 14:02:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-03-16 14:02:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:42,398 INFO L225 Difference]: With dead ends: 2418 [2025-03-16 14:02:42,398 INFO L226 Difference]: Without dead ends: 2349 [2025-03-16 14:02:42,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-16 14:02:42,399 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:42,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-16 14:02:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2349. [2025-03-16 14:02:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 2348 states have (on average 1.307495741056218) internal successors, (3070), 2348 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3070 transitions. [2025-03-16 14:02:42,430 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3070 transitions. Word has length 188 [2025-03-16 14:02:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:42,431 INFO L471 AbstractCegarLoop]: Abstraction has 2349 states and 3070 transitions. [2025-03-16 14:02:42,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3070 transitions. [2025-03-16 14:02:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 14:02:42,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:42,434 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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-16 14:02:42,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:42,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 14:02:42,639 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1124141532, now seen corresponding path program 1 times [2025-03-16 14:02:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538492570] [2025-03-16 14:02:42,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:42,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 14:02:42,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:02:42,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:42,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:42,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:42,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538492570] [2025-03-16 14:02:42,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538492570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:42,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630001697] [2025-03-16 14:02:42,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:42,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:42,928 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:42,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-16 14:02:42,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 14:02:43,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:02:43,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:43,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:43,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:02:43,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-03-16 14:02:43,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:02:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630001697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:43,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:02:43,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2025-03-16 14:02:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406913021] [2025-03-16 14:02:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:43,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:43,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:43,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-16 14:02:43,033 INFO L87 Difference]: Start difference. First operand 2349 states and 3070 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:43,172 INFO L93 Difference]: Finished difference Result 2506 states and 3294 transitions. [2025-03-16 14:02:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:43,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-03-16 14:02:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:43,177 INFO L225 Difference]: With dead ends: 2506 [2025-03-16 14:02:43,177 INFO L226 Difference]: Without dead ends: 2347 [2025-03-16 14:02:43,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-16 14:02:43,178 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:43,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2025-03-16 14:02:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2347. [2025-03-16 14:02:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 2346 states have (on average 1.3069053708439897) internal successors, (3066), 2346 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3066 transitions. [2025-03-16 14:02:43,218 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3066 transitions. Word has length 188 [2025-03-16 14:02:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:43,218 INFO L471 AbstractCegarLoop]: Abstraction has 2347 states and 3066 transitions. [2025-03-16 14:02:43,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3066 transitions. [2025-03-16 14:02:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 14:02:43,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:43,221 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:43,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:43,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:43,423 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:43,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash 271030323, now seen corresponding path program 2 times [2025-03-16 14:02:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:43,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888227146] [2025-03-16 14:02:43,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:43,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-16 14:02:43,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:02:43,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:43,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888227146] [2025-03-16 14:02:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888227146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481074757] [2025-03-16 14:02:43,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:43,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:43,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:43,768 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:43,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-16 14:02:43,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-16 14:02:43,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 14:02:43,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:43,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:43,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 14:02:43,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:43,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481074757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:44,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:02:44,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2025-03-16 14:02:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914461809] [2025-03-16 14:02:44,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:44,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 14:02:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:44,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 14:02:44,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2025-03-16 14:02:44,328 INFO L87 Difference]: Start difference. First operand 2347 states and 3066 transitions. Second operand has 31 states, 31 states have (on average 11.290322580645162) internal successors, (350), 30 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:45,286 INFO L93 Difference]: Finished difference Result 3199 states and 4241 transitions. [2025-03-16 14:02:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 14:02:45,290 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.290322580645162) internal successors, (350), 30 states have internal predecessors, (350), 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 188 [2025-03-16 14:02:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:45,297 INFO L225 Difference]: With dead ends: 3199 [2025-03-16 14:02:45,297 INFO L226 Difference]: Without dead ends: 2984 [2025-03-16 14:02:45,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2025-03-16 14:02:45,299 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 1532 mSDsluCounter, 4282 mSDsCounter, 0 mSdLazyCounter, 3590 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 4584 SdHoareTripleChecker+Invalid, 3591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:45,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 4584 Invalid, 3591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:02:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2025-03-16 14:02:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2878. [2025-03-16 14:02:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2877 states have (on average 1.3034410844629822) internal successors, (3750), 2877 states have internal predecessors, (3750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3750 transitions. [2025-03-16 14:02:45,335 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3750 transitions. Word has length 188 [2025-03-16 14:02:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:45,335 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 3750 transitions. [2025-03-16 14:02:45,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.290322580645162) internal successors, (350), 30 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3750 transitions. [2025-03-16 14:02:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 14:02:45,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:45,342 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:45,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:45,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:45,542 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:45,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1495004068, now seen corresponding path program 3 times [2025-03-16 14:02:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198577058] [2025-03-16 14:02:45,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 14:02:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:45,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 224 statements into 17 equivalence classes. [2025-03-16 14:02:45,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 224 statements. [2025-03-16 14:02:45,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 14:02:45,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2025-03-16 14:02:45,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:45,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198577058] [2025-03-16 14:02:45,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198577058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:45,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:45,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392568760] [2025-03-16 14:02:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:45,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:45,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:45,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:45,654 INFO L87 Difference]: Start difference. First operand 2878 states and 3750 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:45,800 INFO L93 Difference]: Finished difference Result 3093 states and 4064 transitions. [2025-03-16 14:02:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:45,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 224 [2025-03-16 14:02:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:45,808 INFO L225 Difference]: With dead ends: 3093 [2025-03-16 14:02:45,809 INFO L226 Difference]: Without dead ends: 2958 [2025-03-16 14:02:45,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:45,810 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:45,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 385 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2025-03-16 14:02:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2954. [2025-03-16 14:02:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2953 states have (on average 1.3071452759905182) internal successors, (3860), 2953 states have internal predecessors, (3860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3860 transitions. [2025-03-16 14:02:45,865 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3860 transitions. Word has length 224 [2025-03-16 14:02:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:45,867 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 3860 transitions. [2025-03-16 14:02:45,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3860 transitions. [2025-03-16 14:02:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 14:02:45,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:45,872 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 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] [2025-03-16 14:02:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:02:45,873 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1560686498, now seen corresponding path program 1 times [2025-03-16 14:02:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484412131] [2025-03-16 14:02:45,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 14:02:45,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 14:02:45,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:45,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-03-16 14:02:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:46,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484412131] [2025-03-16 14:02:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484412131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:46,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:46,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 14:02:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788331191] [2025-03-16 14:02:46,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:46,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:02:46,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:46,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:02:46,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:02:46,290 INFO L87 Difference]: Start difference. First operand 2954 states and 3860 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:46,425 INFO L93 Difference]: Finished difference Result 5512 states and 7249 transitions. [2025-03-16 14:02:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:02:46,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2025-03-16 14:02:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:46,430 INFO L225 Difference]: With dead ends: 5512 [2025-03-16 14:02:46,430 INFO L226 Difference]: Without dead ends: 3204 [2025-03-16 14:02:46,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:02:46,432 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 48 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:46,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 454 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2025-03-16 14:02:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 3046. [2025-03-16 14:02:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3046 states, 3045 states have (on average 1.2883415435139574) internal successors, (3923), 3045 states have internal predecessors, (3923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 3923 transitions. [2025-03-16 14:02:46,468 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 3923 transitions. Word has length 224 [2025-03-16 14:02:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:46,469 INFO L471 AbstractCegarLoop]: Abstraction has 3046 states and 3923 transitions. [2025-03-16 14:02:46,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 3923 transitions. [2025-03-16 14:02:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 14:02:46,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:46,472 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 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-16 14:02:46,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 14:02:46,472 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:46,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash 669065925, now seen corresponding path program 1 times [2025-03-16 14:02:46,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:46,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793590464] [2025-03-16 14:02:46,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:46,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 14:02:46,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 14:02:46,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:46,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-16 14:02:46,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:46,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793590464] [2025-03-16 14:02:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793590464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:02:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883706182] [2025-03-16 14:02:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:46,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:46,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:46,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:46,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:02:46,719 INFO L87 Difference]: Start difference. First operand 3046 states and 3923 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:47,151 INFO L93 Difference]: Finished difference Result 3289 states and 4271 transitions. [2025-03-16 14:02:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:47,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 225 [2025-03-16 14:02:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:47,155 INFO L225 Difference]: With dead ends: 3289 [2025-03-16 14:02:47,155 INFO L226 Difference]: Without dead ends: 3058 [2025-03-16 14:02:47,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:02:47,156 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:47,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:02:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2025-03-16 14:02:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3058. [2025-03-16 14:02:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3057 states have (on average 1.287209682695453) internal successors, (3935), 3057 states have internal predecessors, (3935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 3935 transitions. [2025-03-16 14:02:47,183 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 3935 transitions. Word has length 225 [2025-03-16 14:02:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:47,184 INFO L471 AbstractCegarLoop]: Abstraction has 3058 states and 3935 transitions. [2025-03-16 14:02:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 3935 transitions. [2025-03-16 14:02:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 14:02:47,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:47,186 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 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-16 14:02:47,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 14:02:47,186 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:47,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1581867560, now seen corresponding path program 1 times [2025-03-16 14:02:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:47,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986627205] [2025-03-16 14:02:47,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:47,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 14:02:47,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 14:02:47,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:47,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-16 14:02:47,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:47,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986627205] [2025-03-16 14:02:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986627205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:47,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068242270] [2025-03-16 14:02:47,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:47,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:47,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:47,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:47,327 INFO L87 Difference]: Start difference. First operand 3058 states and 3935 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:47,444 INFO L93 Difference]: Finished difference Result 3122 states and 4022 transitions. [2025-03-16 14:02:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:47,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 225 [2025-03-16 14:02:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:47,448 INFO L225 Difference]: With dead ends: 3122 [2025-03-16 14:02:47,448 INFO L226 Difference]: Without dead ends: 3052 [2025-03-16 14:02:47,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:47,449 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:47,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-03-16 14:02:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 3052. [2025-03-16 14:02:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3052 states, 3051 states have (on average 1.2864634546050475) internal successors, (3925), 3051 states have internal predecessors, (3925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 3925 transitions. [2025-03-16 14:02:47,480 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 3925 transitions. Word has length 225 [2025-03-16 14:02:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:47,480 INFO L471 AbstractCegarLoop]: Abstraction has 3052 states and 3925 transitions. [2025-03-16 14:02:47,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 3925 transitions. [2025-03-16 14:02:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 14:02:47,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:47,482 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 14:02:47,483 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:47,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1013720486, now seen corresponding path program 2 times [2025-03-16 14:02:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:47,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785316453] [2025-03-16 14:02:47,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:47,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 225 statements into 2 equivalence classes. [2025-03-16 14:02:47,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 14:02:47,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:47,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2025-03-16 14:02:47,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785316453] [2025-03-16 14:02:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785316453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162786304] [2025-03-16 14:02:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:47,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:47,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:47,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:47,708 INFO L87 Difference]: Start difference. First operand 3052 states and 3925 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:48,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 14:02:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:48,892 INFO L93 Difference]: Finished difference Result 3346 states and 4346 transitions. [2025-03-16 14:02:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:48,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 225 [2025-03-16 14:02:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:48,896 INFO L225 Difference]: With dead ends: 3346 [2025-03-16 14:02:48,896 INFO L226 Difference]: Without dead ends: 3061 [2025-03-16 14:02:48,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:48,897 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 16 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:48,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 316 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 14:02:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2025-03-16 14:02:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3058. [2025-03-16 14:02:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3057 states have (on average 1.2852469741576709) internal successors, (3929), 3057 states have internal predecessors, (3929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 3929 transitions. [2025-03-16 14:02:48,929 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 3929 transitions. Word has length 225 [2025-03-16 14:02:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:48,929 INFO L471 AbstractCegarLoop]: Abstraction has 3058 states and 3929 transitions. [2025-03-16 14:02:48,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 3929 transitions. [2025-03-16 14:02:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 14:02:48,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:48,932 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 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-16 14:02:48,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 14:02:48,932 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:48,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash 536824049, now seen corresponding path program 1 times [2025-03-16 14:02:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700045625] [2025-03-16 14:02:48,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:48,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:02:49,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:02:49,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:49,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-16 14:02:49,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:49,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700045625] [2025-03-16 14:02:49,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700045625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:49,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:49,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:02:49,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539886555] [2025-03-16 14:02:49,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:49,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:49,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:49,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:02:49,177 INFO L87 Difference]: Start difference. First operand 3058 states and 3929 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:49,280 INFO L93 Difference]: Finished difference Result 3179 states and 4098 transitions. [2025-03-16 14:02:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:49,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 226 [2025-03-16 14:02:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:49,283 INFO L225 Difference]: With dead ends: 3179 [2025-03-16 14:02:49,283 INFO L226 Difference]: Without dead ends: 3067 [2025-03-16 14:02:49,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:02:49,284 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:49,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2025-03-16 14:02:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3067. [2025-03-16 14:02:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 3066 states have (on average 1.283757338551859) internal successors, (3936), 3066 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 3936 transitions. [2025-03-16 14:02:49,314 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 3936 transitions. Word has length 226 [2025-03-16 14:02:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:49,314 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 3936 transitions. [2025-03-16 14:02:49,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 3936 transitions. [2025-03-16 14:02:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 14:02:49,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:49,317 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:49,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 14:02:49,317 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:49,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1818433316, now seen corresponding path program 1 times [2025-03-16 14:02:49,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:49,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611415485] [2025-03-16 14:02:49,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:49,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:49,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:02:49,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:02:49,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:49,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-16 14:02:49,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:49,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611415485] [2025-03-16 14:02:49,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611415485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:49,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:49,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454120911] [2025-03-16 14:02:49,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:49,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:49,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:49,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:49,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:49,421 INFO L87 Difference]: Start difference. First operand 3067 states and 3936 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:49,554 INFO L93 Difference]: Finished difference Result 3111 states and 3984 transitions. [2025-03-16 14:02:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:49,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 226 [2025-03-16 14:02:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:49,557 INFO L225 Difference]: With dead ends: 3111 [2025-03-16 14:02:49,557 INFO L226 Difference]: Without dead ends: 3071 [2025-03-16 14:02:49,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:49,558 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 4 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:49,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 268 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2025-03-16 14:02:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3070. [2025-03-16 14:02:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 3069 states have (on average 1.2834799608993157) internal successors, (3939), 3069 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3939 transitions. [2025-03-16 14:02:49,588 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3939 transitions. Word has length 226 [2025-03-16 14:02:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:49,588 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3939 transitions. [2025-03-16 14:02:49,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3939 transitions. [2025-03-16 14:02:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 14:02:49,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:49,591 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 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-16 14:02:49,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 14:02:49,591 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:49,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1499499050, now seen corresponding path program 1 times [2025-03-16 14:02:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178939731] [2025-03-16 14:02:49,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:49,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 14:02:49,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 14:02:49,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:49,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-16 14:02:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:49,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178939731] [2025-03-16 14:02:49,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178939731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:49,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:49,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:02:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140083844] [2025-03-16 14:02:49,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:49,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:49,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:49,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:02:49,770 INFO L87 Difference]: Start difference. First operand 3070 states and 3939 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:50,641 INFO L93 Difference]: Finished difference Result 3359 states and 4343 transitions. [2025-03-16 14:02:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:50,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 227 [2025-03-16 14:02:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:50,644 INFO L225 Difference]: With dead ends: 3359 [2025-03-16 14:02:50,644 INFO L226 Difference]: Without dead ends: 3082 [2025-03-16 14:02:50,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:02:50,645 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:50,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:02:50,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2025-03-16 14:02:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3082. [2025-03-16 14:02:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 3081 states have (on average 1.2823758519961053) internal successors, (3951), 3081 states have internal predecessors, (3951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 3951 transitions. [2025-03-16 14:02:50,677 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 3951 transitions. Word has length 227 [2025-03-16 14:02:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:50,677 INFO L471 AbstractCegarLoop]: Abstraction has 3082 states and 3951 transitions. [2025-03-16 14:02:50,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 3951 transitions. [2025-03-16 14:02:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 14:02:50,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:50,680 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:50,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 14:02:50,680 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:50,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1617553920, now seen corresponding path program 1 times [2025-03-16 14:02:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:50,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065275633] [2025-03-16 14:02:50,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:50,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 14:02:50,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 14:02:50,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:50,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 76 proven. 16 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2025-03-16 14:02:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:50,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065275633] [2025-03-16 14:02:50,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065275633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:02:50,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180045133] [2025-03-16 14:02:50,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:50,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:50,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:50,982 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:50,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-16 14:02:51,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 14:02:51,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 14:02:51,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:51,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:51,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 14:02:51,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-16 14:02:51,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:02:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180045133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:51,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:02:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-16 14:02:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259452033] [2025-03-16 14:02:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:02:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:51,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:02:51,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:02:51,115 INFO L87 Difference]: Start difference. First operand 3082 states and 3951 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:51,249 INFO L93 Difference]: Finished difference Result 3202 states and 4115 transitions. [2025-03-16 14:02:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:02:51,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 227 [2025-03-16 14:02:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:51,251 INFO L225 Difference]: With dead ends: 3202 [2025-03-16 14:02:51,251 INFO L226 Difference]: Without dead ends: 3098 [2025-03-16 14:02:51,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:02:51,252 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:51,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 378 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2025-03-16 14:02:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3094. [2025-03-16 14:02:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 3093 states have (on average 1.2812803103782735) internal successors, (3963), 3093 states have internal predecessors, (3963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 3963 transitions. [2025-03-16 14:02:51,288 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 3963 transitions. Word has length 227 [2025-03-16 14:02:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:51,288 INFO L471 AbstractCegarLoop]: Abstraction has 3094 states and 3963 transitions. [2025-03-16 14:02:51,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3963 transitions. [2025-03-16 14:02:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 14:02:51,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:51,291 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:51,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:51,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 14:02:51,492 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:51,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1163187135, now seen corresponding path program 1 times [2025-03-16 14:02:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:51,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541248850] [2025-03-16 14:02:51,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:51,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 14:02:51,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 14:02:51,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:51,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-16 14:02:51,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:02:51,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541248850] [2025-03-16 14:02:51,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541248850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:51,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:51,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:02:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925061685] [2025-03-16 14:02:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:51,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:02:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:02:51,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:02:51,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:51,615 INFO L87 Difference]: Start difference. First operand 3094 states and 3963 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:51,708 INFO L93 Difference]: Finished difference Result 3216 states and 4112 transitions. [2025-03-16 14:02:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:02:51,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 227 [2025-03-16 14:02:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:51,710 INFO L225 Difference]: With dead ends: 3216 [2025-03-16 14:02:51,710 INFO L226 Difference]: Without dead ends: 3095 [2025-03-16 14:02:51,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:02:51,711 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:51,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 266 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2025-03-16 14:02:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3095. [2025-03-16 14:02:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 3094 states have (on average 1.2808661926308984) internal successors, (3963), 3094 states have internal predecessors, (3963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 3963 transitions. [2025-03-16 14:02:51,742 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 3963 transitions. Word has length 227 [2025-03-16 14:02:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 3963 transitions. [2025-03-16 14:02:51,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 3963 transitions. [2025-03-16 14:02:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-16 14:02:51,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:51,745 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:51,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 14:02:51,745 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:51,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1324667928, now seen corresponding path program 1 times [2025-03-16 14:02:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:02:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813625760] [2025-03-16 14:02:51,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:02:51,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 14:02:51,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 14:02:51,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:51,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:02:51,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 14:02:51,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 14:02:51,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 14:02:51,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:51,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 14:02:51,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 14:02:51,926 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 14:02:51,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:02:51,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 14:02:51,930 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:02:51,987 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:02:51,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:02:51 BoogieIcfgContainer [2025-03-16 14:02:51,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:02:51,992 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:02:51,992 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:02:51,992 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:02:51,993 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:16" (3/4) ... [2025-03-16 14:02:51,994 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 14:02:51,995 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:02:51,996 INFO L158 Benchmark]: Toolchain (without parser) took 37340.85ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 106.6MB in the beginning and 346.5MB in the end (delta: -239.9MB). Peak memory consumption was 267.0MB. Max. memory is 16.1GB. [2025-03-16 14:02:51,996 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:02:51,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.20ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.6MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:02:51,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.52ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.6MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:02:51,997 INFO L158 Benchmark]: Boogie Preprocessor took 30.16ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:02:51,997 INFO L158 Benchmark]: IcfgBuilder took 1163.13ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 61.0MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:02:51,997 INFO L158 Benchmark]: TraceAbstraction took 35957.47ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 60.1MB in the beginning and 346.7MB in the end (delta: -286.6MB). Peak memory consumption was 216.7MB. Max. memory is 16.1GB. [2025-03-16 14:02:51,997 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 645.9MB. Free memory was 346.7MB in the beginning and 346.5MB in the end (delta: 203.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:02:51,997 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.20ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.6MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.52ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.6MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.16ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1163.13ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 61.0MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35957.47ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 60.1MB in the beginning and 346.7MB in the end (delta: -286.6MB). Peak memory consumption was 216.7MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 645.9MB. Free memory was 346.7MB in the beginning and 346.5MB in the end (delta: 203.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseAnd at line 59. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=0, z=0] [L50] EXPR 1U << i VAL [i=0, z=0] [L50] EXPR x & (1U << i) VAL [i=0, x=0, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=0, x=0, z=0] [L50] EXPR 1U << i VAL [i=0, x=0, z=0] [L50] EXPR y & (1U << i) VAL [i=0, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=0, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=0, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=1, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=1, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=1, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=1, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=1, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=2, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=2, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=2, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=2, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=2, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=3, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=3, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=3, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=3, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=3, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=4, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=4, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=4, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=4, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=4, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=5, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=5, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=5, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=5, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=5, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=6, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=6, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=6, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=6, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=6, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=7, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=7, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=7, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=7, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=7, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=8, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=8, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=8, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=8, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=8, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=9, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=9, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=9, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=9, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=9, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=10, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=10, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=10, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=10, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=10, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=11, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=11, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=11, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=11, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=11, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=12, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=12, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=12, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=12, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=12, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=13, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=13, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=13, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=13, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=13, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=14, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=14, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=14, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=14, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=14, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=15, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=15, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=15, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=15, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=15, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, x=0, y=1, z=4294967297] [L49] COND FALSE !(i < sizeof(x) * 8) [L53] xx = x [L54] yy = y VAL [xx=0, yy=1, z=4294967297] [L55] EXPR xx | (xx << 8u) VAL [yy=1, z=4294967297] [L55] EXPR (xx | (xx << 8u)) & 16711935U VAL [yy=1, z=4294967297] [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] EXPR xx | (xx << 4u) VAL [yy=1, z=4294967297] [L56] EXPR (xx | (xx << 4u)) & 252645135U VAL [yy=1, z=4294967297] [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] EXPR xx | (xx << 2u) VAL [yy=1, z=4294967297] [L57] EXPR (xx | (xx << 2u)) & 858993459U VAL [yy=1, z=4294967297] [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] EXPR xx | (xx << 1u) VAL [yy=1, z=4294967297] [L58] EXPR (xx | (xx << 1u)) & 1431655765U VAL [yy=1, z=4294967297] [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] EXPR yy | (yy << 8u) VAL [xx=0, z=4294967297] [L59] EXPR (yy | (yy << 8u)) & 16711935U VAL [xx=0, z=4294967297] [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] EXPR yy | (yy << 4u) VAL [xx=0, z=4294967297] [L60] EXPR (yy | (yy << 4u)) & 252645135U VAL [xx=0, z=4294967297] [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] EXPR yy | (yy << 2u) VAL [xx=0, z=4294967297] [L61] EXPR (yy | (yy << 2u)) & 858993459U VAL [xx=0, z=4294967297] [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] EXPR yy | (yy << 1u) VAL [xx=0, z=4294967297] [L62] EXPR (yy | (yy << 1u)) & 1431655765U VAL [xx=0, z=4294967297] [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] EXPR xx | (yy << 1U) VAL [z=4294967297] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 136 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.9s, OverallIterations: 31, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5962 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5962 mSDsluCounter, 20309 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16666 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13135 IncrementalHoareTripleChecker+Invalid, 13273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 3643 mSDtfsCounter, 13135 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4870 GetRequests, 4506 SyntacticMatches, 0 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2656 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3095occurred in iteration=30, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 1476 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 7920 NumberOfCodeBlocks, 7634 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 9546 ConstructedInterpolants, 0 QuantifiedInterpolants, 22756 SizeOfPredicates, 17 NumberOfNonLiveVariables, 6905 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 62 InterpolantComputations, 23 PerfectInterpolantSequences, 30430/41865 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 14:02:52,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:02:53,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:02:53,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 14:02:53,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:02:53,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:02:53,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:02:53,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:02:53,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:02:53,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:02:53,898 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:02:53,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:02:53,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:02:53,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:02:53,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:02:53,899 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:02:53,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:02:53,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:02:53,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:02:53,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:02:53,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:02:53,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:02:53,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:02:53,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:02:53,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 14:02:53,901 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 14:02:53,902 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 14:02:53,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:02:53,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:02:53,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:02:53,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:02:53,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:02:53,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:02:53,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:53,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:02:53,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:02:53,903 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-03-16 14:02:54,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:02:54,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:02:54,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:02:54,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:02:54,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:02:54,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-16 14:02:55,276 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96390be37/cc8c0b60b11a4da9b50922d45a15a1da/FLAGfeab135e9 [2025-03-16 14:02:55,415 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:02:55,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-16 14:02:55,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96390be37/cc8c0b60b11a4da9b50922d45a15a1da/FLAGfeab135e9 [2025-03-16 14:02:55,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96390be37/cc8c0b60b11a4da9b50922d45a15a1da [2025-03-16 14:02:55,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:02:55,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:02:55,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:02:55,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:02:55,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:02:55,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:02:55" (1/1) ... [2025-03-16 14:02:55,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16936fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:55, skipping insertion in model container [2025-03-16 14:02:55,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:02:55" (1/1) ... [2025-03-16 14:02:55,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:02:55,928 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/interleave_bits.i[1175,1188] [2025-03-16 14:02:55,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:02:55,961 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:02:55,969 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/interleave_bits.i[1175,1188] [2025-03-16 14:02:55,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:02:56,003 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:02:56,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56 WrapperNode [2025-03-16 14:02:56,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:02:56,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:02:56,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:02:56,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:02:56,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,030 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-03-16 14:02:56,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:02:56,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:02:56,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:02:56,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:02:56,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,046 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:02:56,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:02:56,052 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:02:56,052 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:02:56,052 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:02:56,053 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (1/1) ... [2025-03-16 14:02:56,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:02:56,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:56,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:02:56,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:02:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:02:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 14:02:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:02:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:02:56,143 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:02:56,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:02:56,244 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 14:02:56,244 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:02:56,251 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:02:56,252 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:02:56,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:56 BoogieIcfgContainer [2025-03-16 14:02:56,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:02:56,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:02:56,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:02:56,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:02:56,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:02:55" (1/3) ... [2025-03-16 14:02:56,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120b8bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:02:56, skipping insertion in model container [2025-03-16 14:02:56,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:02:56" (2/3) ... [2025-03-16 14:02:56,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120b8bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:02:56, skipping insertion in model container [2025-03-16 14:02:56,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:56" (3/3) ... [2025-03-16 14:02:56,262 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-03-16 14:02:56,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:02:56,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:02:56,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:02:56,320 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;@2f85050e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:02:56,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:02:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 14:02:56,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:56,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 14:02:56,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:56,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1136958, now seen corresponding path program 1 times [2025-03-16 14:02:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:02:56,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667132297] [2025-03-16 14:02:56,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:56,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:56,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:56,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:56,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:02:56,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 14:02:56,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 14:02:56,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:56,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:56,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:02:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:56,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:02:56,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:02:56,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667132297] [2025-03-16 14:02:56,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667132297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:02:56,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:02:56,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:02:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232282924] [2025-03-16 14:02:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:02:56,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:02:56,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:02:56,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:02:56,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:02:56,467 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:56,484 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-03-16 14:02:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:02:56,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-16 14:02:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:56,492 INFO L225 Difference]: With dead ends: 15 [2025-03-16 14:02:56,493 INFO L226 Difference]: Without dead ends: 6 [2025-03-16 14:02:56,495 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-16 14:02:56,499 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:56,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2025-03-16 14:02:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-03-16 14:02:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2025-03-16 14:02:56,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2025-03-16 14:02:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:56,520 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-03-16 14:02:56,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2025-03-16 14:02:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-16 14:02:56,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:56,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-16 14:02:56,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:02:56,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:56,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:56,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash 35277444, now seen corresponding path program 1 times [2025-03-16 14:02:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:02:56,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695857045] [2025-03-16 14:02:56,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:02:56,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:56,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:56,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:56,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:02:56,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 14:02:56,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 14:02:56,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:02:56,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:56,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:02:56,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:56,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:56,828 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:02:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695857045] [2025-03-16 14:02:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695857045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:56,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:56,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-16 14:02:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389284434] [2025-03-16 14:02:56,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:56,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:02:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:02:56,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:02:56,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:02:56,830 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:56,855 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2025-03-16 14:02:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 14:02:56,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-16 14:02:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:56,856 INFO L225 Difference]: With dead ends: 12 [2025-03-16 14:02:56,856 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 14:02:56,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:02:56,857 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:56,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 14:02:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-16 14:02:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-16 14:02:56,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-16 14:02:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:56,860 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-16 14:02:56,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-16 14:02:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 14:02:56,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:56,860 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2025-03-16 14:02:56,866 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-16 14:02:57,061 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 [2025-03-16 14:02:57,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:57,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1285129538, now seen corresponding path program 2 times [2025-03-16 14:02:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:02:57,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967799153] [2025-03-16 14:02:57,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:02:57,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:57,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:57,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:57,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:02:57,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-16 14:02:57,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 14:02:57,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:02:57,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:57,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:02:57,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:57,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:57,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:02:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967799153] [2025-03-16 14:02:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967799153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:57,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:57,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-16 14:02:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874637311] [2025-03-16 14:02:57,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:57,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 14:02:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:02:57,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 14:02:57,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:02:57,283 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:57,393 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-16 14:02:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 14:02:57,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-16 14:02:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:57,394 INFO L225 Difference]: With dead ends: 18 [2025-03-16 14:02:57,394 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 14:02:57,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-16 14:02:57,395 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:57,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:02:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 14:02:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-16 14:02:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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-16 14:02:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-16 14:02:57,399 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-16 14:02:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:57,399 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-16 14:02:57,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-16 14:02:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 14:02:57,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:57,399 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2025-03-16 14:02:57,405 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-16 14:02:57,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:57,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1273477890, now seen corresponding path program 3 times [2025-03-16 14:02:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:02:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168659436] [2025-03-16 14:02:57,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 14:02:57,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:57,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:02:57,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:02:57,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 6 equivalence classes. [2025-03-16 14:02:57,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 14:02:57,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 14:02:57,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:57,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 14:02:57,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:57,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:02:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:58,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:02:58,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168659436] [2025-03-16 14:02:58,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168659436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:02:58,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:02:58,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-03-16 14:02:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368910088] [2025-03-16 14:02:58,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:02:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 14:02:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:02:58,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 14:02:58,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2025-03-16 14:02:58,069 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:02:58,578 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2025-03-16 14:02:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 14:02:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 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 14 [2025-03-16 14:02:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:02:58,578 INFO L225 Difference]: With dead ends: 30 [2025-03-16 14:02:58,578 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 14:02:58,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=771, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 14:02:58,580 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:02:58,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:02:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 14:02:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 14:02:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 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-16 14:02:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-03-16 14:02:58,584 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2025-03-16 14:02:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:02:58,585 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-03-16 14:02:58,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:02:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-03-16 14:02:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 14:02:58,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:02:58,585 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2025-03-16 14:02:58,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:02:58,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:58,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:02:58,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:02:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1873191106, now seen corresponding path program 4 times [2025-03-16 14:02:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 14:02:58,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154436856] [2025-03-16 14:02:58,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 14:02:58,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:02:58,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:02:58,788 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-16 14:02:58,790 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-16 14:02:58,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-16 14:02:58,850 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 14:02:58,850 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 14:02:58,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:02:58,854 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-16 14:02:58,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:02:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:02:59,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:11,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 14:03:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154436856] [2025-03-16 14:03:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154436856] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:11,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:03:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2025-03-16 14:03:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892821722] [2025-03-16 14:03:11,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-16 14:03:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 14:03:11,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-16 14:03:11,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 14:03:11,452 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 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-16 14:03:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:12,084 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-03-16 14:03:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 14:03:12,087 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 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 20 [2025-03-16 14:03:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:12,088 INFO L225 Difference]: With dead ends: 28 [2025-03-16 14:03:12,088 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:03:12,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 14:03:12,089 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:12,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:03:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:03:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:03:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:03:12,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2025-03-16 14:03:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:12,089 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:03:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 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-16 14:03:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:03:12,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:03:12,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:03:12,101 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-16 14:03:12,292 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 [2025-03-16 14:03:12,294 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-03-16 14:03:12,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:03:12,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:03:12,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:03:12 BoogieIcfgContainer [2025-03-16 14:03:12,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:03:12,537 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:03:12,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:03:12,537 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:03:12,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:02:56" (3/4) ... [2025-03-16 14:03:12,539 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:03:12,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-16 14:03:12,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:03:12,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:03:12,546 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:03:12,603 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:03:12,603 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:03:12,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:03:12,604 INFO L158 Benchmark]: Toolchain (without parser) took 16787.32ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 46.5MB in the end (delta: 46.0MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-03-16 14:03:12,604 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:12,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.41ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:12,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.68ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:12,605 INFO L158 Benchmark]: Boogie Preprocessor took 19.30ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:12,606 INFO L158 Benchmark]: IcfgBuilder took 200.78ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 67.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:12,606 INFO L158 Benchmark]: TraceAbstraction took 16281.44ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 54.9MB in the end (delta: 11.8MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2025-03-16 14:03:12,606 INFO L158 Benchmark]: Witness Printer took 66.32ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 46.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:12,608 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.41ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 80.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.68ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.30ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 200.78ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 67.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16281.44ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 54.9MB in the end (delta: 11.8MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * Witness Printer took 66.32ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 46.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 9 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 512 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 19 mSDtfsCounter, 512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 89 ConstructedInterpolants, 1 QuantifiedInterpolants, 9644 SizeOfPredicates, 2 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 0/404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Location Invariant Derived location invariant: ((((((((((((((((((i == 9) && (z == (((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))))) || ((z == ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) && (i == 7))) || ((((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) == z) && (i == 2))) || ((i == 1) && (z == (0 | (((y & 1) << 1) | ((x & 1) << 0)))))) || ((i == 8) && (z == ((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))))) || ((i == 10) && (z == ((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9)))))) || ((z == ((((y & 32768) << 16) | ((x & 32768) << 15)) | ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))))) && (i == 16))) || ((i == 6) && (z == ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))) || ((z == (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) && (i == 11))) || ((z == (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))) && (i == 5))) || ((z == ((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11))))) && (i == 12))) || ((z == ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))) && (i == 14))) || (((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) == z) && (i == 13))) || ((z == ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13))))) && (i == 15))) || ((i == 0) && (z == 0))) || ((z == ((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2))))) && (i == 4))) || ((i == 3) && (z == (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:03:12,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE