./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label12.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 d0b5df85e0a9ddd1f309535c1c84b5e9767d041ee38e1a69151fb90b019fbb4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:35:06,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:35:06,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:35:06,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:35:06,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:35:06,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:35:06,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:35:06,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:35:06,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:35:06,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:35:06,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:35:06,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:35:06,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:35:06,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:35:06,929 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:35:06,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:35:06,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:35:06,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:35:06,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:35:06,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:35:06,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:35:06,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:35:06,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:35:06,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:35:06,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:35:06,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:35:06,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:35:06,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:35:06,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:35:06,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:35:06,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:35:06,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:35:06,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:35:06,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:35:06,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:35:06,933 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 -> d0b5df85e0a9ddd1f309535c1c84b5e9767d041ee38e1a69151fb90b019fbb4f [2025-03-03 10:35:07,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:35:07,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:35:07,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:35:07,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:35:07,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:35:07,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label12.c [2025-03-03 10:35:08,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d2b043a/9f2200ddbb3344e28351c1e7c45ac958/FLAG556ce5cb9 [2025-03-03 10:35:08,769 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:35:08,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label12.c [2025-03-03 10:35:08,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d2b043a/9f2200ddbb3344e28351c1e7c45ac958/FLAG556ce5cb9 [2025-03-03 10:35:08,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d2b043a/9f2200ddbb3344e28351c1e7c45ac958 [2025-03-03 10:35:08,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:35:08,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:35:08,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:35:08,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:35:08,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:35:08,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:35:08" (1/1) ... [2025-03-03 10:35:08,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bd94cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:08, skipping insertion in model container [2025-03-03 10:35:08,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:35:08" (1/1) ... [2025-03-03 10:35:08,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:35:09,137 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/Problem12_label12.c[7173,7186] [2025-03-03 10:35:09,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:35:09,568 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:35:09,588 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/Problem12_label12.c[7173,7186] [2025-03-03 10:35:09,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:35:09,828 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:35:09,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09 WrapperNode [2025-03-03 10:35:09,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:35:09,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:35:09,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:35:09,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:35:09,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:09,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,111 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:35:10,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:35:10,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:35:10,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:35:10,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:35:10,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,277 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:35:10,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:35:10,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:35:10,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:35:10,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:35:10,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (1/1) ... [2025-03-03 10:35:10,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:35:10,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:10,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:35:10,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:35:10,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:35:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:35:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:35:10,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:35:10,566 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:35:10,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:35:13,925 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:35:13,925 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:35:13,926 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:35:14,104 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:35:14,104 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:35:14,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:35:14,136 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:35:14,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:35:14 BoogieIcfgContainer [2025-03-03 10:35:14,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:35:14,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:35:14,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:35:14,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:35:14,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:35:08" (1/3) ... [2025-03-03 10:35:14,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f61ccd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:35:14, skipping insertion in model container [2025-03-03 10:35:14,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:09" (2/3) ... [2025-03-03 10:35:14,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f61ccd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:35:14, skipping insertion in model container [2025-03-03 10:35:14,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:35:14" (3/3) ... [2025-03-03 10:35:14,146 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label12.c [2025-03-03 10:35:14,157 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:35:14,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label12.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:35:14,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:35:14,233 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;@84f77fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:35:14,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:35:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 10:35:14,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:14,247 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:14,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1570024016, now seen corresponding path program 1 times [2025-03-03 10:35:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:14,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998999791] [2025-03-03 10:35:14,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:14,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 10:35:14,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 10:35:14,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:14,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:35:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:14,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998999791] [2025-03-03 10:35:14,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998999791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856099316] [2025-03-03 10:35:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:14,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:35:14,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:14,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:35:14,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:35:14,670 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:19,201 INFO L93 Difference]: Finished difference Result 3155 states and 6145 transitions. [2025-03-03 10:35:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:35:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 10:35:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:19,220 INFO L225 Difference]: With dead ends: 3155 [2025-03-03 10:35:19,220 INFO L226 Difference]: Without dead ends: 2265 [2025-03-03 10:35:19,225 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-03 10:35:19,229 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 2380 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3734 mSolverCounterSat, 1719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1719 IncrementalHoareTripleChecker+Valid, 3734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:19,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2380 Valid, 234 Invalid, 5453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1719 Valid, 3734 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 10:35:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2025-03-03 10:35:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2257. [2025-03-03 10:35:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5350177304964538) internal successors, (3463), 2256 states have internal predecessors, (3463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3463 transitions. [2025-03-03 10:35:19,324 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3463 transitions. Word has length 58 [2025-03-03 10:35:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:19,325 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3463 transitions. [2025-03-03 10:35:19,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3463 transitions. [2025-03-03 10:35:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 10:35:19,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:19,333 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:19,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:35:19,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:19,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash 552692693, now seen corresponding path program 1 times [2025-03-03 10:35:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:19,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337379086] [2025-03-03 10:35:19,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:19,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 10:35:19,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 10:35:19,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:19,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 10:35:19,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337379086] [2025-03-03 10:35:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337379086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:19,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:19,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:19,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878525676] [2025-03-03 10:35:19,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:19,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:35:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:19,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:35:19,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:35:19,764 INFO L87 Difference]: Start difference. First operand 2257 states and 3463 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:22,604 INFO L93 Difference]: Finished difference Result 6053 states and 9665 transitions. [2025-03-03 10:35:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:35:22,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 198 [2025-03-03 10:35:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:22,616 INFO L225 Difference]: With dead ends: 6053 [2025-03-03 10:35:22,616 INFO L226 Difference]: Without dead ends: 3761 [2025-03-03 10:35:22,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:35:22,619 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 704 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:22,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 710 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:35:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2025-03-03 10:35:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3759. [2025-03-03 10:35:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3411389036721661) internal successors, (5040), 3758 states have internal predecessors, (5040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5040 transitions. [2025-03-03 10:35:22,672 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5040 transitions. Word has length 198 [2025-03-03 10:35:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:22,673 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5040 transitions. [2025-03-03 10:35:22,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5040 transitions. [2025-03-03 10:35:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 10:35:22,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:22,676 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:22,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:35:22,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:22,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1984931804, now seen corresponding path program 1 times [2025-03-03 10:35:22,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:22,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551092522] [2025-03-03 10:35:22,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:22,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 10:35:22,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 10:35:22,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:22,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 111 proven. 54 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 10:35:23,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551092522] [2025-03-03 10:35:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551092522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274454083] [2025-03-03 10:35:23,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:23,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:23,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:23,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:35:23,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:35:23,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 10:35:23,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 10:35:23,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:23,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:23,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:35:23,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:35:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:35:23,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:35:23,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274454083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:23,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:35:23,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:35:23,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257244068] [2025-03-03 10:35:23,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:23,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:23,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:23,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:23,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:23,380 INFO L87 Difference]: Start difference. First operand 3759 states and 5040 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:25,420 INFO L93 Difference]: Finished difference Result 10520 states and 14359 transitions. [2025-03-03 10:35:25,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:25,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 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 268 [2025-03-03 10:35:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:25,437 INFO L225 Difference]: With dead ends: 10520 [2025-03-03 10:35:25,437 INFO L226 Difference]: Without dead ends: 6763 [2025-03-03 10:35:25,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:25,443 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:25,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 486 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-03-03 10:35:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-03-03 10:35:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.251700680272109) internal successors, (8464), 6762 states have internal predecessors, (8464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 8464 transitions. [2025-03-03 10:35:25,529 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 8464 transitions. Word has length 268 [2025-03-03 10:35:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:25,529 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 8464 transitions. [2025-03-03 10:35:25,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 8464 transitions. [2025-03-03 10:35:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-03 10:35:25,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:25,532 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:25,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:35:25,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:25,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash -389676232, now seen corresponding path program 1 times [2025-03-03 10:35:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058144577] [2025-03-03 10:35:25,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:25,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:25,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-03 10:35:25,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-03 10:35:25,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:25,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 111 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 10:35:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058144577] [2025-03-03 10:35:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058144577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933225138] [2025-03-03 10:35:26,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:26,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:26,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:26,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:35:26,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:35:26,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-03 10:35:26,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-03 10:35:26,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:26,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:26,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:35:26,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:35:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:35:26,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:35:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933225138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:35:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 10:35:26,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312061664] [2025-03-03 10:35:26,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:26,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:26,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:26,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:26,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:26,265 INFO L87 Difference]: Start difference. First operand 6763 states and 8464 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:28,253 INFO L93 Difference]: Finished difference Result 16528 states and 21456 transitions. [2025-03-03 10:35:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 281 [2025-03-03 10:35:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:28,310 INFO L225 Difference]: With dead ends: 16528 [2025-03-03 10:35:28,310 INFO L226 Difference]: Without dead ends: 9767 [2025-03-03 10:35:28,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:28,316 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 908 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:28,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 309 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-03-03 10:35:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-03-03 10:35:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2463649395863199) internal successors, (12172), 9766 states have internal predecessors, (12172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12172 transitions. [2025-03-03 10:35:28,424 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12172 transitions. Word has length 281 [2025-03-03 10:35:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:28,425 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12172 transitions. [2025-03-03 10:35:28,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12172 transitions. [2025-03-03 10:35:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 10:35:28,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:28,429 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:28,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:35:28,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 10:35:28,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:28,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1783258727, now seen corresponding path program 1 times [2025-03-03 10:35:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:28,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493624014] [2025-03-03 10:35:28,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:28,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 10:35:28,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 10:35:28,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:28,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-03 10:35:28,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:28,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493624014] [2025-03-03 10:35:28,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493624014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:28,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:28,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:28,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068204466] [2025-03-03 10:35:28,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:28,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:28,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:28,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:28,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:28,767 INFO L87 Difference]: Start difference. First operand 9767 states and 12172 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:31,015 INFO L93 Difference]: Finished difference Result 27042 states and 34236 transitions. [2025-03-03 10:35:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:31,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 298 [2025-03-03 10:35:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:31,047 INFO L225 Difference]: With dead ends: 27042 [2025-03-03 10:35:31,047 INFO L226 Difference]: Without dead ends: 17277 [2025-03-03 10:35:31,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:31,055 INFO L435 NwaCegarLoop]: 1317 mSDtfsCounter, 700 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:31,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1325 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:35:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2025-03-03 10:35:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 15775. [2025-03-03 10:35:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2524407252440726) internal successors, (19756), 15774 states have internal predecessors, (19756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19756 transitions. [2025-03-03 10:35:31,242 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19756 transitions. Word has length 298 [2025-03-03 10:35:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:31,242 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19756 transitions. [2025-03-03 10:35:31,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19756 transitions. [2025-03-03 10:35:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 10:35:31,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:31,246 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:31,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:35:31,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:31,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:31,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1906402654, now seen corresponding path program 1 times [2025-03-03 10:35:31,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:31,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325127925] [2025-03-03 10:35:31,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:31,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:35:31,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:35:31,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:31,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 167 proven. 108 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 10:35:31,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:31,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325127925] [2025-03-03 10:35:31,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325127925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:31,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816564813] [2025-03-03 10:35:31,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:31,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:31,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:31,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:35:31,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:35:31,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:35:31,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:35:31,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:31,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:31,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:35:31,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:35:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:35:31,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:35:31,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816564813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:31,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:35:31,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 10:35:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360045990] [2025-03-03 10:35:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:31,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:31,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:31,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:31,697 INFO L87 Difference]: Start difference. First operand 15775 states and 19756 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:33,710 INFO L93 Difference]: Finished difference Result 38307 states and 48290 transitions. [2025-03-03 10:35:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:33,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 347 [2025-03-03 10:35:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:33,745 INFO L225 Difference]: With dead ends: 38307 [2025-03-03 10:35:33,745 INFO L226 Difference]: Without dead ends: 22534 [2025-03-03 10:35:33,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:33,759 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:33,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 238 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22534 states. [2025-03-03 10:35:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 22534. [2025-03-03 10:35:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.2050326188257223) internal successors, (27153), 22533 states have internal predecessors, (27153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 27153 transitions. [2025-03-03 10:35:33,964 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 27153 transitions. Word has length 347 [2025-03-03 10:35:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:33,964 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 27153 transitions. [2025-03-03 10:35:33,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 27153 transitions. [2025-03-03 10:35:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-03 10:35:33,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:33,969 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:33,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:35:34,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:34,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:34,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash 341978578, now seen corresponding path program 1 times [2025-03-03 10:35:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623689776] [2025-03-03 10:35:34,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:34,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-03 10:35:34,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-03 10:35:34,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:34,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:35:34,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:34,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623689776] [2025-03-03 10:35:34,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623689776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:34,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:34,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:34,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644038856] [2025-03-03 10:35:34,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:34,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:34,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:34,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:34,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:34,344 INFO L87 Difference]: Start difference. First operand 22534 states and 27153 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:36,451 INFO L93 Difference]: Finished difference Result 45066 states and 54304 transitions. [2025-03-03 10:35:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 352 [2025-03-03 10:35:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:36,485 INFO L225 Difference]: With dead ends: 45066 [2025-03-03 10:35:36,485 INFO L226 Difference]: Without dead ends: 22534 [2025-03-03 10:35:36,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:36,505 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 737 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:36,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 247 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22534 states. [2025-03-03 10:35:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22534 to 22534. [2025-03-03 10:35:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.1919850885368126) internal successors, (26859), 22533 states have internal predecessors, (26859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 26859 transitions. [2025-03-03 10:35:36,698 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 26859 transitions. Word has length 352 [2025-03-03 10:35:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:36,699 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 26859 transitions. [2025-03-03 10:35:36,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 26859 transitions. [2025-03-03 10:35:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 10:35:36,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:36,704 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:36,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:35:36,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash 722026027, now seen corresponding path program 1 times [2025-03-03 10:35:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424372291] [2025-03-03 10:35:36,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:36,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 10:35:36,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 10:35:36,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:36,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 10:35:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:36,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424372291] [2025-03-03 10:35:36,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424372291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:36,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:36,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:36,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679696004] [2025-03-03 10:35:36,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:36,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:36,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:36,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:36,894 INFO L87 Difference]: Start difference. First operand 22534 states and 26859 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:38,837 INFO L93 Difference]: Finished difference Result 54078 states and 64019 transitions. [2025-03-03 10:35:38,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:38,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 363 [2025-03-03 10:35:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:38,873 INFO L225 Difference]: With dead ends: 54078 [2025-03-03 10:35:38,874 INFO L226 Difference]: Without dead ends: 31546 [2025-03-03 10:35:38,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:38,891 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 727 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:38,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1297 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:35:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31546 states. [2025-03-03 10:35:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31546 to 30795. [2025-03-03 10:35:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30795 states, 30794 states have (on average 1.1436968240566343) internal successors, (35219), 30794 states have internal predecessors, (35219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30795 states to 30795 states and 35219 transitions. [2025-03-03 10:35:39,231 INFO L78 Accepts]: Start accepts. Automaton has 30795 states and 35219 transitions. Word has length 363 [2025-03-03 10:35:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:39,231 INFO L471 AbstractCegarLoop]: Abstraction has 30795 states and 35219 transitions. [2025-03-03 10:35:39,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 30795 states and 35219 transitions. [2025-03-03 10:35:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 10:35:39,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:39,236 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:39,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:35:39,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:39,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 602748576, now seen corresponding path program 1 times [2025-03-03 10:35:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293521803] [2025-03-03 10:35:39,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:39,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 10:35:39,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 10:35:39,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:39,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-03 10:35:39,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293521803] [2025-03-03 10:35:39,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293521803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:39,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:39,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769287065] [2025-03-03 10:35:39,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:39,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:39,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:39,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:39,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:39,416 INFO L87 Difference]: Start difference. First operand 30795 states and 35219 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:41,371 INFO L93 Difference]: Finished difference Result 63841 states and 72726 transitions. [2025-03-03 10:35:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:41,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 372 [2025-03-03 10:35:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:41,408 INFO L225 Difference]: With dead ends: 63841 [2025-03-03 10:35:41,408 INFO L226 Difference]: Without dead ends: 32297 [2025-03-03 10:35:41,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:41,433 INFO L435 NwaCegarLoop]: 1029 mSDtfsCounter, 819 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:41,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1036 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:35:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32297 states. [2025-03-03 10:35:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32297 to 30795. [2025-03-03 10:35:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30795 states, 30794 states have (on average 1.1185620575436774) internal successors, (34445), 30794 states have internal predecessors, (34445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30795 states to 30795 states and 34445 transitions. [2025-03-03 10:35:41,763 INFO L78 Accepts]: Start accepts. Automaton has 30795 states and 34445 transitions. Word has length 372 [2025-03-03 10:35:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:41,763 INFO L471 AbstractCegarLoop]: Abstraction has 30795 states and 34445 transitions. [2025-03-03 10:35:41,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 30795 states and 34445 transitions. [2025-03-03 10:35:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-03 10:35:41,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:41,768 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, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:41,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:35:41,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:41,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:41,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1281366547, now seen corresponding path program 1 times [2025-03-03 10:35:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:41,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755524884] [2025-03-03 10:35:41,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:41,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 10:35:41,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 10:35:41,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:41,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 351 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:35:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755524884] [2025-03-03 10:35:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755524884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209146232] [2025-03-03 10:35:42,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:42,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:42,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:42,348 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:35:42,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:35:42,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 10:35:42,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 10:35:42,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:42,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:42,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:35:42,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:35:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 248 proven. 56 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:35:42,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:35:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:35:42,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209146232] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:42,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:35:42,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2025-03-03 10:35:42,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794333416] [2025-03-03 10:35:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:42,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:42,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:42,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:35:42,782 INFO L87 Difference]: Start difference. First operand 30795 states and 34445 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:45,159 INFO L93 Difference]: Finished difference Result 79612 states and 89834 transitions. [2025-03-03 10:35:45,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 389 [2025-03-03 10:35:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:45,210 INFO L225 Difference]: With dead ends: 79612 [2025-03-03 10:35:45,211 INFO L226 Difference]: Without dead ends: 49570 [2025-03-03 10:35:45,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:35:45,237 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 767 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:45,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1007 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:35:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49570 states. [2025-03-03 10:35:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49570 to 48819. [2025-03-03 10:35:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48819 states, 48818 states have (on average 1.1272686304232045) internal successors, (55031), 48818 states have internal predecessors, (55031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48819 states to 48819 states and 55031 transitions. [2025-03-03 10:35:45,693 INFO L78 Accepts]: Start accepts. Automaton has 48819 states and 55031 transitions. Word has length 389 [2025-03-03 10:35:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:45,693 INFO L471 AbstractCegarLoop]: Abstraction has 48819 states and 55031 transitions. [2025-03-03 10:35:45,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 48819 states and 55031 transitions. [2025-03-03 10:35:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 10:35:45,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:45,704 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 10:35:45,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:35:45,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:45,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1690642687, now seen corresponding path program 1 times [2025-03-03 10:35:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:45,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994703547] [2025-03-03 10:35:45,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:45,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 10:35:45,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 10:35:45,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:45,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-03 10:35:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994703547] [2025-03-03 10:35:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994703547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326355631] [2025-03-03 10:35:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:46,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:46,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:46,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:46,081 INFO L87 Difference]: Start difference. First operand 48819 states and 55031 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:48,544 INFO L93 Difference]: Finished difference Result 125423 states and 142133 transitions. [2025-03-03 10:35:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 526 [2025-03-03 10:35:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:48,627 INFO L225 Difference]: With dead ends: 125423 [2025-03-03 10:35:48,628 INFO L226 Difference]: Without dead ends: 77357 [2025-03-03 10:35:48,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:48,664 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 654 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:48,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 464 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:35:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77357 states. [2025-03-03 10:35:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77357 to 75855. [2025-03-03 10:35:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75855 states, 75854 states have (on average 1.1091834313286049) internal successors, (84136), 75854 states have internal predecessors, (84136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75855 states to 75855 states and 84136 transitions. [2025-03-03 10:35:49,383 INFO L78 Accepts]: Start accepts. Automaton has 75855 states and 84136 transitions. Word has length 526 [2025-03-03 10:35:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:49,383 INFO L471 AbstractCegarLoop]: Abstraction has 75855 states and 84136 transitions. [2025-03-03 10:35:49,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 75855 states and 84136 transitions. [2025-03-03 10:35:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-03-03 10:35:49,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:49,396 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:49,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:35:49,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:49,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1969009885, now seen corresponding path program 1 times [2025-03-03 10:35:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:49,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831886847] [2025-03-03 10:35:49,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:49,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-03 10:35:49,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-03 10:35:49,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:49,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 367 proven. 372 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 10:35:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:49,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831886847] [2025-03-03 10:35:49,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831886847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:49,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368217466] [2025-03-03 10:35:49,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:49,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:49,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:49,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:35:49,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:35:50,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-03 10:35:50,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-03 10:35:50,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:50,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:50,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:35:50,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:35:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-03 10:35:50,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:35:50,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368217466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:50,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:35:50,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:35:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815359855] [2025-03-03 10:35:50,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:50,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:50,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:50,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:35:50,160 INFO L87 Difference]: Start difference. First operand 75855 states and 84136 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:52,578 INFO L93 Difference]: Finished difference Result 177242 states and 197004 transitions. [2025-03-03 10:35:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:52,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 561 [2025-03-03 10:35:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:52,694 INFO L225 Difference]: With dead ends: 177242 [2025-03-03 10:35:52,694 INFO L226 Difference]: Without dead ends: 102140 [2025-03-03 10:35:52,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:35:52,733 INFO L435 NwaCegarLoop]: 1273 mSDtfsCounter, 711 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:52,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1281 Invalid, 2899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102140 states. [2025-03-03 10:35:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102140 to 98385. [2025-03-03 10:35:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98385 states, 98384 states have (on average 1.1073040331761261) internal successors, (108941), 98384 states have internal predecessors, (108941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98385 states to 98385 states and 108941 transitions. [2025-03-03 10:35:53,576 INFO L78 Accepts]: Start accepts. Automaton has 98385 states and 108941 transitions. Word has length 561 [2025-03-03 10:35:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:53,577 INFO L471 AbstractCegarLoop]: Abstraction has 98385 states and 108941 transitions. [2025-03-03 10:35:53,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 98385 states and 108941 transitions. [2025-03-03 10:35:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-03 10:35:53,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:53,589 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:53,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:35:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 10:35:53,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:53,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1747236852, now seen corresponding path program 1 times [2025-03-03 10:35:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432425719] [2025-03-03 10:35:53,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:53,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-03 10:35:53,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-03 10:35:53,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:53,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-03 10:35:54,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:54,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432425719] [2025-03-03 10:35:54,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432425719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:54,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:54,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959749228] [2025-03-03 10:35:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:54,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:54,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:54,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:54,086 INFO L87 Difference]: Start difference. First operand 98385 states and 108941 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 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-03 10:35:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:56,310 INFO L93 Difference]: Finished difference Result 196017 states and 217124 transitions. [2025-03-03 10:35:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:56,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 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 574 [2025-03-03 10:35:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:56,430 INFO L225 Difference]: With dead ends: 196017 [2025-03-03 10:35:56,430 INFO L226 Difference]: Without dead ends: 98385 [2025-03-03 10:35:56,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:56,481 INFO L435 NwaCegarLoop]: 1114 mSDtfsCounter, 813 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:56,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1122 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:35:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98385 states. [2025-03-03 10:35:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98385 to 98385. [2025-03-03 10:35:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98385 states, 98384 states have (on average 1.0927691494551959) internal successors, (107511), 98384 states have internal predecessors, (107511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98385 states to 98385 states and 107511 transitions. [2025-03-03 10:35:57,609 INFO L78 Accepts]: Start accepts. Automaton has 98385 states and 107511 transitions. Word has length 574 [2025-03-03 10:35:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:57,609 INFO L471 AbstractCegarLoop]: Abstraction has 98385 states and 107511 transitions. [2025-03-03 10:35:57,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 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-03 10:35:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 98385 states and 107511 transitions. [2025-03-03 10:35:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-03-03 10:35:57,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:57,627 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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-03 10:35:57,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:35:57,627 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:57,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash -910871555, now seen corresponding path program 1 times [2025-03-03 10:35:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694860332] [2025-03-03 10:35:57,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:57,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-03-03 10:35:57,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-03-03 10:35:57,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:57,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:35:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694860332] [2025-03-03 10:35:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694860332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:57,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:57,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:57,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010541724] [2025-03-03 10:35:57,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:57,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:57,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:57,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:57,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:57,840 INFO L87 Difference]: Start difference. First operand 98385 states and 107511 transitions. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:00,066 INFO L93 Difference]: Finished difference Result 196015 states and 214263 transitions. [2025-03-03 10:36:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:00,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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 648 [2025-03-03 10:36:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:00,068 INFO L225 Difference]: With dead ends: 196015 [2025-03-03 10:36:00,068 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:36:00,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:00,114 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 612 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:00,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1184 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:36:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:36:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:36:00,115 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-03 10:36:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:36:00,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 648 [2025-03-03 10:36:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:00,115 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:36:00,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:36:00,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:36:00,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:36:00,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:36:00,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:00,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:36:01,806 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:36:01,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:36:01 BoogieIcfgContainer [2025-03-03 10:36:01,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:36:01,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:36:01,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:36:01,827 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:36:01,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:35:14" (3/4) ... [2025-03-03 10:36:01,829 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:36:01,872 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-03 10:36:01,879 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:36:01,883 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:36:01,887 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:36:02,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:36:02,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:36:02,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:36:02,069 INFO L158 Benchmark]: Toolchain (without parser) took 53199.31ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 92.7MB in the beginning and 139.7MB in the end (delta: -47.0MB). Peak memory consumption was 452.4MB. Max. memory is 16.1GB. [2025-03-03 10:36:02,069 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:36:02,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 957.49ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 92.7MB in the beginning and 65.5MB in the end (delta: 27.2MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2025-03-03 10:36:02,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 282.02ms. Allocated memory was 151.0MB in the beginning and 352.3MB in the end (delta: 201.3MB). Free memory was 65.5MB in the beginning and 248.5MB in the end (delta: -182.9MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2025-03-03 10:36:02,070 INFO L158 Benchmark]: Boogie Preprocessor took 352.28ms. Allocated memory is still 352.3MB. Free memory was 248.5MB in the beginning and 194.1MB in the end (delta: 54.4MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2025-03-03 10:36:02,070 INFO L158 Benchmark]: IcfgBuilder took 3671.86ms. Allocated memory was 352.3MB in the beginning and 746.6MB in the end (delta: 394.3MB). Free memory was 194.1MB in the beginning and 300.8MB in the end (delta: -106.7MB). Peak memory consumption was 290.7MB. Max. memory is 16.1GB. [2025-03-03 10:36:02,070 INFO L158 Benchmark]: TraceAbstraction took 47687.07ms. Allocated memory was 746.6MB in the beginning and 645.9MB in the end (delta: -100.7MB). Free memory was 300.8MB in the beginning and 194.2MB in the end (delta: 106.5MB). Peak memory consumption was 858.1MB. Max. memory is 16.1GB. [2025-03-03 10:36:02,070 INFO L158 Benchmark]: Witness Printer took 242.13ms. Allocated memory is still 645.9MB. Free memory was 194.2MB in the beginning and 139.7MB in the end (delta: 54.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 10:36:02,071 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.94ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 957.49ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 92.7MB in the beginning and 65.5MB in the end (delta: 27.2MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 282.02ms. Allocated memory was 151.0MB in the beginning and 352.3MB in the end (delta: 201.3MB). Free memory was 65.5MB in the beginning and 248.5MB in the end (delta: -182.9MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 352.28ms. Allocated memory is still 352.3MB. Free memory was 248.5MB in the beginning and 194.1MB in the end (delta: 54.4MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. * IcfgBuilder took 3671.86ms. Allocated memory was 352.3MB in the beginning and 746.6MB in the end (delta: 394.3MB). Free memory was 194.1MB in the beginning and 300.8MB in the end (delta: -106.7MB). Peak memory consumption was 290.7MB. Max. memory is 16.1GB. * TraceAbstraction took 47687.07ms. Allocated memory was 746.6MB in the beginning and 645.9MB in the end (delta: -100.7MB). Free memory was 300.8MB in the beginning and 194.2MB in the end (delta: 106.5MB). Peak memory consumption was 858.1MB. Max. memory is 16.1GB. * Witness Printer took 242.13ms. Allocated memory is still 645.9MB. Free memory was 194.2MB in the beginning and 139.7MB in the end (delta: 54.5MB). Peak memory consumption was 58.7MB. 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: 196]: 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, 818 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.9s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11993 SdHoareTripleChecker+Valid, 30.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11993 mSDsluCounter, 10940 SdHoareTripleChecker+Invalid, 25.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 9582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33608 IncrementalHoareTripleChecker+Invalid, 43190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9582 mSolverCounterUnsat, 10815 mSDtfsCounter, 33608 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2276 GetRequests, 2244 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98385occurred in iteration=12, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 9773 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 7081 NumberOfCodeBlocks, 7081 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 7450 ConstructedInterpolants, 0 QuantifiedInterpolants, 19144 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2463 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 7863/8576 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: 4828]: Location Invariant Derived location invariant: ((((((((((((a2 <= 170) && (a5 == 4)) && (((long long) a17 + 124) <= 0)) || ((a2 <= 189) && (a24 != 14))) || ((14 <= a7) && (a24 == 13))) || (((a24 <= 14) && (14 <= a7)) && (a5 <= 5))) || (((a7 <= 13) && (0 <= ((long long) a17 + 107))) && (a5 <= 5))) || ((a24 == 13) && (a7 <= 12))) || ((6 <= a5) && (a2 <= 189))) || ((a5 <= 4) && (190 <= a2))) || ((0 <= ((long long) a17 + 107)) && (a24 == 13))) || ((a5 <= 5) && (a7 <= 12))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:36:02,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE