./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label13.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 5a19424d0456c6718774c0e7f98c7314f15d1f859d3e4c4b58b43cec62bc198b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:08:30,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:08:30,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:08:30,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:08:30,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:08:30,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:08:30,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:08:30,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:08:30,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:08:30,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:08:30,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:08:30,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:08:30,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:08:30,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:08:30,914 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:08:30,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:08:30,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:08:30,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:08:30,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:08:30,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:08:30,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:08:30,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:08:30,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:08:30,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:08:30,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:08:30,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:08:30,916 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 -> 5a19424d0456c6718774c0e7f98c7314f15d1f859d3e4c4b58b43cec62bc198b [2025-03-16 15:08:31,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:08:31,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:08:31,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:08:31,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:08:31,119 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:08:31,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label13.c [2025-03-16 15:08:32,216 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25986b48/43f3801a077f4137a475b5c222a06976/FLAG476b1fa18 [2025-03-16 15:08:32,590 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:08:32,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label13.c [2025-03-16 15:08:32,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25986b48/43f3801a077f4137a475b5c222a06976/FLAG476b1fa18 [2025-03-16 15:08:32,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25986b48/43f3801a077f4137a475b5c222a06976 [2025-03-16 15:08:32,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:08:32,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:08:32,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:08:32,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:08:32,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:08:32,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:08:32" (1/1) ... [2025-03-16 15:08:32,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11af817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:32, skipping insertion in model container [2025-03-16 15:08:32,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:08:32" (1/1) ... [2025-03-16 15:08:32,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:08:32,982 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/Problem15_label13.c[5940,5953] [2025-03-16 15:08:33,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:08:33,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:08:33,264 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/Problem15_label13.c[5940,5953] [2025-03-16 15:08:33,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:08:33,411 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:08:33,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33 WrapperNode [2025-03-16 15:08:33,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:08:33,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:08:33,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:08:33,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:08:33,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,561 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:08:33,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:08:33,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:08:33,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:08:33,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:08:33,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,680 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:08:33,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:08:33,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:08:33,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:08:33,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:08:33,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (1/1) ... [2025-03-16 15:08:33,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:08:33,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:33,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:08:33,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:08:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:08:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:08:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:08:33,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:08:33,881 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:08:33,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:08:35,664 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:08:35,727 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:08:35,728 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:08:35,747 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:08:35,748 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:08:35,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:08:35 BoogieIcfgContainer [2025-03-16 15:08:35,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:08:35,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:08:35,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:08:35,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:08:35,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:08:32" (1/3) ... [2025-03-16 15:08:35,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b05c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:08:35, skipping insertion in model container [2025-03-16 15:08:35,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:08:33" (2/3) ... [2025-03-16 15:08:35,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b05c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:08:35, skipping insertion in model container [2025-03-16 15:08:35,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:08:35" (3/3) ... [2025-03-16 15:08:35,756 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label13.c [2025-03-16 15:08:35,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:08:35,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label13.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:08:35,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:08:35,827 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;@2d294c56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:08:35,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:08:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 15:08:35,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:35,838 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] [2025-03-16 15:08:35,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:35,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1036648026, now seen corresponding path program 1 times [2025-03-16 15:08:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513225727] [2025-03-16 15:08:35,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:35,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 15:08:35,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 15:08:35,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:35,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:35,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:35,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513225727] [2025-03-16 15:08:35,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513225727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:35,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:08:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166624552] [2025-03-16 15:08:35,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:08:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:35,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:08:35,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:08:35,978 INFO L87 Difference]: Start difference. First operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:36,024 INFO L93 Difference]: Finished difference Result 725 states and 1375 transitions. [2025-03-16 15:08:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:08:36,025 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 15:08:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:36,034 INFO L225 Difference]: With dead ends: 725 [2025-03-16 15:08:36,034 INFO L226 Difference]: Without dead ends: 360 [2025-03-16 15:08:36,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:08:36,041 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:36,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:08:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-16 15:08:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-16 15:08:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2025-03-16 15:08:36,080 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 47 [2025-03-16 15:08:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:36,081 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2025-03-16 15:08:36,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2025-03-16 15:08:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 15:08:36,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:36,082 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] [2025-03-16 15:08:36,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:08:36,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:36,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:36,083 INFO L85 PathProgramCache]: Analyzing trace with hash -656323915, now seen corresponding path program 1 times [2025-03-16 15:08:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:36,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504344517] [2025-03-16 15:08:36,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:36,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 15:08:36,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 15:08:36,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:36,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:36,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504344517] [2025-03-16 15:08:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504344517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:36,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:36,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:08:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990199513] [2025-03-16 15:08:36,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:36,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:36,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:36,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:36,280 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:37,862 INFO L93 Difference]: Finished difference Result 1046 states and 1824 transitions. [2025-03-16 15:08:37,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:37,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 15:08:37,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:37,866 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 15:08:37,866 INFO L226 Difference]: Without dead ends: 687 [2025-03-16 15:08:37,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:37,868 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 289 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:37,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 193 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:08:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-16 15:08:37,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2025-03-16 15:08:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.6106194690265487) internal successors, (1092), 678 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1092 transitions. [2025-03-16 15:08:37,897 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1092 transitions. Word has length 47 [2025-03-16 15:08:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:37,897 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1092 transitions. [2025-03-16 15:08:37,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1092 transitions. [2025-03-16 15:08:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 15:08:37,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:37,899 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:08:37,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:08:37,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2120044431, now seen corresponding path program 1 times [2025-03-16 15:08:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270761469] [2025-03-16 15:08:37,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:37,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:37,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 15:08:37,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 15:08:37,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:37,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:38,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:38,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270761469] [2025-03-16 15:08:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270761469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:38,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:38,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:08:38,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100303325] [2025-03-16 15:08:38,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:38,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:38,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:38,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:38,087 INFO L87 Difference]: Start difference. First operand 679 states and 1092 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:39,218 INFO L93 Difference]: Finished difference Result 1963 states and 3170 transitions. [2025-03-16 15:08:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 15:08:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:39,223 INFO L225 Difference]: With dead ends: 1963 [2025-03-16 15:08:39,224 INFO L226 Difference]: Without dead ends: 1285 [2025-03-16 15:08:39,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:39,225 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:39,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:08:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-16 15:08:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1280. [2025-03-16 15:08:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3956215793588742) internal successors, (1785), 1279 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1785 transitions. [2025-03-16 15:08:39,247 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1785 transitions. Word has length 115 [2025-03-16 15:08:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:39,247 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1785 transitions. [2025-03-16 15:08:39,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1785 transitions. [2025-03-16 15:08:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 15:08:39,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:39,253 INFO L218 NwaCegarLoop]: trace histogram [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-16 15:08:39,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:08:39,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:39,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1982313251, now seen corresponding path program 1 times [2025-03-16 15:08:39,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:39,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785442802] [2025-03-16 15:08:39,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:39,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 15:08:39,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 15:08:39,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:39,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:39,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:39,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785442802] [2025-03-16 15:08:39,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785442802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:39,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:39,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:08:39,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962900406] [2025-03-16 15:08:39,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:39,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:39,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:39,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:39,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:39,577 INFO L87 Difference]: Start difference. First operand 1280 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:40,807 INFO L93 Difference]: Finished difference Result 2858 states and 3904 transitions. [2025-03-16 15:08:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:40,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-16 15:08:40,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:40,812 INFO L225 Difference]: With dead ends: 2858 [2025-03-16 15:08:40,812 INFO L226 Difference]: Without dead ends: 1579 [2025-03-16 15:08:40,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:40,814 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:40,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 358 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:08:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-03-16 15:08:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2025-03-16 15:08:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1578 states have (on average 1.3244613434727504) internal successors, (2090), 1578 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2090 transitions. [2025-03-16 15:08:40,836 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2090 transitions. Word has length 123 [2025-03-16 15:08:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:40,837 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2090 transitions. [2025-03-16 15:08:40,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2090 transitions. [2025-03-16 15:08:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 15:08:40,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:40,839 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, 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] [2025-03-16 15:08:40,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:08:40,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:40,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1533619928, now seen corresponding path program 1 times [2025-03-16 15:08:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:40,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520894626] [2025-03-16 15:08:40,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:40,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 15:08:40,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 15:08:40,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:40,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520894626] [2025-03-16 15:08:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520894626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427137168] [2025-03-16 15:08:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:41,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:08:41,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:08:41,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 15:08:41,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 15:08:41,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:41,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:41,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:08:41,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 142 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:41,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 142 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427137168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:08:42,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:08:42,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-16 15:08:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012084148] [2025-03-16 15:08:42,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:08:42,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:08:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:42,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:08:42,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:08:42,467 INFO L87 Difference]: Start difference. First operand 1579 states and 2090 transitions. Second operand has 10 states, 10 states have (on average 52.4) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:48,173 INFO L93 Difference]: Finished difference Result 8166 states and 11083 transitions. [2025-03-16 15:08:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 15:08:48,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 52.4) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 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 214 [2025-03-16 15:08:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:48,185 INFO L225 Difference]: With dead ends: 8166 [2025-03-16 15:08:48,185 INFO L226 Difference]: Without dead ends: 4286 [2025-03-16 15:08:48,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 15:08:48,189 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 3228 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 9732 mSolverCounterSat, 1057 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 10789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1057 IncrementalHoareTripleChecker+Valid, 9732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:48,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 415 Invalid, 10789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1057 Valid, 9732 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-16 15:08:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2025-03-16 15:08:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 3977. [2025-03-16 15:08:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3976 states have (on average 1.1509054325955734) internal successors, (4576), 3976 states have internal predecessors, (4576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 4576 transitions. [2025-03-16 15:08:48,239 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 4576 transitions. Word has length 214 [2025-03-16 15:08:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:48,242 INFO L471 AbstractCegarLoop]: Abstraction has 3977 states and 4576 transitions. [2025-03-16 15:08:48,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 52.4) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 4576 transitions. [2025-03-16 15:08:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-16 15:08:48,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:48,247 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:48,253 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-16 15:08:48,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:48,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:48,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash -999599654, now seen corresponding path program 1 times [2025-03-16 15:08:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131437558] [2025-03-16 15:08:48,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:48,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-16 15:08:48,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-16 15:08:48,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:48,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-16 15:08:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131437558] [2025-03-16 15:08:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131437558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:48,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:08:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953377268] [2025-03-16 15:08:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:48,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:48,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:48,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:48,664 INFO L87 Difference]: Start difference. First operand 3977 states and 4576 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:49,528 INFO L93 Difference]: Finished difference Result 8857 states and 10344 transitions. [2025-03-16 15:08:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:49,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 329 [2025-03-16 15:08:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:49,540 INFO L225 Difference]: With dead ends: 8857 [2025-03-16 15:08:49,540 INFO L226 Difference]: Without dead ends: 5180 [2025-03-16 15:08:49,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:49,544 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:49,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 264 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:08:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2025-03-16 15:08:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 5177. [2025-03-16 15:08:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5177 states, 5176 states have (on average 1.132341576506955) internal successors, (5861), 5176 states have internal predecessors, (5861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 5861 transitions. [2025-03-16 15:08:49,603 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 5861 transitions. Word has length 329 [2025-03-16 15:08:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:49,604 INFO L471 AbstractCegarLoop]: Abstraction has 5177 states and 5861 transitions. [2025-03-16 15:08:49,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 5861 transitions. [2025-03-16 15:08:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-16 15:08:49,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:49,607 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:49,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:08:49,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:49,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash 264341508, now seen corresponding path program 1 times [2025-03-16 15:08:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:49,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687886660] [2025-03-16 15:08:49,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:49,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:49,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-16 15:08:49,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-16 15:08:49,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:49,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687886660] [2025-03-16 15:08:50,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687886660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698740954] [2025-03-16 15:08:50,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:50,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:50,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:08:50,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:08:50,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-16 15:08:50,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-16 15:08:50,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:50,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:50,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:50,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:08:50,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:50,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698740954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:50,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:50,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:08:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759515358] [2025-03-16 15:08:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:50,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:50,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:50,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:08:50,670 INFO L87 Difference]: Start difference. First operand 5177 states and 5861 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:51,487 INFO L93 Difference]: Finished difference Result 12758 states and 14600 transitions. [2025-03-16 15:08:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:51,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 393 [2025-03-16 15:08:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:51,503 INFO L225 Difference]: With dead ends: 12758 [2025-03-16 15:08:51,503 INFO L226 Difference]: Without dead ends: 7582 [2025-03-16 15:08:51,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:08:51,508 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 244 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:51,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 273 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:08:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7582 states. [2025-03-16 15:08:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7582 to 6979. [2025-03-16 15:08:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6979 states, 6978 states have (on average 1.1077672685583262) internal successors, (7730), 6978 states have internal predecessors, (7730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6979 states to 6979 states and 7730 transitions. [2025-03-16 15:08:51,586 INFO L78 Accepts]: Start accepts. Automaton has 6979 states and 7730 transitions. Word has length 393 [2025-03-16 15:08:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:51,586 INFO L471 AbstractCegarLoop]: Abstraction has 6979 states and 7730 transitions. [2025-03-16 15:08:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 6979 states and 7730 transitions. [2025-03-16 15:08:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-16 15:08:51,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:51,592 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:51,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:08:51,793 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,SelfDestructingSolverStorable6 [2025-03-16 15:08:51,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:51,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1556110718, now seen corresponding path program 1 times [2025-03-16 15:08:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904928759] [2025-03-16 15:08:51,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:51,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-16 15:08:51,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-16 15:08:51,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:51,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:08:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904928759] [2025-03-16 15:08:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904928759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:52,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470160074] [2025-03-16 15:08:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:52,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:52,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:52,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:52,085 INFO L87 Difference]: Start difference. First operand 6979 states and 7730 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:52,930 INFO L93 Difference]: Finished difference Result 15754 states and 17662 transitions. [2025-03-16 15:08:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 424 [2025-03-16 15:08:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:52,947 INFO L225 Difference]: With dead ends: 15754 [2025-03-16 15:08:52,947 INFO L226 Difference]: Without dead ends: 8776 [2025-03-16 15:08:52,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:52,952 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 277 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:52,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 547 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:08:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8776 states. [2025-03-16 15:08:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8776 to 8774. [2025-03-16 15:08:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8774 states, 8773 states have (on average 1.086743417303089) internal successors, (9534), 8773 states have internal predecessors, (9534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 9534 transitions. [2025-03-16 15:08:53,030 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 9534 transitions. Word has length 424 [2025-03-16 15:08:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:53,031 INFO L471 AbstractCegarLoop]: Abstraction has 8774 states and 9534 transitions. [2025-03-16 15:08:53,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 9534 transitions. [2025-03-16 15:08:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-03-16 15:08:53,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:53,038 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:53,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:08:53,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1888928444, now seen corresponding path program 1 times [2025-03-16 15:08:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:53,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345409287] [2025-03-16 15:08:53,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:53,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-03-16 15:08:53,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-03-16 15:08:53,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-16 15:08:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345409287] [2025-03-16 15:08:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345409287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:53,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:53,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:53,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349362062] [2025-03-16 15:08:53,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:53,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:53,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:53,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:53,315 INFO L87 Difference]: Start difference. First operand 8774 states and 9534 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:53,984 INFO L93 Difference]: Finished difference Result 17545 states and 19109 transitions. [2025-03-16 15:08:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 548 [2025-03-16 15:08:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:53,997 INFO L225 Difference]: With dead ends: 17545 [2025-03-16 15:08:53,997 INFO L226 Difference]: Without dead ends: 9071 [2025-03-16 15:08:54,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:54,004 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:54,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:08:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9071 states. [2025-03-16 15:08:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9071 to 8772. [2025-03-16 15:08:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8772 states, 8771 states have (on average 1.0865351727283092) internal successors, (9530), 8771 states have internal predecessors, (9530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 9530 transitions. [2025-03-16 15:08:54,067 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 9530 transitions. Word has length 548 [2025-03-16 15:08:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:54,067 INFO L471 AbstractCegarLoop]: Abstraction has 8772 states and 9530 transitions. [2025-03-16 15:08:54,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 9530 transitions. [2025-03-16 15:08:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-16 15:08:54,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:54,076 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:54,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:08:54,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:54,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash 976889072, now seen corresponding path program 1 times [2025-03-16 15:08:54,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:54,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872314945] [2025-03-16 15:08:54,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:54,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-16 15:08:54,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-16 15:08:54,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:54,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 15:08:54,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872314945] [2025-03-16 15:08:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872314945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:54,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:54,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933307294] [2025-03-16 15:08:54,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:54,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:54,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:54,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:54,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:54,369 INFO L87 Difference]: Start difference. First operand 8772 states and 9530 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:55,133 INFO L93 Difference]: Finished difference Result 20263 states and 22046 transitions. [2025-03-16 15:08:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-16 15:08:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:55,150 INFO L225 Difference]: With dead ends: 20263 [2025-03-16 15:08:55,150 INFO L226 Difference]: Without dead ends: 11492 [2025-03-16 15:08:55,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:55,157 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 288 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:55,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 246 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:08:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11492 states. [2025-03-16 15:08:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11492 to 9373. [2025-03-16 15:08:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9373 states, 9372 states have (on average 1.083760136577038) internal successors, (10157), 9372 states have internal predecessors, (10157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9373 states to 9373 states and 10157 transitions. [2025-03-16 15:08:55,269 INFO L78 Accepts]: Start accepts. Automaton has 9373 states and 10157 transitions. Word has length 574 [2025-03-16 15:08:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 9373 states and 10157 transitions. [2025-03-16 15:08:55,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9373 states and 10157 transitions. [2025-03-16 15:08:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-16 15:08:55,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:55,273 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:55,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:08:55,273 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:55,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash 279668671, now seen corresponding path program 1 times [2025-03-16 15:08:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049528180] [2025-03-16 15:08:55,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:55,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-16 15:08:55,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-16 15:08:55,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:55,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 242 proven. 188 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-16 15:08:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:55,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049528180] [2025-03-16 15:08:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049528180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:55,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552628648] [2025-03-16 15:08:55,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:55,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:55,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:08:55,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:08:55,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-16 15:08:56,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-16 15:08:56,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:56,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:56,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:08:56,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:08:56,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:56,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552628648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:56,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:56,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:08:56,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059646911] [2025-03-16 15:08:56,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:56,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:08:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:56,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:08:56,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:08:56,567 INFO L87 Difference]: Start difference. First operand 9373 states and 10157 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:57,677 INFO L93 Difference]: Finished difference Result 25997 states and 28536 transitions. [2025-03-16 15:08:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:08:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 582 [2025-03-16 15:08:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:57,699 INFO L225 Difference]: With dead ends: 25997 [2025-03-16 15:08:57,699 INFO L226 Difference]: Without dead ends: 16924 [2025-03-16 15:08:57,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:08:57,708 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 638 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:57,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 155 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:08:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16924 states. [2025-03-16 15:08:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16924 to 14522. [2025-03-16 15:08:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14522 states, 14521 states have (on average 1.0981337373459128) internal successors, (15946), 14521 states have internal predecessors, (15946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14522 states to 14522 states and 15946 transitions. [2025-03-16 15:08:57,842 INFO L78 Accepts]: Start accepts. Automaton has 14522 states and 15946 transitions. Word has length 582 [2025-03-16 15:08:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 14522 states and 15946 transitions. [2025-03-16 15:08:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 14522 states and 15946 transitions. [2025-03-16 15:08:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-16 15:08:57,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:57,847 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:57,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:08:58,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:58,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:58,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1443279134, now seen corresponding path program 1 times [2025-03-16 15:08:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:58,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115252164] [2025-03-16 15:08:58,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:58,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-16 15:08:58,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-16 15:08:58,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:58,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-16 15:08:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115252164] [2025-03-16 15:08:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115252164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:58,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762456476] [2025-03-16 15:08:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:58,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:58,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:58,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:58,269 INFO L87 Difference]: Start difference. First operand 14522 states and 15946 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:59,186 INFO L93 Difference]: Finished difference Result 32926 states and 36474 transitions. [2025-03-16 15:08:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:59,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 585 [2025-03-16 15:08:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:59,213 INFO L225 Difference]: With dead ends: 32926 [2025-03-16 15:08:59,213 INFO L226 Difference]: Without dead ends: 19305 [2025-03-16 15:08:59,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:59,228 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 301 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:59,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 173 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:08:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19305 states. [2025-03-16 15:08:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19305 to 17508. [2025-03-16 15:08:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17508 states, 17507 states have (on average 1.0956760153081624) internal successors, (19182), 17507 states have internal predecessors, (19182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17508 states to 17508 states and 19182 transitions. [2025-03-16 15:08:59,385 INFO L78 Accepts]: Start accepts. Automaton has 17508 states and 19182 transitions. Word has length 585 [2025-03-16 15:08:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:59,386 INFO L471 AbstractCegarLoop]: Abstraction has 17508 states and 19182 transitions. [2025-03-16 15:08:59,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17508 states and 19182 transitions. [2025-03-16 15:08:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-16 15:08:59,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:59,390 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:59,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:08:59,391 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:59,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 561477256, now seen corresponding path program 1 times [2025-03-16 15:08:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302753337] [2025-03-16 15:08:59,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:59,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-16 15:08:59,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-16 15:08:59,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:59,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2025-03-16 15:08:59,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:59,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302753337] [2025-03-16 15:08:59,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302753337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:59,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:59,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819708821] [2025-03-16 15:08:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:59,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:59,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:59,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:59,870 INFO L87 Difference]: Start difference. First operand 17508 states and 19182 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:00,562 INFO L93 Difference]: Finished difference Result 37703 states and 41747 transitions. [2025-03-16 15:09:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:00,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 626 [2025-03-16 15:09:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:00,591 INFO L225 Difference]: With dead ends: 37703 [2025-03-16 15:09:00,591 INFO L226 Difference]: Without dead ends: 21096 [2025-03-16 15:09:00,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:00,602 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 305 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:00,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 156 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:09:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21096 states. [2025-03-16 15:09:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21096 to 20796. [2025-03-16 15:09:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20796 states, 20795 states have (on average 1.1012743447944218) internal successors, (22901), 20795 states have internal predecessors, (22901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20796 states to 20796 states and 22901 transitions. [2025-03-16 15:09:00,772 INFO L78 Accepts]: Start accepts. Automaton has 20796 states and 22901 transitions. Word has length 626 [2025-03-16 15:09:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:00,772 INFO L471 AbstractCegarLoop]: Abstraction has 20796 states and 22901 transitions. [2025-03-16 15:09:00,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20796 states and 22901 transitions. [2025-03-16 15:09:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-03-16 15:09:00,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:00,784 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:09:00,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:00,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1246596337, now seen corresponding path program 1 times [2025-03-16 15:09:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429576961] [2025-03-16 15:09:00,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:00,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-16 15:09:00,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-16 15:09:00,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:00,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-16 15:09:01,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:01,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429576961] [2025-03-16 15:09:01,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429576961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:01,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:01,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:01,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003589059] [2025-03-16 15:09:01,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:01,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:01,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:01,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:01,184 INFO L87 Difference]: Start difference. First operand 20796 states and 22901 transitions. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:01,892 INFO L93 Difference]: Finished difference Result 41292 states and 45500 transitions. [2025-03-16 15:09:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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 756 [2025-03-16 15:09:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:01,914 INFO L225 Difference]: With dead ends: 41292 [2025-03-16 15:09:01,914 INFO L226 Difference]: Without dead ends: 20796 [2025-03-16 15:09:01,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:01,927 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 226 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:01,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 507 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:09:01,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20796 states. [2025-03-16 15:09:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20796 to 20796. [2025-03-16 15:09:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20796 states, 20795 states have (on average 1.0737677326280355) internal successors, (22329), 20795 states have internal predecessors, (22329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20796 states to 20796 states and 22329 transitions. [2025-03-16 15:09:02,092 INFO L78 Accepts]: Start accepts. Automaton has 20796 states and 22329 transitions. Word has length 756 [2025-03-16 15:09:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:02,093 INFO L471 AbstractCegarLoop]: Abstraction has 20796 states and 22329 transitions. [2025-03-16 15:09:02,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 20796 states and 22329 transitions. [2025-03-16 15:09:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2025-03-16 15:09:02,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:02,102 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:02,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:09:02,102 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:02,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash -138944290, now seen corresponding path program 1 times [2025-03-16 15:09:02,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:02,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95412038] [2025-03-16 15:09:02,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:02,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:02,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 758 statements into 1 equivalence classes. [2025-03-16 15:09:02,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 758 of 758 statements. [2025-03-16 15:09:02,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:02,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-16 15:09:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95412038] [2025-03-16 15:09:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95412038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:09:02,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:09:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:09:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233071438] [2025-03-16 15:09:02,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:02,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:09:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:02,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:09:02,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:02,353 INFO L87 Difference]: Start difference. First operand 20796 states and 22329 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:02,986 INFO L93 Difference]: Finished difference Result 42182 states and 45355 transitions. [2025-03-16 15:09:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:09:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 758 [2025-03-16 15:09:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:03,008 INFO L225 Difference]: With dead ends: 42182 [2025-03-16 15:09:03,008 INFO L226 Difference]: Without dead ends: 22885 [2025-03-16 15:09:03,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:09:03,023 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 364 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:03,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 421 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:09:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22885 states. [2025-03-16 15:09:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22885 to 11458. [2025-03-16 15:09:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11458 states, 11457 states have (on average 1.0705245701317971) internal successors, (12265), 11457 states have internal predecessors, (12265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11458 states to 11458 states and 12265 transitions. [2025-03-16 15:09:03,145 INFO L78 Accepts]: Start accepts. Automaton has 11458 states and 12265 transitions. Word has length 758 [2025-03-16 15:09:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:03,145 INFO L471 AbstractCegarLoop]: Abstraction has 11458 states and 12265 transitions. [2025-03-16 15:09:03,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11458 states and 12265 transitions. [2025-03-16 15:09:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2025-03-16 15:09:03,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:03,151 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:03,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:09:03,152 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:03,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1417505807, now seen corresponding path program 1 times [2025-03-16 15:09:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:03,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900923343] [2025-03-16 15:09:03,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:03,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 773 statements into 1 equivalence classes. [2025-03-16 15:09:03,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 773 of 773 statements. [2025-03-16 15:09:03,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:03,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 621 proven. 188 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-16 15:09:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900923343] [2025-03-16 15:09:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900923343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287387229] [2025-03-16 15:09:03,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:03,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:03,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:03,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:09:03,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:09:04,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 773 statements into 1 equivalence classes. [2025-03-16 15:09:04,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 773 of 773 statements. [2025-03-16 15:09:04,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:04,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:04,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:09:04,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 667 proven. 122 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-16 15:09:04,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:09:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-16 15:09:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287387229] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:05,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:09:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 10 [2025-03-16 15:09:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909020856] [2025-03-16 15:09:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:09:05,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:09:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:05,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:09:05,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:09:05,511 INFO L87 Difference]: Start difference. First operand 11458 states and 12265 transitions. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:06,938 INFO L93 Difference]: Finished difference Result 29229 states and 31418 transitions. [2025-03-16 15:09:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:09:06,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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 773 [2025-03-16 15:09:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:06,958 INFO L225 Difference]: With dead ends: 29229 [2025-03-16 15:09:06,958 INFO L226 Difference]: Without dead ends: 17772 [2025-03-16 15:09:06,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1548 GetRequests, 1540 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:09:06,968 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 440 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:06,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 90 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:09:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17772 states. [2025-03-16 15:09:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17772 to 17746. [2025-03-16 15:09:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17746 states, 17745 states have (on average 1.0628346012961398) internal successors, (18860), 17745 states have internal predecessors, (18860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17746 states to 17746 states and 18860 transitions. [2025-03-16 15:09:07,130 INFO L78 Accepts]: Start accepts. Automaton has 17746 states and 18860 transitions. Word has length 773 [2025-03-16 15:09:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:07,131 INFO L471 AbstractCegarLoop]: Abstraction has 17746 states and 18860 transitions. [2025-03-16 15:09:07,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 17746 states and 18860 transitions. [2025-03-16 15:09:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2025-03-16 15:09:07,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:09:07,148 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:09:07,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:09:07,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 15:09:07,348 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:09:07,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:09:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -381441613, now seen corresponding path program 1 times [2025-03-16 15:09:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:09:07,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589807309] [2025-03-16 15:09:07,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:09:07,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1031 statements into 1 equivalence classes. [2025-03-16 15:09:07,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1031 of 1031 statements. [2025-03-16 15:09:07,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:07,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 1296 proven. 41 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-16 15:09:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:09:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589807309] [2025-03-16 15:09:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589807309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:09:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477766569] [2025-03-16 15:09:08,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:09:08,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:09:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:09:08,481 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:09:08,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:09:08,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1031 statements into 1 equivalence classes. [2025-03-16 15:09:08,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1031 of 1031 statements. [2025-03-16 15:09:08,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:09:08,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:09:08,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:09:08,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:09:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 793 proven. 46 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-03-16 15:09:08,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:09:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 793 proven. 46 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-03-16 15:09:09,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477766569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:09:09,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:09:09,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2025-03-16 15:09:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370290429] [2025-03-16 15:09:09,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:09:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:09:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:09:09,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:09:09,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:09:09,198 INFO L87 Difference]: Start difference. First operand 17746 states and 18860 transitions. Second operand has 10 states, 10 states have (on average 130.8) internal successors, (1308), 10 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:09:18,072 INFO L93 Difference]: Finished difference Result 44554 states and 47430 transitions. [2025-03-16 15:09:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-16 15:09:18,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 130.8) internal successors, (1308), 10 states have internal predecessors, (1308), 0 states have call successors, (0), 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 1031 [2025-03-16 15:09:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:09:18,073 INFO L225 Difference]: With dead ends: 44554 [2025-03-16 15:09:18,073 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:09:18,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2117 GetRequests, 2077 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 15:09:18,082 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 2945 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 21852 mSolverCounterSat, 671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2945 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 22523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 671 IncrementalHoareTripleChecker+Valid, 21852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:09:18,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2945 Valid, 508 Invalid, 22523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [671 Valid, 21852 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2025-03-16 15:09:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:09:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:09:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:09:18,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1031 [2025-03-16 15:09:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:09:18,083 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:09:18,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 130.8) internal successors, (1308), 10 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:09:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:09:18,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:09:18,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:09:18,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:09:18,286 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,SelfDestructingSolverStorable16 [2025-03-16 15:09:18,289 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:09:18,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:09:20,610 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:09:20,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:09:20 BoogieIcfgContainer [2025-03-16 15:09:20,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:09:20,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:09:20,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:09:20,638 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:09:20,639 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:08:35" (3/4) ... [2025-03-16 15:09:20,640 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:09:20,671 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:09:20,673 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:09:20,675 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:09:20,676 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:09:20,852 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:09:20,853 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:09:20,853 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:09:20,854 INFO L158 Benchmark]: Toolchain (without parser) took 48074.57ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 98.8MB in the beginning and 140.2MB in the end (delta: -41.4MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2025-03-16 15:09:20,855 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:09:20,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.90ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 86.0MB in the end (delta: 12.8MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2025-03-16 15:09:20,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.76ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 48.8MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:09:20,855 INFO L158 Benchmark]: Boogie Preprocessor took 230.43ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 74.5MB in the end (delta: -25.7MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2025-03-16 15:09:20,856 INFO L158 Benchmark]: IcfgBuilder took 1954.22ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 74.5MB in the beginning and 199.8MB in the end (delta: -125.4MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. [2025-03-16 15:09:20,856 INFO L158 Benchmark]: TraceAbstraction took 44881.71ms. Allocated memory was 360.7MB in the beginning and 285.2MB in the end (delta: -75.5MB). Free memory was 196.5MB in the beginning and 165.4MB in the end (delta: 31.1MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. [2025-03-16 15:09:20,856 INFO L158 Benchmark]: Witness Printer took 215.42ms. Allocated memory is still 285.2MB. Free memory was 165.4MB in the beginning and 140.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:09:20,857 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.16ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.90ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 86.0MB in the end (delta: 12.8MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.76ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 48.8MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 230.43ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 74.5MB in the end (delta: -25.7MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * IcfgBuilder took 1954.22ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 74.5MB in the beginning and 199.8MB in the end (delta: -125.4MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. * TraceAbstraction took 44881.71ms. Allocated memory was 360.7MB in the beginning and 285.2MB in the end (delta: -75.5MB). Free memory was 196.5MB in the beginning and 165.4MB in the end (delta: 31.1MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. * Witness Printer took 215.42ms. Allocated memory is still 285.2MB. Free memory was 165.4MB in the beginning and 140.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 161]: 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, 363 locations, 688 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.5s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 28.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10520 SdHoareTripleChecker+Valid, 26.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10520 mSDsluCounter, 5361 SdHoareTripleChecker+Invalid, 22.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1226 mSDsCounter, 3863 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44362 IncrementalHoareTripleChecker+Invalid, 48225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3863 mSolverCounterUnsat, 4135 mSDtfsCounter, 44362 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5118 GetRequests, 5034 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20796occurred in iteration=13, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 19300 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 10918 NumberOfCodeBlocks, 10918 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 12911 ConstructedInterpolants, 0 QuantifiedInterpolants, 55030 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3595 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 13550/14379 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: 1776]: Location Invariant Derived location invariant: ((((((((((((((long long) 42 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0)) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (a2 == 4))) || (((((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 != 4)) && (((long long) a0 + 61) <= 0))) || ((44 <= a29) && (((long long) 89 + a4) <= 0))) || (((((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 42 + a4) <= 0)) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 != 4))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 127) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((long long) a0 + 61) <= 0) && (a2 <= 2))) || ((a2 == 1) && (((long long) a4 + 86) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:09:20,879 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