./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Problem16_label11.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 ad24518eb48bdb2cd9eb62c6c7c8e6761cdaf552ed2e2f0623280cf19933d94d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:03:43,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:03:43,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:03:43,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:03:43,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:03:43,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:03:43,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:03:43,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:03:43,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:03:43,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:03:43,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:03:43,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:03:43,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:03:43,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:03:43,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:03:43,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:03:43,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:03:43,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:03:43,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:03:43,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:03:43,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:03:43,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:03:43,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:03:43,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:03:43,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:03:43,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:03:43,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:03:43,156 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 -> ad24518eb48bdb2cd9eb62c6c7c8e6761cdaf552ed2e2f0623280cf19933d94d [2025-03-08 02:03:43,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:03:43,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:03:43,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:03:43,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:03:43,387 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:03:43,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label11.c [2025-03-08 02:03:44,500 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2aac0199/a3aadd52aadd43939b6e92187f4f4d81/FLAG52bbb543b [2025-03-08 02:03:44,848 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:03:44,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label11.c [2025-03-08 02:03:44,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2aac0199/a3aadd52aadd43939b6e92187f4f4d81/FLAG52bbb543b [2025-03-08 02:03:45,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2aac0199/a3aadd52aadd43939b6e92187f4f4d81 [2025-03-08 02:03:45,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:03:45,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:03:45,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:03:45,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:03:45,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:03:45,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69eed51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45, skipping insertion in model container [2025-03-08 02:03:45,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:03:45,239 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/Problem16_label11.c[5798,5811] [2025-03-08 02:03:45,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:03:45,427 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:03:45,440 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/Problem16_label11.c[5798,5811] [2025-03-08 02:03:45,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:03:45,564 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:03:45,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45 WrapperNode [2025-03-08 02:03:45,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:03:45,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:03:45,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:03:45,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:03:45,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,699 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:03:45,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:03:45,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:03:45,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:03:45,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:03:45,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,765 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-08 02:03:45,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:03:45,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:03:45,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:03:45,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:03:45,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (1/1) ... [2025-03-08 02:03:45,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:03:45,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:03:45,862 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-08 02:03:45,867 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-08 02:03:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:03:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:03:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:03:45,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:03:45,929 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:03:45,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:03:47,601 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:03:47,678 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:03:47,678 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:03:47,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:03:47,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:03:47,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:47 BoogieIcfgContainer [2025-03-08 02:03:47,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:03:47,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:03:47,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:03:47,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:03:47,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:03:45" (1/3) ... [2025-03-08 02:03:47,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4581db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:03:47, skipping insertion in model container [2025-03-08 02:03:47,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:45" (2/3) ... [2025-03-08 02:03:47,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4581db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:03:47, skipping insertion in model container [2025-03-08 02:03:47,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:47" (3/3) ... [2025-03-08 02:03:47,711 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label11.c [2025-03-08 02:03:47,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:03:47,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label11.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:03:47,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:03:47,788 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;@138df0e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:03:47,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:03:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 02:03:47,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:47,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:47,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:47,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash -799095375, now seen corresponding path program 1 times [2025-03-08 02:03:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937469755] [2025-03-08 02:03:47,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:47,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 02:03:47,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 02:03:47,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:47,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:48,105 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-08 02:03:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937469755] [2025-03-08 02:03:48,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937469755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:48,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:48,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898982675] [2025-03-08 02:03:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:48,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:48,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:48,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:48,129 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:49,386 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-03-08 02:03:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:49,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 02:03:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:49,398 INFO L225 Difference]: With dead ends: 1137 [2025-03-08 02:03:49,398 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:03:49,400 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-08 02:03:49,405 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 331 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:49,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 60 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:03:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:03:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:03:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7639939485627836) internal successors, (1166), 661 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2025-03-08 02:03:49,466 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 55 [2025-03-08 02:03:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:49,466 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2025-03-08 02:03:49,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2025-03-08 02:03:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 02:03:49,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:49,469 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, 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] [2025-03-08 02:03:49,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:03:49,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:49,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1137830879, now seen corresponding path program 1 times [2025-03-08 02:03:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:49,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224554486] [2025-03-08 02:03:49,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:49,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 02:03:49,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 02:03:49,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:49,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224554486] [2025-03-08 02:03:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224554486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343850504] [2025-03-08 02:03:49,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:49,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:49,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:49,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:49,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:49,647 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:50,649 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2025-03-08 02:03:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-08 02:03:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:50,654 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 02:03:50,654 INFO L226 Difference]: Without dead ends: 1320 [2025-03-08 02:03:50,655 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-08 02:03:50,656 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:50,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:03:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-08 02:03:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-08 02:03:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.6656557998483699) internal successors, (2197), 1319 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2025-03-08 02:03:50,685 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 120 [2025-03-08 02:03:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:50,685 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2025-03-08 02:03:50,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2025-03-08 02:03:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 02:03:50,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:50,687 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, 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] [2025-03-08 02:03:50,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:03:50,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1034183396, now seen corresponding path program 1 times [2025-03-08 02:03:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879020004] [2025-03-08 02:03:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:50,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 02:03:50,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 02:03:50,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:50,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:50,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:50,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879020004] [2025-03-08 02:03:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879020004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:50,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:50,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:50,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16664454] [2025-03-08 02:03:50,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:50,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:03:50,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:50,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:03:50,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:03:50,933 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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-08 02:03:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:52,625 INFO L93 Difference]: Finished difference Result 3625 states and 5926 transitions. [2025-03-08 02:03:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:03:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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-08 02:03:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:52,636 INFO L225 Difference]: With dead ends: 3625 [2025-03-08 02:03:52,637 INFO L226 Difference]: Without dead ends: 2307 [2025-03-08 02:03:52,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:03:52,644 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1005 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:52,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 41 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:03:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-08 02:03:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-08 02:03:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.5034692107545533) internal successors, (3467), 2306 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3467 transitions. [2025-03-08 02:03:52,677 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3467 transitions. Word has length 123 [2025-03-08 02:03:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:52,678 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3467 transitions. [2025-03-08 02:03:52,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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-08 02:03:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3467 transitions. [2025-03-08 02:03:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 02:03:52,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:52,680 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, 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] [2025-03-08 02:03:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:03:52,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2055081142, now seen corresponding path program 1 times [2025-03-08 02:03:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759569111] [2025-03-08 02:03:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:52,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:52,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 02:03:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 02:03:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 02:03:52,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:52,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759569111] [2025-03-08 02:03:52,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759569111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:52,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:52,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363328109] [2025-03-08 02:03:52,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:52,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:52,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:52,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:52,837 INFO L87 Difference]: Start difference. First operand 2307 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:53,838 INFO L93 Difference]: Finished difference Result 6257 states and 9726 transitions. [2025-03-08 02:03:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:53,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 142 [2025-03-08 02:03:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:53,849 INFO L225 Difference]: With dead ends: 6257 [2025-03-08 02:03:53,849 INFO L226 Difference]: Without dead ends: 4281 [2025-03-08 02:03:53,852 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-08 02:03:53,852 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 270 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:53,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 211 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:03:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-08 02:03:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-03-08 02:03:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.3539719626168225) internal successors, (5795), 4280 states have internal predecessors, (5795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5795 transitions. [2025-03-08 02:03:53,910 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5795 transitions. Word has length 142 [2025-03-08 02:03:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5795 transitions. [2025-03-08 02:03:53,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5795 transitions. [2025-03-08 02:03:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-08 02:03:53,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:53,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:53,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:03:53,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:53,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash -779246289, now seen corresponding path program 1 times [2025-03-08 02:03:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:53,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390178299] [2025-03-08 02:03:53,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:53,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 02:03:53,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 02:03:53,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:53,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:54,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390178299] [2025-03-08 02:03:54,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390178299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:54,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:54,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:54,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428356236] [2025-03-08 02:03:54,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:54,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:54,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:54,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:54,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:54,067 INFO L87 Difference]: Start difference. First operand 4281 states and 5795 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:54,947 INFO L93 Difference]: Finished difference Result 9547 states and 12996 transitions. [2025-03-08 02:03:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-03-08 02:03:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:54,959 INFO L225 Difference]: With dead ends: 9547 [2025-03-08 02:03:54,959 INFO L226 Difference]: Without dead ends: 5597 [2025-03-08 02:03:54,963 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-08 02:03:54,965 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 281 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:54,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 545 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:03:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-08 02:03:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-03-08 02:03:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.2977126518942101) internal successors, (7262), 5596 states have internal predecessors, (7262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 7262 transitions. [2025-03-08 02:03:55,037 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 7262 transitions. Word has length 238 [2025-03-08 02:03:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:55,038 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 7262 transitions. [2025-03-08 02:03:55,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 7262 transitions. [2025-03-08 02:03:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-08 02:03:55,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:55,043 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:55,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:03:55,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:55,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash 848356269, now seen corresponding path program 1 times [2025-03-08 02:03:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:55,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659255705] [2025-03-08 02:03:55,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:55,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-08 02:03:55,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-08 02:03:55,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:55,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-08 02:03:55,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:55,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659255705] [2025-03-08 02:03:55,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659255705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:55,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:55,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:55,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109357795] [2025-03-08 02:03:55,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:55,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:55,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:55,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:55,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:55,256 INFO L87 Difference]: Start difference. First operand 5597 states and 7262 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:56,259 INFO L93 Difference]: Finished difference Result 14153 states and 18440 transitions. [2025-03-08 02:03:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:56,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 322 [2025-03-08 02:03:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:56,276 INFO L225 Difference]: With dead ends: 14153 [2025-03-08 02:03:56,276 INFO L226 Difference]: Without dead ends: 7900 [2025-03-08 02:03:56,281 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-08 02:03:56,282 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:56,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:03:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-03-08 02:03:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 6913. [2025-03-08 02:03:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.0727719907407407) internal successors, (7415), 6912 states have internal predecessors, (7415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7415 transitions. [2025-03-08 02:03:56,397 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7415 transitions. Word has length 322 [2025-03-08 02:03:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:56,397 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 7415 transitions. [2025-03-08 02:03:56,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7415 transitions. [2025-03-08 02:03:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-08 02:03:56,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:56,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:03:56,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:03:56,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:56,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -355601055, now seen corresponding path program 1 times [2025-03-08 02:03:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:56,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938140807] [2025-03-08 02:03:56,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:56,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-08 02:03:56,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-08 02:03:56,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:56,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 02:03:56,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:56,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938140807] [2025-03-08 02:03:56,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938140807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:56,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:56,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:56,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665927750] [2025-03-08 02:03:56,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:56,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:56,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:56,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:56,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:56,789 INFO L87 Difference]: Start difference. First operand 6913 states and 7415 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:57,548 INFO L93 Difference]: Finished difference Result 16785 states and 18059 transitions. [2025-03-08 02:03:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:57,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 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 386 [2025-03-08 02:03:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:57,579 INFO L225 Difference]: With dead ends: 16785 [2025-03-08 02:03:57,579 INFO L226 Difference]: Without dead ends: 10203 [2025-03-08 02:03:57,586 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-08 02:03:57,586 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:57,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 45 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:03:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2025-03-08 02:03:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 9874. [2025-03-08 02:03:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9874 states, 9873 states have (on average 1.0731287349336573) internal successors, (10595), 9873 states have internal predecessors, (10595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10595 transitions. [2025-03-08 02:03:57,685 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10595 transitions. Word has length 386 [2025-03-08 02:03:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:57,686 INFO L471 AbstractCegarLoop]: Abstraction has 9874 states and 10595 transitions. [2025-03-08 02:03:57,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10595 transitions. [2025-03-08 02:03:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-08 02:03:57,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:57,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:03:57,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:03:57,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:57,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1420498165, now seen corresponding path program 1 times [2025-03-08 02:03:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586780200] [2025-03-08 02:03:57,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:57,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-08 02:03:57,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-08 02:03:57,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:57,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 02:03:57,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:57,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586780200] [2025-03-08 02:03:57,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586780200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:57,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050827193] [2025-03-08 02:03:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:57,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:57,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:57,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:57,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:57,912 INFO L87 Difference]: Start difference. First operand 9874 states and 10595 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:58,574 INFO L93 Difference]: Finished difference Result 23036 states and 24793 transitions. [2025-03-08 02:03:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:58,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 394 [2025-03-08 02:03:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:58,593 INFO L225 Difference]: With dead ends: 23036 [2025-03-08 02:03:58,593 INFO L226 Difference]: Without dead ends: 13493 [2025-03-08 02:03:58,602 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-08 02:03:58,602 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 294 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:58,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 40 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:03:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-08 02:03:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 11848. [2025-03-08 02:03:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0697222925635181) internal successors, (12673), 11847 states have internal predecessors, (12673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12673 transitions. [2025-03-08 02:03:58,728 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12673 transitions. Word has length 394 [2025-03-08 02:03:58,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:58,728 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12673 transitions. [2025-03-08 02:03:58,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12673 transitions. [2025-03-08 02:03:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 02:03:58,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:58,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:03:58,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:03:58,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:58,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash 912615740, now seen corresponding path program 1 times [2025-03-08 02:03:58,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:58,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109489496] [2025-03-08 02:03:58,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:58,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:58,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 02:03:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 02:03:58,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:58,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-08 02:03:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109489496] [2025-03-08 02:03:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109489496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:59,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:59,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492298293] [2025-03-08 02:03:59,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:59,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:59,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:59,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:59,019 INFO L87 Difference]: Start difference. First operand 11848 states and 12673 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:59,736 INFO L93 Difference]: Finished difference Result 25997 states and 27870 transitions. [2025-03-08 02:03:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:59,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 448 [2025-03-08 02:03:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:59,758 INFO L225 Difference]: With dead ends: 25997 [2025-03-08 02:03:59,759 INFO L226 Difference]: Without dead ends: 14151 [2025-03-08 02:03:59,768 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-08 02:03:59,771 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 279 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:59,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 435 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:03:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-08 02:03:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2025-03-08 02:03:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.063888285941683) internal successors, (14704), 13821 states have internal predecessors, (14704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14704 transitions. [2025-03-08 02:03:59,900 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14704 transitions. Word has length 448 [2025-03-08 02:03:59,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:59,900 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14704 transitions. [2025-03-08 02:03:59,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14704 transitions. [2025-03-08 02:03:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-08 02:03:59,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:59,907 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:03:59,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:03:59,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:59,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:59,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1254079447, now seen corresponding path program 1 times [2025-03-08 02:03:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:59,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689864647] [2025-03-08 02:03:59,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:59,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-08 02:04:00,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-08 02:04:00,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:00,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-08 02:04:00,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689864647] [2025-03-08 02:04:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689864647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058948007] [2025-03-08 02:04:00,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:00,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:00,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:00,315 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-08 02:04:00,344 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-08 02:04:00,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-08 02:04:00,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-08 02:04:00,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:00,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:00,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:04:00,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2025-03-08 02:04:00,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:04:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058948007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:04:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 02:04:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667810281] [2025-03-08 02:04:00,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:00,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:00,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:00,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:00,989 INFO L87 Difference]: Start difference. First operand 13822 states and 14704 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:01,593 INFO L93 Difference]: Finished difference Result 15798 states and 16730 transitions. [2025-03-08 02:04:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 509 [2025-03-08 02:04:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:01,608 INFO L225 Difference]: With dead ends: 15798 [2025-03-08 02:04:01,608 INFO L226 Difference]: Without dead ends: 15796 [2025-03-08 02:04:01,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:01,612 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:01,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:01,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-03-08 02:04:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 14151. [2025-03-08 02:04:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0630388692579504) internal successors, (15042), 14150 states have internal predecessors, (15042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 15042 transitions. [2025-03-08 02:04:01,763 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 15042 transitions. Word has length 509 [2025-03-08 02:04:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:01,763 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 15042 transitions. [2025-03-08 02:04:01,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 15042 transitions. [2025-03-08 02:04:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-03-08 02:04:01,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:01,773 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:01,780 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-08 02:04:01,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 02:04:01,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:01,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash 300392895, now seen corresponding path program 1 times [2025-03-08 02:04:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:01,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330412539] [2025-03-08 02:04:01,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:02,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-03-08 02:04:02,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-03-08 02:04:02,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:02,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-08 02:04:02,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:02,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330412539] [2025-03-08 02:04:02,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330412539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:02,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:02,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:04:02,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890358375] [2025-03-08 02:04:02,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:02,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:02,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:02,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:02,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:02,749 INFO L87 Difference]: Start difference. First operand 14151 states and 15042 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 2 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:03,360 INFO L93 Difference]: Finished difference Result 28300 states and 30088 transitions. [2025-03-08 02:04:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:03,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 2 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 849 [2025-03-08 02:04:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:03,377 INFO L225 Difference]: With dead ends: 28300 [2025-03-08 02:04:03,378 INFO L226 Difference]: Without dead ends: 14480 [2025-03-08 02:04:03,388 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-08 02:04:03,389 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:03,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 102 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-08 02:04:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2025-03-08 02:04:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.062089923337247) internal successors, (15378), 14479 states have internal predecessors, (15378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15378 transitions. [2025-03-08 02:04:03,501 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15378 transitions. Word has length 849 [2025-03-08 02:04:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:03,501 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15378 transitions. [2025-03-08 02:04:03,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 2 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15378 transitions. [2025-03-08 02:04:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2025-03-08 02:04:03,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:03,555 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:03,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:04:03,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:03,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -90749013, now seen corresponding path program 1 times [2025-03-08 02:04:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286522860] [2025-03-08 02:04:03,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:03,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-03-08 02:04:03,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-03-08 02:04:03,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:03,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-08 02:04:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:03,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286522860] [2025-03-08 02:04:03,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286522860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:03,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:03,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723280851] [2025-03-08 02:04:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:03,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:03,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:03,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:03,892 INFO L87 Difference]: Start difference. First operand 14480 states and 15378 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:04,582 INFO L93 Difference]: Finished difference Result 28300 states and 30087 transitions. [2025-03-08 02:04:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:04,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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 857 [2025-03-08 02:04:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:04,598 INFO L225 Difference]: With dead ends: 28300 [2025-03-08 02:04:04,599 INFO L226 Difference]: Without dead ends: 14480 [2025-03-08 02:04:04,608 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-08 02:04:04,609 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:04,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 427 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-08 02:04:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151. [2025-03-08 02:04:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0454416961130741) internal successors, (14793), 14150 states have internal predecessors, (14793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14793 transitions. [2025-03-08 02:04:04,759 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14793 transitions. Word has length 857 [2025-03-08 02:04:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:04,759 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14793 transitions. [2025-03-08 02:04:04,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14793 transitions. [2025-03-08 02:04:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2025-03-08 02:04:04,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:04,768 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:04:04,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:04,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash -833068351, now seen corresponding path program 1 times [2025-03-08 02:04:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461423949] [2025-03-08 02:04:04,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:04,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:04,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 858 statements into 1 equivalence classes. [2025-03-08 02:04:04,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 858 of 858 statements. [2025-03-08 02:04:04,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:04,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 716 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-03-08 02:04:05,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:05,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461423949] [2025-03-08 02:04:05,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461423949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:05,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:05,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066055405] [2025-03-08 02:04:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:05,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:05,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:05,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:05,414 INFO L87 Difference]: Start difference. First operand 14151 states and 14793 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:06,028 INFO L93 Difference]: Finished difference Result 29945 states and 31355 transitions. [2025-03-08 02:04:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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 858 [2025-03-08 02:04:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:06,042 INFO L225 Difference]: With dead ends: 29945 [2025-03-08 02:04:06,042 INFO L226 Difference]: Without dead ends: 16454 [2025-03-08 02:04:06,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 02:04:06,050 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 206 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:06,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 54 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-08 02:04:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-03-08 02:04:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.045098158390567) internal successors, (17195), 16453 states have internal predecessors, (17195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17195 transitions. [2025-03-08 02:04:06,176 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17195 transitions. Word has length 858 [2025-03-08 02:04:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:06,176 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17195 transitions. [2025-03-08 02:04:06,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17195 transitions. [2025-03-08 02:04:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2025-03-08 02:04:06,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:06,186 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:04:06,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:04:06,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:06,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:06,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1696213924, now seen corresponding path program 1 times [2025-03-08 02:04:06,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:06,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234008319] [2025-03-08 02:04:06,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:06,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 912 statements into 1 equivalence classes. [2025-03-08 02:04:06,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 912 of 912 statements. [2025-03-08 02:04:06,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:06,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 526 proven. 660 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-08 02:04:07,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234008319] [2025-03-08 02:04:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234008319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452415547] [2025-03-08 02:04:07,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:07,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:07,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:07,148 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-08 02:04:07,149 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-08 02:04:07,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 912 statements into 1 equivalence classes. [2025-03-08 02:04:07,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 912 of 912 statements. [2025-03-08 02:04:07,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:07,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:07,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:04:07,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1561 backedges. 715 proven. 0 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2025-03-08 02:04:07,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:04:07,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452415547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:07,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:04:07,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:04:07,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890247362] [2025-03-08 02:04:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:07,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:07,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:04:07,554 INFO L87 Difference]: Start difference. First operand 16454 states and 17195 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:08,113 INFO L93 Difference]: Finished difference Result 32248 states and 33721 transitions. [2025-03-08 02:04:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:08,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 912 [2025-03-08 02:04:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:08,130 INFO L225 Difference]: With dead ends: 32248 [2025-03-08 02:04:08,130 INFO L226 Difference]: Without dead ends: 16454 [2025-03-08 02:04:08,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 912 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:04:08,140 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 226 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:08,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-08 02:04:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16125. [2025-03-08 02:04:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0386380550731829) internal successors, (16747), 16124 states have internal predecessors, (16747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16747 transitions. [2025-03-08 02:04:08,265 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16747 transitions. Word has length 912 [2025-03-08 02:04:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:08,266 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16747 transitions. [2025-03-08 02:04:08,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16747 transitions. [2025-03-08 02:04:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2025-03-08 02:04:08,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:08,281 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:04:08,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:04:08,482 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,SelfDestructingSolverStorable13 [2025-03-08 02:04:08,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1081982743, now seen corresponding path program 1 times [2025-03-08 02:04:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357803755] [2025-03-08 02:04:08,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:08,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-03-08 02:04:08,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-03-08 02:04:08,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:08,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2574 backedges. 1861 proven. 0 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-03-08 02:04:09,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357803755] [2025-03-08 02:04:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357803755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:09,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:09,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:04:09,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758211179] [2025-03-08 02:04:09,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:09,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 02:04:09,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:09,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 02:04:09,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:04:09,460 INFO L87 Difference]: Start difference. First operand 16125 states and 16747 transitions. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:10,578 INFO L93 Difference]: Finished difference Result 31591 states and 32826 transitions. [2025-03-08 02:04:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 02:04:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 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 1276 [2025-03-08 02:04:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:10,590 INFO L225 Difference]: With dead ends: 31591 [2025-03-08 02:04:10,591 INFO L226 Difference]: Without dead ends: 16126 [2025-03-08 02:04:10,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:04:10,600 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 209 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:10,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 572 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:04:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16126 states. [2025-03-08 02:04:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16126 to 16125. [2025-03-08 02:04:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0380178615728106) internal successors, (16737), 16124 states have internal predecessors, (16737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16737 transitions. [2025-03-08 02:04:10,708 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16737 transitions. Word has length 1276 [2025-03-08 02:04:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:10,708 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16737 transitions. [2025-03-08 02:04:10,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16737 transitions. [2025-03-08 02:04:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1291 [2025-03-08 02:04:10,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:10,723 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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-08 02:04:10,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:04:10,723 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:10,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1912311585, now seen corresponding path program 1 times [2025-03-08 02:04:10,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:10,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840592545] [2025-03-08 02:04:10,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:10,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1290 statements into 1 equivalence classes. [2025-03-08 02:04:10,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1290 of 1290 statements. [2025-03-08 02:04:10,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:10,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 1836 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-08 02:04:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840592545] [2025-03-08 02:04:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840592545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:04:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292735619] [2025-03-08 02:04:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:04:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:11,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:04:11,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:11,998 INFO L87 Difference]: Start difference. First operand 16125 states and 16737 transitions. Second operand has 4 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:12,780 INFO L93 Difference]: Finished difference Result 31600 states and 32815 transitions. [2025-03-08 02:04:12,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:04:12,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 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 1290 [2025-03-08 02:04:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:12,794 INFO L225 Difference]: With dead ends: 31600 [2025-03-08 02:04:12,794 INFO L226 Difference]: Without dead ends: 16135 [2025-03-08 02:04:12,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:12,803 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:12,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 443 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:04:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2025-03-08 02:04:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 15796. [2025-03-08 02:04:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0381133270022158) internal successors, (16397), 15795 states have internal predecessors, (16397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16397 transitions. [2025-03-08 02:04:12,925 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16397 transitions. Word has length 1290 [2025-03-08 02:04:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:12,926 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16397 transitions. [2025-03-08 02:04:12,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16397 transitions. [2025-03-08 02:04:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2025-03-08 02:04:12,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:12,941 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2025-03-08 02:04:12,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:04:12,942 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:12,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash 889143746, now seen corresponding path program 1 times [2025-03-08 02:04:12,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:12,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318361837] [2025-03-08 02:04:12,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:13,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1305 statements into 1 equivalence classes. [2025-03-08 02:04:13,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1305 of 1305 statements. [2025-03-08 02:04:13,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:13,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 1793 proven. 0 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2025-03-08 02:04:13,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:13,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318361837] [2025-03-08 02:04:13,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318361837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:13,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495405205] [2025-03-08 02:04:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:13,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:13,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:13,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:13,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:13,824 INFO L87 Difference]: Start difference. First operand 15796 states and 16397 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:14,361 INFO L93 Difference]: Finished difference Result 31590 states and 32795 transitions. [2025-03-08 02:04:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:14,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 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 1305 [2025-03-08 02:04:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:14,374 INFO L225 Difference]: With dead ends: 31590 [2025-03-08 02:04:14,374 INFO L226 Difference]: Without dead ends: 16454 [2025-03-08 02:04:14,382 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-08 02:04:14,383 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 225 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:14,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 437 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-08 02:04:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-03-08 02:04:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0368321886586034) internal successors, (17059), 16453 states have internal predecessors, (17059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17059 transitions. [2025-03-08 02:04:14,495 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17059 transitions. Word has length 1305 [2025-03-08 02:04:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17059 transitions. [2025-03-08 02:04:14,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17059 transitions. [2025-03-08 02:04:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1331 [2025-03-08 02:04:14,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:14,509 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:04:14,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:04:14,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:14,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:14,510 INFO L85 PathProgramCache]: Analyzing trace with hash 424968460, now seen corresponding path program 1 times [2025-03-08 02:04:14,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:14,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210904627] [2025-03-08 02:04:14,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:14,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1330 statements into 1 equivalence classes. [2025-03-08 02:04:14,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1330 of 1330 statements. [2025-03-08 02:04:14,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2815 backedges. 1969 proven. 0 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2025-03-08 02:04:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210904627] [2025-03-08 02:04:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210904627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:15,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:04:15,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082801928] [2025-03-08 02:04:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:15,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:04:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:15,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:04:15,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:15,381 INFO L87 Difference]: Start difference. First operand 16454 states and 17059 transitions. Second operand has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:16,072 INFO L93 Difference]: Finished difference Result 32248 states and 33449 transitions. [2025-03-08 02:04:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:04:16,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 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 1330 [2025-03-08 02:04:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:16,086 INFO L225 Difference]: With dead ends: 32248 [2025-03-08 02:04:16,086 INFO L226 Difference]: Without dead ends: 16454 [2025-03-08 02:04:16,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:16,094 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:16,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 563 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-08 02:04:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-03-08 02:04:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0361028383881359) internal successors, (17047), 16453 states have internal predecessors, (17047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17047 transitions. [2025-03-08 02:04:16,218 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17047 transitions. Word has length 1330 [2025-03-08 02:04:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:16,219 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17047 transitions. [2025-03-08 02:04:16,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17047 transitions. [2025-03-08 02:04:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2025-03-08 02:04:16,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:16,233 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:04:16,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:04:16,233 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:16,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -126331913, now seen corresponding path program 1 times [2025-03-08 02:04:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261668388] [2025-03-08 02:04:16,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:16,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1359 statements into 1 equivalence classes. [2025-03-08 02:04:16,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1359 of 1359 statements. [2025-03-08 02:04:16,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:16,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3199 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2025-03-08 02:04:17,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:17,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261668388] [2025-03-08 02:04:17,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261668388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:17,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:17,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:04:17,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97734307] [2025-03-08 02:04:17,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:17,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 02:04:17,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:17,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 02:04:17,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:04:17,026 INFO L87 Difference]: Start difference. First operand 16454 states and 17047 transitions. Second operand has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:17,625 INFO L93 Difference]: Finished difference Result 31978 states and 33151 transitions. [2025-03-08 02:04:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 02:04:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 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 1359 [2025-03-08 02:04:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:17,638 INFO L225 Difference]: With dead ends: 31978 [2025-03-08 02:04:17,639 INFO L226 Difference]: Without dead ends: 16125 [2025-03-08 02:04:17,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:04:17,647 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 33 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:17,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 465 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2025-03-08 02:04:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2025-03-08 02:04:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0354130488712479) internal successors, (16695), 16124 states have internal predecessors, (16695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16695 transitions. [2025-03-08 02:04:17,762 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16695 transitions. Word has length 1359 [2025-03-08 02:04:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:17,763 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16695 transitions. [2025-03-08 02:04:17,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 6 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16695 transitions. [2025-03-08 02:04:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1575 [2025-03-08 02:04:17,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:17,779 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 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] [2025-03-08 02:04:17,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:04:17,780 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:17,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1345900466, now seen corresponding path program 1 times [2025-03-08 02:04:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:17,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926242044] [2025-03-08 02:04:17,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:17,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1574 statements into 1 equivalence classes. [2025-03-08 02:04:17,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1574 of 1574 statements. [2025-03-08 02:04:17,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:17,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4378 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 3955 trivial. 0 not checked. [2025-03-08 02:04:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926242044] [2025-03-08 02:04:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926242044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:04:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604177075] [2025-03-08 02:04:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:18,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:04:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:18,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:04:18,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:18,741 INFO L87 Difference]: Start difference. First operand 16125 states and 16695 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:19,653 INFO L93 Difference]: Finished difference Result 33898 states and 35119 transitions. [2025-03-08 02:04:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:04:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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 1574 [2025-03-08 02:04:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:19,654 INFO L225 Difference]: With dead ends: 33898 [2025-03-08 02:04:19,654 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:04:19,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:19,665 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 610 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:19,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 41 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:04:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:04:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:04:19,668 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-08 02:04:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:04:19,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1574 [2025-03-08 02:04:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:19,668 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:04:19,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:04:19,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:04:19,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:04:19,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:04:19,674 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:19,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:04:20,306 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:04:20,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:04:20 BoogieIcfgContainer [2025-03-08 02:04:20,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:04:20,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:04:20,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:04:20,322 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:04:20,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:47" (3/4) ... [2025-03-08 02:04:20,324 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:04:20,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 02:04:20,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 02:04:20,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 02:04:20,353 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 02:04:20,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:04:20,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:04:20,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:04:20,498 INFO L158 Benchmark]: Toolchain (without parser) took 35423.38ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 100.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. [2025-03-08 02:04:20,498 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:04:20,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.55ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 43.4MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 02:04:20,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.40ms. Allocated memory is still 142.6MB. Free memory was 43.4MB in the beginning and 83.5MB in the end (delta: -40.0MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2025-03-08 02:04:20,498 INFO L158 Benchmark]: Boogie Preprocessor took 130.95ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 50.9MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 02:04:20,499 INFO L158 Benchmark]: IcfgBuilder took 1871.48ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 50.9MB in the beginning and 155.2MB in the end (delta: -104.3MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2025-03-08 02:04:20,499 INFO L158 Benchmark]: TraceAbstraction took 32616.04ms. Allocated memory was 327.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 155.2MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-08 02:04:20,499 INFO L158 Benchmark]: Witness Printer took 175.52ms. Allocated memory is still 1.8GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 02:04:20,499 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.75ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.55ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 43.4MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.40ms. Allocated memory is still 142.6MB. Free memory was 43.4MB in the beginning and 83.5MB in the end (delta: -40.0MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.95ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 50.9MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1871.48ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 50.9MB in the beginning and 155.2MB in the end (delta: -104.3MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32616.04ms. Allocated memory was 327.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 155.2MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 175.52ms. Allocated memory is still 1.8GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 24.8MB). 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: 182]: 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, 396 locations, 722 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 20, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5532 SdHoareTripleChecker+Valid, 15.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5532 mSDsluCounter, 5165 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 408 mSDsCounter, 2744 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20698 IncrementalHoareTripleChecker+Invalid, 23442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2744 mSolverCounterUnsat, 4757 mSDtfsCounter, 20698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1495 GetRequests, 1455 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16454occurred in iteration=13, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 5933 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 15768 NumberOfCodeBlocks, 15768 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 15746 ConstructedInterpolants, 0 QuantifiedInterpolants, 37853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1676 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 27215/27911 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: 1783]: Location Invariant Derived location invariant: (((((((((((((a16 == 10) && (a12 == 8)) && (a15 == 3)) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 8))) || ((a12 <= 7) && (a16 <= 11))) || (((a12 == 9) && (a16 != 10)) && (a16 <= 11))) || ((a12 == 9) && (a15 <= 3))) || ((((a16 == 9) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a15 == 3))) || (((a15 <= 3) && (0 <= ((long long) a18 + 155))) && (a12 <= 7))) || (((a16 <= 8) && (0 <= ((long long) 87 + a18))) && (a15 <= 3))) || (((((a16 != 10) && (a12 == 8)) && (0 <= ((long long) a18 + 155))) && (a16 <= 11)) && (4 <= a15))) || (((a16 <= 8) && (a12 == 8)) && (4 <= a15))) || (((a15 <= 3) && (a12 == 8)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2025-03-08 02:04:20,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE