./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label05.c --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/eca-rers2012/Problem10_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fb47f955ea6ba1edf33456e69e9d22d4cc1ecd78cb5e200db0c0a5026f9dd33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:48:32,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:48:32,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:48:32,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:48:32,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:48:32,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:48:32,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:48:32,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:48:32,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:48:32,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:48:32,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:48:32,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:48:32,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:48:32,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:48:32,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:48:32,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:48:32,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:48:32,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:48:32,877 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 -> 7fb47f955ea6ba1edf33456e69e9d22d4cc1ecd78cb5e200db0c0a5026f9dd33 [2025-03-16 14:48:33,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:48:33,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:48:33,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:48:33,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:48:33,078 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:48:33,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label05.c [2025-03-16 14:48:34,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3264971b9/61919d580e2c44448278f5ce4cb1acaf/FLAG50ba27f4b [2025-03-16 14:48:34,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:48:34,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label05.c [2025-03-16 14:48:34,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3264971b9/61919d580e2c44448278f5ce4cb1acaf/FLAG50ba27f4b [2025-03-16 14:48:34,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3264971b9/61919d580e2c44448278f5ce4cb1acaf [2025-03-16 14:48:34,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:48:34,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:48:34,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:48:34,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:48:34,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:48:34,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:48:34" (1/1) ... [2025-03-16 14:48:34,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b739f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:34, skipping insertion in model container [2025-03-16 14:48:34,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:48:34" (1/1) ... [2025-03-16 14:48:34,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:48:34,952 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/eca-rers2012/Problem10_label05.c[5981,5994] [2025-03-16 14:48:35,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:48:35,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:48:35,097 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/eca-rers2012/Problem10_label05.c[5981,5994] [2025-03-16 14:48:35,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:48:35,160 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:48:35,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35 WrapperNode [2025-03-16 14:48:35,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:48:35,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:48:35,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:48:35,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:48:35,165 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:48:35" (1/1) ... [2025-03-16 14:48:35,179 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:48:35" (1/1) ... [2025-03-16 14:48:35,211 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-16 14:48:35,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:48:35,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:48:35,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:48:35,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:48:35,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,249 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:48:35,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:48:35,289 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:48:35,289 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:48:35,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:48:35,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (1/1) ... [2025-03-16 14:48:35,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:48:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:48:35,320 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:48:35,331 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:48:35,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:48:35,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:48:35,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:48:35,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:48:35,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:48:35,400 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:48:36,112 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 14:48:36,112 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:48:36,126 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:48:36,126 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:48:36,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:48:36 BoogieIcfgContainer [2025-03-16 14:48:36,126 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:48:36,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:48:36,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:48:36,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:48:36,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:48:34" (1/3) ... [2025-03-16 14:48:36,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fc5d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:48:36, skipping insertion in model container [2025-03-16 14:48:36,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:48:35" (2/3) ... [2025-03-16 14:48:36,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fc5d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:48:36, skipping insertion in model container [2025-03-16 14:48:36,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:48:36" (3/3) ... [2025-03-16 14:48:36,136 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label05.c [2025-03-16 14:48:36,146 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:48:36,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label05.c that has 1 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:48:36,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:48:36,201 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;@3803e644, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:48:36,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:48:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.972027972027972) internal successors, (282), 144 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:48:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 14:48:36,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:36,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:48:36,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:36,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1846174264, now seen corresponding path program 1 times [2025-03-16 14:48:36,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:36,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649941798] [2025-03-16 14:48:36,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:36,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 14:48:36,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 14:48:36,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:36,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:36,324 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:48:36,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:36,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649941798] [2025-03-16 14:48:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649941798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:36,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:48:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:48:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227563400] [2025-03-16 14:48:36,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:48:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:36,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:48:36,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:48:36,348 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.972027972027972) internal successors, (282), 144 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 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:48:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:36,378 INFO L93 Difference]: Finished difference Result 289 states and 563 transitions. [2025-03-16 14:48:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:48:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 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 51 [2025-03-16 14:48:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:36,385 INFO L225 Difference]: With dead ends: 289 [2025-03-16 14:48:36,386 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 14:48:36,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:48:36,391 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:36,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:48:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 14:48:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-16 14:48:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 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:48:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2025-03-16 14:48:36,425 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 51 [2025-03-16 14:48:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:36,426 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2025-03-16 14:48:36,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 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:48:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2025-03-16 14:48:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 14:48:36,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:36,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:48:36,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:48:36,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:36,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:36,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1017395944, now seen corresponding path program 1 times [2025-03-16 14:48:36,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:36,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337449277] [2025-03-16 14:48:36,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:36,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:36,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 14:48:36,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 14:48:36,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:36,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:36,769 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:48:36,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:36,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337449277] [2025-03-16 14:48:36,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337449277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:36,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:48:36,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:48:36,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445734788] [2025-03-16 14:48:36,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:36,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:48:36,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:36,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:48:36,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:48:36,772 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 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:48:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:37,611 INFO L93 Difference]: Finished difference Result 561 states and 863 transitions. [2025-03-16 14:48:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:48:37,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 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 51 [2025-03-16 14:48:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:37,614 INFO L225 Difference]: With dead ends: 561 [2025-03-16 14:48:37,614 INFO L226 Difference]: Without dead ends: 420 [2025-03-16 14:48:37,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:48:37,615 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 412 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:37,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 15 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:48:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-16 14:48:37,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-16 14:48:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.3842482100238664) internal successors, (580), 419 states have internal predecessors, (580), 0 states have call successors, (0), 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:48:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2025-03-16 14:48:37,646 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 51 [2025-03-16 14:48:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:37,647 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2025-03-16 14:48:37,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 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:48:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2025-03-16 14:48:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 14:48:37,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:37,653 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:48:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:48:37,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 677384053, now seen corresponding path program 1 times [2025-03-16 14:48:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850630174] [2025-03-16 14:48:37,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:37,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 14:48:37,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 14:48:37,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:37,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 14:48:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:37,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850630174] [2025-03-16 14:48:37,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850630174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:37,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:48:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:48:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401662948] [2025-03-16 14:48:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:37,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:48:37,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:37,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:48:37,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:48:37,995 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:48:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:38,390 INFO L93 Difference]: Finished difference Result 978 states and 1439 transitions. [2025-03-16 14:48:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:48:38,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 232 [2025-03-16 14:48:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:38,395 INFO L225 Difference]: With dead ends: 978 [2025-03-16 14:48:38,395 INFO L226 Difference]: Without dead ends: 698 [2025-03-16 14:48:38,397 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:48:38,399 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 90 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:38,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 224 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:48:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-16 14:48:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 559. [2025-03-16 14:48:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3154121863799284) internal successors, (734), 558 states have internal predecessors, (734), 0 states have call successors, (0), 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:48:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 734 transitions. [2025-03-16 14:48:38,424 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 734 transitions. Word has length 232 [2025-03-16 14:48:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:38,425 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 734 transitions. [2025-03-16 14:48:38,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:48:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 734 transitions. [2025-03-16 14:48:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 14:48:38,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:38,427 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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:48:38,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:48:38,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:38,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1173288858, now seen corresponding path program 1 times [2025-03-16 14:48:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:38,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829597874] [2025-03-16 14:48:38,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:38,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:38,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 14:48:38,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 14:48:38,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:38,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:48:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:38,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829597874] [2025-03-16 14:48:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829597874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:38,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:48:38,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:48:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750834643] [2025-03-16 14:48:38,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:38,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:48:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:38,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:48:38,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:48:38,657 INFO L87 Difference]: Start difference. First operand 559 states and 734 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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:48:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:39,032 INFO L93 Difference]: Finished difference Result 1117 states and 1532 transitions. [2025-03-16 14:48:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:48:39,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2025-03-16 14:48:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:39,034 INFO L225 Difference]: With dead ends: 1117 [2025-03-16 14:48:39,035 INFO L226 Difference]: Without dead ends: 698 [2025-03-16 14:48:39,035 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:48:39,036 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:39,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 213 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:48:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-16 14:48:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-16 14:48:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.266857962697274) internal successors, (883), 697 states have internal predecessors, (883), 0 states have call successors, (0), 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:48:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 883 transitions. [2025-03-16 14:48:39,046 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 883 transitions. Word has length 238 [2025-03-16 14:48:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:39,046 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 883 transitions. [2025-03-16 14:48:39,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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:48:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 883 transitions. [2025-03-16 14:48:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-16 14:48:39,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:39,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:48:39,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:48:39,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:39,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 657826245, now seen corresponding path program 1 times [2025-03-16 14:48:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:39,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380485824] [2025-03-16 14:48:39,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:39,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:39,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-16 14:48:39,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-16 14:48:39,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:39,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:48:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380485824] [2025-03-16 14:48:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380485824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:48:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:48:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909410464] [2025-03-16 14:48:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:39,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:48:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:39,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:48:39,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:48:39,405 INFO L87 Difference]: Start difference. First operand 698 states and 883 transitions. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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:48:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:39,843 INFO L93 Difference]: Finished difference Result 1311 states and 1671 transitions. [2025-03-16 14:48:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:48:39,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-03-16 14:48:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:39,847 INFO L225 Difference]: With dead ends: 1311 [2025-03-16 14:48:39,847 INFO L226 Difference]: Without dead ends: 698 [2025-03-16 14:48:39,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:48:39,848 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 142 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:39,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:48:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-16 14:48:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-16 14:48:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2625538020086082) internal successors, (880), 697 states have internal predecessors, (880), 0 states have call successors, (0), 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:48:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 880 transitions. [2025-03-16 14:48:39,860 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 880 transitions. Word has length 247 [2025-03-16 14:48:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 880 transitions. [2025-03-16 14:48:39,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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:48:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 880 transitions. [2025-03-16 14:48:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-16 14:48:39,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:39,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:48:39,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:48:39,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:39,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1216025123, now seen corresponding path program 1 times [2025-03-16 14:48:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:39,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622628157] [2025-03-16 14:48:39,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:39,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 14:48:39,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 14:48:39,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:39,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 14:48:40,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622628157] [2025-03-16 14:48:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622628157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:40,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:48:40,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:48:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397379984] [2025-03-16 14:48:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:48:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:40,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:48:40,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:48:40,224 INFO L87 Difference]: Start difference. First operand 698 states and 880 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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:48:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:40,663 INFO L93 Difference]: Finished difference Result 1256 states and 1611 transitions. [2025-03-16 14:48:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:48:40,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 259 [2025-03-16 14:48:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:40,666 INFO L225 Difference]: With dead ends: 1256 [2025-03-16 14:48:40,666 INFO L226 Difference]: Without dead ends: 698 [2025-03-16 14:48:40,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:48:40,668 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 127 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:40,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 85 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:48:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-16 14:48:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-16 14:48:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2553802008608321) internal successors, (875), 697 states have internal predecessors, (875), 0 states have call successors, (0), 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:48:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 875 transitions. [2025-03-16 14:48:40,678 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 875 transitions. Word has length 259 [2025-03-16 14:48:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:40,678 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 875 transitions. [2025-03-16 14:48:40,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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:48:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 875 transitions. [2025-03-16 14:48:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-16 14:48:40,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:40,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:48:40,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:48:40,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:40,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2004311329, now seen corresponding path program 1 times [2025-03-16 14:48:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:40,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071915102] [2025-03-16 14:48:40,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:40,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-16 14:48:40,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-16 14:48:40,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:40,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 114 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:48:41,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:41,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071915102] [2025-03-16 14:48:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071915102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:48:41,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005140891] [2025-03-16 14:48:41,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:41,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:48:41,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:48:41,065 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:48:41,067 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:48:41,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-16 14:48:41,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-16 14:48:41,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:41,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:41,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:48:41,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:48:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 14:48:41,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:48:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005140891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:41,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:48:41,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-16 14:48:41,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435992676] [2025-03-16 14:48:41,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:41,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:48:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:41,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:48:41,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:48:41,460 INFO L87 Difference]: Start difference. First operand 698 states and 875 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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:48:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:41,857 INFO L93 Difference]: Finished difference Result 1395 states and 1819 transitions. [2025-03-16 14:48:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:48:41,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 283 [2025-03-16 14:48:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:41,860 INFO L225 Difference]: With dead ends: 1395 [2025-03-16 14:48:41,860 INFO L226 Difference]: Without dead ends: 837 [2025-03-16 14:48:41,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:48:41,865 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:41,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 33 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:48:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-16 14:48:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2025-03-16 14:48:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2416267942583732) internal successors, (1038), 836 states have internal predecessors, (1038), 0 states have call successors, (0), 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:48:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1038 transitions. [2025-03-16 14:48:41,883 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1038 transitions. Word has length 283 [2025-03-16 14:48:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:41,885 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1038 transitions. [2025-03-16 14:48:41,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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:48:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1038 transitions. [2025-03-16 14:48:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-16 14:48:41,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:41,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:48:41,899 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:48:42,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:48:42,092 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:42,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:42,092 INFO L85 PathProgramCache]: Analyzing trace with hash 494774156, now seen corresponding path program 1 times [2025-03-16 14:48:42,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:42,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694574357] [2025-03-16 14:48:42,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:42,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:42,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 14:48:42,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 14:48:42,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:42,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 349 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:48:42,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694574357] [2025-03-16 14:48:42,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694574357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:48:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374106567] [2025-03-16 14:48:42,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:42,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:48:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:48:42,436 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:48:42,438 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:48:42,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 14:48:42,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 14:48:42,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:42,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:42,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:48:42,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:48:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 14:48:42,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:48:42,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374106567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:42,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:48:42,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:48:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319892167] [2025-03-16 14:48:42,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:42,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:48:42,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:42,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:48:42,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:48:42,711 INFO L87 Difference]: Start difference. First operand 837 states and 1038 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:48:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:43,108 INFO L93 Difference]: Finished difference Result 2090 states and 2636 transitions. [2025-03-16 14:48:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:48:43,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 351 [2025-03-16 14:48:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:43,113 INFO L225 Difference]: With dead ends: 2090 [2025-03-16 14:48:43,113 INFO L226 Difference]: Without dead ends: 1393 [2025-03-16 14:48:43,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:48:43,115 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:43,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 193 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:48:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-16 14:48:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2025-03-16 14:48:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1989942528735633) internal successors, (1669), 1392 states have internal predecessors, (1669), 0 states have call successors, (0), 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:48:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1669 transitions. [2025-03-16 14:48:43,145 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1669 transitions. Word has length 351 [2025-03-16 14:48:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:43,146 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1669 transitions. [2025-03-16 14:48:43,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:48:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1669 transitions. [2025-03-16 14:48:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-16 14:48:43,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:43,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:48:43,156 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:48:43,354 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,SelfDestructingSolverStorable7 [2025-03-16 14:48:43,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1214891021, now seen corresponding path program 1 times [2025-03-16 14:48:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184787379] [2025-03-16 14:48:43,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:43,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-16 14:48:43,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-16 14:48:43,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:43,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-16 14:48:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184787379] [2025-03-16 14:48:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184787379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:48:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:48:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754555636] [2025-03-16 14:48:43,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:43,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:48:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:43,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:48:43,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:48:43,530 INFO L87 Difference]: Start difference. First operand 1393 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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:48:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:43,895 INFO L93 Difference]: Finished difference Result 3063 states and 3735 transitions. [2025-03-16 14:48:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:48:43,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 364 [2025-03-16 14:48:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:43,901 INFO L225 Difference]: With dead ends: 3063 [2025-03-16 14:48:43,902 INFO L226 Difference]: Without dead ends: 1810 [2025-03-16 14:48:43,903 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:48:43,903 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 90 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:43,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 223 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:48:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-03-16 14:48:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1671. [2025-03-16 14:48:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.1808383233532933) internal successors, (1972), 1670 states have internal predecessors, (1972), 0 states have call successors, (0), 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:48:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1972 transitions. [2025-03-16 14:48:43,925 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1972 transitions. Word has length 364 [2025-03-16 14:48:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:43,926 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 1972 transitions. [2025-03-16 14:48:43,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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:48:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1972 transitions. [2025-03-16 14:48:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-16 14:48:43,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:48:43,930 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:48:43,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:48:43,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:48:43,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:48:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash -636132401, now seen corresponding path program 1 times [2025-03-16 14:48:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:48:43,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299691980] [2025-03-16 14:48:43,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:48:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:48:43,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-16 14:48:43,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-16 14:48:43,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:48:43,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:48:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-16 14:48:44,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:48:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299691980] [2025-03-16 14:48:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299691980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:48:44,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:48:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:48:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441041723] [2025-03-16 14:48:44,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:48:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:48:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:48:44,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:48:44,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:48:44,078 INFO L87 Difference]: Start difference. First operand 1671 states and 1972 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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:48:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:48:44,456 INFO L93 Difference]: Finished difference Result 3617 states and 4364 transitions. [2025-03-16 14:48:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:48:44,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 365 [2025-03-16 14:48:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:48:44,458 INFO L225 Difference]: With dead ends: 3617 [2025-03-16 14:48:44,458 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:48:44,460 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:48:44,460 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 91 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:48:44,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 78 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:48:44,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:48:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:48:44,461 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:48:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:48:44,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 365 [2025-03-16 14:48:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:48:44,461 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:48:44,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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:48:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:48:44,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:48:44,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:48:44,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:48:44,467 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:48:44,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:48:44,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:48:44,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:48:44 BoogieIcfgContainer [2025-03-16 14:48:44,567 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:48:44,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:48:44,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:48:44,568 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:48:44,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:48:36" (3/4) ... [2025-03-16 14:48:44,570 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:48:44,585 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:48:44,586 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:48:44,586 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:48:44,587 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:48:44,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:48:44,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:48:44,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:48:44,677 INFO L158 Benchmark]: Toolchain (without parser) took 9897.43ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 153.2MB in the beginning and 185.3MB in the end (delta: -32.1MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2025-03-16 14:48:44,678 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:48:44,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.44ms. Allocated memory is still 201.3MB. Free memory was 153.2MB in the beginning and 126.4MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:48:44,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.01ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 118.9MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:48:44,678 INFO L158 Benchmark]: Boogie Preprocessor took 76.11ms. Allocated memory is still 201.3MB. Free memory was 118.5MB in the beginning and 110.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:48:44,678 INFO L158 Benchmark]: IcfgBuilder took 836.87ms. Allocated memory is still 201.3MB. Free memory was 109.7MB in the beginning and 124.6MB in the end (delta: -14.9MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2025-03-16 14:48:44,679 INFO L158 Benchmark]: TraceAbstraction took 8436.46ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 123.6MB in the beginning and 197.0MB in the end (delta: -73.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2025-03-16 14:48:44,679 INFO L158 Benchmark]: Witness Printer took 109.04ms. Allocated memory is still 293.6MB. Free memory was 197.0MB in the beginning and 185.3MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:48:44,681 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.14ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.44ms. Allocated memory is still 201.3MB. Free memory was 153.2MB in the beginning and 126.4MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.01ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 118.9MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.11ms. Allocated memory is still 201.3MB. Free memory was 118.5MB in the beginning and 110.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 836.87ms. Allocated memory is still 201.3MB. Free memory was 109.7MB in the beginning and 124.6MB in the end (delta: -14.9MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8436.46ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 123.6MB in the beginning and 197.0MB in the end (delta: -73.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Witness Printer took 109.04ms. Allocated memory is still 293.6MB. Free memory was 197.0MB in the beginning and 185.3MB in the end (delta: 11.7MB). 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: 170]: 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, 145 locations, 282 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1056 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1056 mSDsluCounter, 1306 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 604 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3982 IncrementalHoareTripleChecker+Invalid, 4586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 604 mSolverCounterUnsat, 1254 mSDtfsCounter, 3982 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1671occurred in iteration=9, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 278 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3075 NumberOfCodeBlocks, 3075 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3063 ConstructedInterpolants, 0 QuantifiedInterpolants, 11274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 870 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 2592/2732 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: 592]: Location Invariant Derived location invariant: ((((((a19 != 6) && (14 == a4)) && (a12 == 0)) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 3) && (14 == a4)) && (a12 == 0))) || (((a10 == 4) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:48:44,694 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