./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:47:27,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:47:27,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:47:27,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:47:27,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:47:27,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:47:27,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:47:27,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:47:27,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:47:27,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:47:27,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:47:27,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:47:27,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:47:27,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:47:27,906 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:47:27,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:47:27,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:47:27,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:47:27,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:47:27,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:47:27,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:47:27,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:47:27,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:47:27,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:47:27,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:47:27,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:47:27,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:47:27,909 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-jdk21/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 -> 6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096 [2025-01-09 12:47:28,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:47:28,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:47:28,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:47:28,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:47:28,167 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:47:28,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i [2025-01-09 12:47:29,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b25262be/c2fbbeb3222a4f7ead15feac72d314ea/FLAG4bee53f32 [2025-01-09 12:47:29,445 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:47:29,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i [2025-01-09 12:47:29,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b25262be/c2fbbeb3222a4f7ead15feac72d314ea/FLAG4bee53f32 [2025-01-09 12:47:29,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b25262be/c2fbbeb3222a4f7ead15feac72d314ea [2025-01-09 12:47:29,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:47:29,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:47:29,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:47:29,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:47:29,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:47:29,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:29,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29, skipping insertion in model container [2025-01-09 12:47:29,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:29,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:47:29,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i[916,929] [2025-01-09 12:47:29,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:47:29,928 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:47:29,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i[916,929] [2025-01-09 12:47:29,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:47:29,971 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:47:29,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29 WrapperNode [2025-01-09 12:47:29,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:47:29,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:47:29,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:47:29,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:47:29,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:29,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,008 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-01-09 12:47:30,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:47:30,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:47:30,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:47:30,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:47:30,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,033 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-01-09 12:47:30,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:47:30,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:47:30,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:47:30,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:47:30,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (1/1) ... [2025-01-09 12:47:30,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:47:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:30,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:47:30,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:47:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:47:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:47:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:47:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:47:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:47:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:47:30,155 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:47:30,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:47:30,348 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 12:47:30,349 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:47:30,355 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:47:30,356 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:47:30,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:47:30 BoogieIcfgContainer [2025-01-09 12:47:30,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:47:30,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:47:30,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:47:30,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:47:30,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:47:29" (1/3) ... [2025-01-09 12:47:30,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a368b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:47:30, skipping insertion in model container [2025-01-09 12:47:30,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:47:29" (2/3) ... [2025-01-09 12:47:30,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a368b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:47:30, skipping insertion in model container [2025-01-09 12:47:30,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:47:30" (3/3) ... [2025-01-09 12:47:30,364 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-89.i [2025-01-09 12:47:30,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:47:30,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-89.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:47:30,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:47:30,431 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;@5da910d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:47:30,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:47:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:47:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 12:47:30,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:30,443 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:30,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:30,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1734986799, now seen corresponding path program 1 times [2025-01-09 12:47:30,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:30,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308831215] [2025-01-09 12:47:30,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:30,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 12:47:30,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 12:47:30,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:30,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 12:47:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308831215] [2025-01-09 12:47:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308831215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:30,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111920634] [2025-01-09 12:47:30,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:30,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:30,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:30,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:47:30,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:47:30,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 12:47:30,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 12:47:30,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:30,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:30,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:47:30,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:47:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 12:47:30,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:47:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111920634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:30,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:47:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:47:30,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923784749] [2025-01-09 12:47:30,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:47:30,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:30,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:47:30,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:47:30,742 INFO L87 Difference]: Start difference. First operand has 62 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 12:47:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:30,759 INFO L93 Difference]: Finished difference Result 118 states and 192 transitions. [2025-01-09 12:47:30,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:47:30,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2025-01-09 12:47:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:30,766 INFO L225 Difference]: With dead ends: 118 [2025-01-09 12:47:30,767 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 12:47:30,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:47:30,770 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:30,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:47:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 12:47:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 12:47:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 12:47:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2025-01-09 12:47:30,814 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 87 [2025-01-09 12:47:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:30,814 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-01-09 12:47:30,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 12:47:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2025-01-09 12:47:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 12:47:30,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:30,817 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:30,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:47:31,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:47:31,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1066719345, now seen corresponding path program 1 times [2025-01-09 12:47:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695464957] [2025-01-09 12:47:31,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:31,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 12:47:31,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 12:47:31,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:31,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:31,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695464957] [2025-01-09 12:47:31,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695464957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:31,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:31,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:47:31,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509740057] [2025-01-09 12:47:31,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:31,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:47:31,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:31,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:47:31,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:47:31,493 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:31,670 INFO L93 Difference]: Finished difference Result 172 states and 250 transitions. [2025-01-09 12:47:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:47:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2025-01-09 12:47:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:31,674 INFO L225 Difference]: With dead ends: 172 [2025-01-09 12:47:31,674 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 12:47:31,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:47:31,675 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:31,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:47:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 12:47:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2025-01-09 12:47:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:47:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2025-01-09 12:47:31,697 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 87 [2025-01-09 12:47:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:31,697 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2025-01-09 12:47:31,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2025-01-09 12:47:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 12:47:31,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:31,699 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:31,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:47:31,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:31,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash -365654767, now seen corresponding path program 1 times [2025-01-09 12:47:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:31,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982245891] [2025-01-09 12:47:31,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:31,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 12:47:31,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 12:47:31,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:31,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:33,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:33,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982245891] [2025-01-09 12:47:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982245891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:33,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:47:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133657729] [2025-01-09 12:47:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:47:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:33,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:47:33,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:47:33,835 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:34,160 INFO L93 Difference]: Finished difference Result 170 states and 246 transitions. [2025-01-09 12:47:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:47:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2025-01-09 12:47:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:34,162 INFO L225 Difference]: With dead ends: 170 [2025-01-09 12:47:34,162 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 12:47:34,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:47:34,163 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 154 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:34,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 155 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:47:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 12:47:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2025-01-09 12:47:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:47:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-01-09 12:47:34,181 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 87 [2025-01-09 12:47:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:34,182 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-01-09 12:47:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-01-09 12:47:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 12:47:34,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:34,184 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:34,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:47:34,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:34,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:34,185 INFO L85 PathProgramCache]: Analyzing trace with hash 314403603, now seen corresponding path program 1 times [2025-01-09 12:47:34,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:34,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723639110] [2025-01-09 12:47:34,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:34,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 12:47:34,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 12:47:34,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:34,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:35,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:35,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723639110] [2025-01-09 12:47:35,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723639110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:35,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:47:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615524343] [2025-01-09 12:47:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:35,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:47:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:35,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:47:35,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:47:35,500 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:35,895 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2025-01-09 12:47:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:47:35,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2025-01-09 12:47:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:35,897 INFO L225 Difference]: With dead ends: 181 [2025-01-09 12:47:35,899 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 12:47:35,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:47:35,900 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 119 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:35,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 195 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:47:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 12:47:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 85. [2025-01-09 12:47:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:47:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2025-01-09 12:47:35,912 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 87 [2025-01-09 12:47:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:35,912 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2025-01-09 12:47:35,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2025-01-09 12:47:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 12:47:35,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:35,914 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:35,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:47:35,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:35,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:35,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1412290774, now seen corresponding path program 1 times [2025-01-09 12:47:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:35,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421247339] [2025-01-09 12:47:35,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:35,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:35,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 12:47:35,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 12:47:35,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:35,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 12:47:36,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:36,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421247339] [2025-01-09 12:47:36,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421247339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:36,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903990726] [2025-01-09 12:47:36,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:36,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:36,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:36,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:47:36,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:47:36,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 12:47:36,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 12:47:36,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:36,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:36,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 12:47:36,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:47:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-09 12:47:36,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:47:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903990726] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:37,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:47:37,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 24 [2025-01-09 12:47:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725832119] [2025-01-09 12:47:37,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:37,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:47:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:37,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:47:37,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:47:37,149 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:37,375 INFO L93 Difference]: Finished difference Result 92 states and 129 transitions. [2025-01-09 12:47:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:47:37,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2025-01-09 12:47:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:37,377 INFO L225 Difference]: With dead ends: 92 [2025-01-09 12:47:37,377 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 12:47:37,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2025-01-09 12:47:37,378 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 76 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:37,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 424 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:47:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 12:47:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-01-09 12:47:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 60 states have internal predecessors, (74), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:47:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-01-09 12:47:37,395 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 89 [2025-01-09 12:47:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:37,395 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-01-09 12:47:37,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-01-09 12:47:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 12:47:37,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:37,398 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:37,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:47:37,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:37,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:37,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash -392556022, now seen corresponding path program 1 times [2025-01-09 12:47:37,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:37,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063668488] [2025-01-09 12:47:37,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:37,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 12:47:37,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 12:47:37,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063668488] [2025-01-09 12:47:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063668488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:37,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:37,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:47:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686812680] [2025-01-09 12:47:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:47:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:37,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:47:37,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:47:37,703 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:37,757 INFO L93 Difference]: Finished difference Result 155 states and 218 transitions. [2025-01-09 12:47:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:47:37,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-01-09 12:47:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:37,761 INFO L225 Difference]: With dead ends: 155 [2025-01-09 12:47:37,761 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 12:47:37,761 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-01-09 12:47:37,761 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:37,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 148 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:47:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 12:47:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-01-09 12:47:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:47:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2025-01-09 12:47:37,772 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 91 [2025-01-09 12:47:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:37,772 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2025-01-09 12:47:37,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2025-01-09 12:47:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 12:47:37,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:37,773 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:37,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:47:37,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:37,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash -291652226, now seen corresponding path program 1 times [2025-01-09 12:47:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559068497] [2025-01-09 12:47:37,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:37,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:37,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 12:47:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 12:47:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:37,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 12:47:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559068497] [2025-01-09 12:47:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559068497] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759605832] [2025-01-09 12:47:38,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:38,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:38,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:38,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:47:38,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:47:38,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 12:47:38,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 12:47:38,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:38,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:38,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 12:47:38,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:47:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-09 12:47:38,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:47:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759605832] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:39,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:47:39,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 12] total 27 [2025-01-09 12:47:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150275916] [2025-01-09 12:47:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:39,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:47:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:39,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:47:39,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-01-09 12:47:39,122 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:39,329 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2025-01-09 12:47:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:47:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-01-09 12:47:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:39,331 INFO L225 Difference]: With dead ends: 100 [2025-01-09 12:47:39,331 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 12:47:39,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-01-09 12:47:39,331 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 74 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:39,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 386 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:47:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 12:47:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2025-01-09 12:47:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:47:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-01-09 12:47:39,344 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 92 [2025-01-09 12:47:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:39,345 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-01-09 12:47:39,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-01-09 12:47:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 12:47:39,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:39,347 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:39,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:47:39,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:39,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:39,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash -160030683, now seen corresponding path program 1 times [2025-01-09 12:47:39,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:39,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530771609] [2025-01-09 12:47:39,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:39,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:39,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 12:47:39,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 12:47:39,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:39,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:39,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530771609] [2025-01-09 12:47:39,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530771609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:39,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:47:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645643307] [2025-01-09 12:47:39,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:39,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:47:39,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:39,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:47:39,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:47:39,588 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:39,614 INFO L93 Difference]: Finished difference Result 186 states and 255 transitions. [2025-01-09 12:47:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:47:39,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-01-09 12:47:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:39,615 INFO L225 Difference]: With dead ends: 186 [2025-01-09 12:47:39,616 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 12:47:39,616 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-01-09 12:47:39,616 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:39,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:47:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 12:47:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-01-09 12:47:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 83 states have (on average 1.180722891566265) internal successors, (98), 84 states have internal predecessors, (98), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:47:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2025-01-09 12:47:39,628 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 94 [2025-01-09 12:47:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:39,628 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2025-01-09 12:47:39,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2025-01-09 12:47:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 12:47:39,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:39,629 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:39,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:47:39,629 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:39,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1529673320, now seen corresponding path program 1 times [2025-01-09 12:47:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885712925] [2025-01-09 12:47:39,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:39,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 12:47:39,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 12:47:39,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:39,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:39,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885712925] [2025-01-09 12:47:39,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885712925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:39,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:39,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:47:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633485121] [2025-01-09 12:47:39,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:39,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:47:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:39,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:47:39,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:47:39,667 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:39,766 INFO L93 Difference]: Finished difference Result 363 states and 492 transitions. [2025-01-09 12:47:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:47:39,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-01-09 12:47:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:39,769 INFO L225 Difference]: With dead ends: 363 [2025-01-09 12:47:39,770 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 12:47:39,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:47:39,773 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 119 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:39,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 211 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:47:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 12:47:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 212. [2025-01-09 12:47:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 152 states have (on average 1.1710526315789473) internal successors, (178), 154 states have internal predecessors, (178), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 12:47:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2025-01-09 12:47:39,796 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 95 [2025-01-09 12:47:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:39,797 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2025-01-09 12:47:39,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2025-01-09 12:47:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 12:47:39,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:39,798 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:39,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:47:39,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:39,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1448395018, now seen corresponding path program 1 times [2025-01-09 12:47:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:39,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-01-09 12:47:39,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:39,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 12:47:39,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 12:47:39,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:39,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:39,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-01-09 12:47:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208791508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:47:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121674527] [2025-01-09 12:47:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:39,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:47:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:39,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:47:39,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:47:39,864 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:39,932 INFO L93 Difference]: Finished difference Result 393 states and 525 transitions. [2025-01-09 12:47:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:47:39,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-01-09 12:47:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:39,934 INFO L225 Difference]: With dead ends: 393 [2025-01-09 12:47:39,934 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 12:47:39,935 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-01-09 12:47:39,935 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 42 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:39,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:47:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 12:47:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2025-01-09 12:47:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 152 states have (on average 1.1644736842105263) internal successors, (177), 154 states have internal predecessors, (177), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 12:47:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 283 transitions. [2025-01-09 12:47:39,955 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 283 transitions. Word has length 105 [2025-01-09 12:47:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:39,955 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 283 transitions. [2025-01-09 12:47:39,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2025-01-09 12:47:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 12:47:39,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:39,968 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 12:47:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:47:39,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:39,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash -545749688, now seen corresponding path program 1 times [2025-01-09 12:47:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:39,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188791365] [2025-01-09 12:47:39,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:39,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 12:47:39,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 12:47:39,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:39,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 12:47:40,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:40,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188791365] [2025-01-09 12:47:40,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188791365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:40,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:40,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:47:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848710829] [2025-01-09 12:47:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:40,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:47:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:40,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:47:40,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:47:40,769 INFO L87 Difference]: Start difference. First operand 212 states and 283 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:41,681 INFO L93 Difference]: Finished difference Result 230 states and 300 transitions. [2025-01-09 12:47:41,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:47:41,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-01-09 12:47:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:41,683 INFO L225 Difference]: With dead ends: 230 [2025-01-09 12:47:41,683 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 12:47:41,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2025-01-09 12:47:41,684 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 90 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:41,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 578 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:47:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 12:47:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 208. [2025-01-09 12:47:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 148 states have (on average 1.162162162162162) internal successors, (172), 150 states have internal predecessors, (172), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 12:47:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 278 transitions. [2025-01-09 12:47:41,698 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 278 transitions. Word has length 105 [2025-01-09 12:47:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:41,699 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 278 transitions. [2025-01-09 12:47:41,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 278 transitions. [2025-01-09 12:47:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 12:47:41,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:41,700 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-09 12:47:41,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:47:41,700 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:41,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash -269184240, now seen corresponding path program 1 times [2025-01-09 12:47:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:41,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613231742] [2025-01-09 12:47:41,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:41,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:41,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 12:47:41,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 12:47:41,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:41,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-01-09 12:47:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613231742] [2025-01-09 12:47:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613231742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:43,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:43,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:47:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180233831] [2025-01-09 12:47:43,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:43,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:47:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:43,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:47:43,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:47:43,735 INFO L87 Difference]: Start difference. First operand 208 states and 278 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:44,691 INFO L93 Difference]: Finished difference Result 408 states and 542 transitions. [2025-01-09 12:47:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:47:44,692 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 181 [2025-01-09 12:47:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:44,693 INFO L225 Difference]: With dead ends: 408 [2025-01-09 12:47:44,693 INFO L226 Difference]: Without dead ends: 315 [2025-01-09 12:47:44,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:47:44,694 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 115 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:44,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 861 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:47:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-01-09 12:47:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 293. [2025-01-09 12:47:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.1813953488372093) internal successors, (254), 219 states have internal predecessors, (254), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 12:47:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. [2025-01-09 12:47:44,718 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 181 [2025-01-09 12:47:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:44,718 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. [2025-01-09 12:47:44,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. [2025-01-09 12:47:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 12:47:44,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:44,720 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 12:47:44,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:47:44,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:44,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:44,720 INFO L85 PathProgramCache]: Analyzing trace with hash -489966004, now seen corresponding path program 1 times [2025-01-09 12:47:44,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:44,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166635650] [2025-01-09 12:47:44,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:44,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 12:47:44,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 12:47:44,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:44,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-01-09 12:47:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166635650] [2025-01-09 12:47:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166635650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:45,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:47:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589202971] [2025-01-09 12:47:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:45,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:47:45,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:45,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:47:45,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:47:45,426 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:45,640 INFO L93 Difference]: Finished difference Result 519 states and 694 transitions. [2025-01-09 12:47:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:47:45,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 187 [2025-01-09 12:47:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:45,642 INFO L225 Difference]: With dead ends: 519 [2025-01-09 12:47:45,642 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 12:47:45,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:47:45,643 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 122 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:45,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 281 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:47:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 12:47:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 293. [2025-01-09 12:47:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.1627906976744187) internal successors, (250), 219 states have internal predecessors, (250), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 12:47:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 388 transitions. [2025-01-09 12:47:45,666 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 388 transitions. Word has length 187 [2025-01-09 12:47:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:45,667 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 388 transitions. [2025-01-09 12:47:45,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 388 transitions. [2025-01-09 12:47:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 12:47:45,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:45,668 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 12:47:45,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:47:45,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:45,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:45,668 INFO L85 PathProgramCache]: Analyzing trace with hash -245453902, now seen corresponding path program 1 times [2025-01-09 12:47:45,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:45,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27200483] [2025-01-09 12:47:45,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:45,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 12:47:45,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 12:47:45,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:45,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-01-09 12:47:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:46,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27200483] [2025-01-09 12:47:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27200483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:46,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:46,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:47:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285713417] [2025-01-09 12:47:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:46,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:47:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:46,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:47:46,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:47:46,666 INFO L87 Difference]: Start difference. First operand 293 states and 388 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:47,006 INFO L93 Difference]: Finished difference Result 519 states and 686 transitions. [2025-01-09 12:47:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:47:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 191 [2025-01-09 12:47:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:47,010 INFO L225 Difference]: With dead ends: 519 [2025-01-09 12:47:47,010 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 12:47:47,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:47:47,011 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 102 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:47,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 316 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:47:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 12:47:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 293. [2025-01-09 12:47:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.158139534883721) internal successors, (249), 219 states have internal predecessors, (249), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 12:47:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2025-01-09 12:47:47,035 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 191 [2025-01-09 12:47:47,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:47,035 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2025-01-09 12:47:47,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2025-01-09 12:47:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 12:47:47,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:47,037 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 12:47:47,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:47:47,037 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:47,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2055368688, now seen corresponding path program 1 times [2025-01-09 12:47:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194060058] [2025-01-09 12:47:47,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:47,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 12:47:47,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 12:47:47,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:47,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-01-09 12:47:49,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:49,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194060058] [2025-01-09 12:47:49,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194060058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:49,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:49,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:47:49,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874821908] [2025-01-09 12:47:49,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:49,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:47:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:49,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:47:49,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:47:49,372 INFO L87 Difference]: Start difference. First operand 293 states and 387 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:50,491 INFO L93 Difference]: Finished difference Result 326 states and 419 transitions. [2025-01-09 12:47:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:47:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 191 [2025-01-09 12:47:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:50,493 INFO L225 Difference]: With dead ends: 326 [2025-01-09 12:47:50,493 INFO L226 Difference]: Without dead ends: 324 [2025-01-09 12:47:50,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:47:50,494 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 112 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:50,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 947 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:47:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-09 12:47:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 287. [2025-01-09 12:47:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 209 states have (on average 1.1578947368421053) internal successors, (242), 213 states have internal predecessors, (242), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 12:47:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 380 transitions. [2025-01-09 12:47:50,518 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 380 transitions. Word has length 191 [2025-01-09 12:47:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:50,519 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 380 transitions. [2025-01-09 12:47:50,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 380 transitions. [2025-01-09 12:47:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-09 12:47:50,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:50,521 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:47:50,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:47:50,522 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1610040634, now seen corresponding path program 2 times [2025-01-09 12:47:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442824898] [2025-01-09 12:47:50,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 12:47:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:50,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 267 statements into 2 equivalence classes. [2025-01-09 12:47:50,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 267 statements. [2025-01-09 12:47:50,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 12:47:50,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3044 trivial. 0 not checked. [2025-01-09 12:47:51,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:51,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442824898] [2025-01-09 12:47:51,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442824898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:51,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:51,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:47:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418240793] [2025-01-09 12:47:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:51,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:47:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:51,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:47:51,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:47:51,179 INFO L87 Difference]: Start difference. First operand 287 states and 380 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:51,617 INFO L93 Difference]: Finished difference Result 349 states and 444 transitions. [2025-01-09 12:47:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 12:47:51,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 267 [2025-01-09 12:47:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:51,619 INFO L225 Difference]: With dead ends: 349 [2025-01-09 12:47:51,619 INFO L226 Difference]: Without dead ends: 347 [2025-01-09 12:47:51,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:47:51,620 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 147 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:51,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 427 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:47:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-01-09 12:47:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 289. [2025-01-09 12:47:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 215 states have internal predecessors, (244), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 12:47:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 382 transitions. [2025-01-09 12:47:51,646 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 382 transitions. Word has length 267 [2025-01-09 12:47:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:51,646 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 382 transitions. [2025-01-09 12:47:51,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 382 transitions. [2025-01-09 12:47:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 12:47:51,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:51,647 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:47:51,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 12:47:51,647 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:51,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash -173449567, now seen corresponding path program 1 times [2025-01-09 12:47:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347614793] [2025-01-09 12:47:51,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:51,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 12:47:51,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 12:47:51,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:51,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3050 trivial. 0 not checked. [2025-01-09 12:47:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347614793] [2025-01-09 12:47:51,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347614793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:51,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:47:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468230212] [2025-01-09 12:47:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:51,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:47:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:51,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:47:51,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:47:51,704 INFO L87 Difference]: Start difference. First operand 289 states and 382 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:51,765 INFO L93 Difference]: Finished difference Result 574 states and 762 transitions. [2025-01-09 12:47:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:47:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 270 [2025-01-09 12:47:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:51,767 INFO L225 Difference]: With dead ends: 574 [2025-01-09 12:47:51,767 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 12:47:51,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-01-09 12:47:51,768 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 55 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:51,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 199 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:47:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 12:47:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-01-09 12:47:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 282 states have (on average 1.1312056737588652) internal successors, (319), 289 states have internal predecessors, (319), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 12:47:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 529 transitions. [2025-01-09 12:47:51,804 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 529 transitions. Word has length 270 [2025-01-09 12:47:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:51,804 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 529 transitions. [2025-01-09 12:47:51,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 529 transitions. [2025-01-09 12:47:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-09 12:47:51,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:51,806 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:47:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 12:47:51,806 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:51,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:51,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1941528330, now seen corresponding path program 2 times [2025-01-09 12:47:51,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:51,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077045141] [2025-01-09 12:47:51,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 12:47:51,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:51,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 273 statements into 2 equivalence classes. [2025-01-09 12:47:51,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 273 statements. [2025-01-09 12:47:51,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 12:47:51,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3044 trivial. 0 not checked. [2025-01-09 12:47:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077045141] [2025-01-09 12:47:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077045141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:47:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890611276] [2025-01-09 12:47:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:51,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:47:51,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:51,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:47:51,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:47:51,871 INFO L87 Difference]: Start difference. First operand 400 states and 529 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:51,999 INFO L93 Difference]: Finished difference Result 838 states and 1112 transitions. [2025-01-09 12:47:52,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:47:52,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 273 [2025-01-09 12:47:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:52,003 INFO L225 Difference]: With dead ends: 838 [2025-01-09 12:47:52,004 INFO L226 Difference]: Without dead ends: 552 [2025-01-09 12:47:52,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:47:52,006 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 134 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:52,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 232 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:47:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-01-09 12:47:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 411. [2025-01-09 12:47:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 293 states have (on average 1.136518771331058) internal successors, (333), 300 states have internal predecessors, (333), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 12:47:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 543 transitions. [2025-01-09 12:47:52,054 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 543 transitions. Word has length 273 [2025-01-09 12:47:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:52,054 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 543 transitions. [2025-01-09 12:47:52,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 543 transitions. [2025-01-09 12:47:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-01-09 12:47:52,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:52,057 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:47:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 12:47:52,058 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:52,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1018155150, now seen corresponding path program 1 times [2025-01-09 12:47:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:52,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537486808] [2025-01-09 12:47:52,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:52,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-09 12:47:52,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-09 12:47:52,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:52,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3050 trivial. 0 not checked. [2025-01-09 12:47:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537486808] [2025-01-09 12:47:52,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537486808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:52,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:47:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790360853] [2025-01-09 12:47:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:52,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:47:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:52,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:47:52,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:47:52,125 INFO L87 Difference]: Start difference. First operand 411 states and 543 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:52,214 INFO L93 Difference]: Finished difference Result 883 states and 1174 transitions. [2025-01-09 12:47:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:47:52,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 274 [2025-01-09 12:47:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:52,218 INFO L225 Difference]: With dead ends: 883 [2025-01-09 12:47:52,218 INFO L226 Difference]: Without dead ends: 587 [2025-01-09 12:47:52,218 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-01-09 12:47:52,219 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:52,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 130 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:47:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-01-09 12:47:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 515. [2025-01-09 12:47:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 357 states have (on average 1.123249299719888) internal successors, (401), 367 states have internal predecessors, (401), 141 states have call successors, (141), 16 states have call predecessors, (141), 16 states have return successors, (141), 131 states have call predecessors, (141), 141 states have call successors, (141) [2025-01-09 12:47:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 683 transitions. [2025-01-09 12:47:52,281 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 683 transitions. Word has length 274 [2025-01-09 12:47:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:52,281 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 683 transitions. [2025-01-09 12:47:52,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 12:47:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 683 transitions. [2025-01-09 12:47:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 12:47:52,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:52,283 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:47:52,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 12:47:52,283 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -497245257, now seen corresponding path program 1 times [2025-01-09 12:47:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249495991] [2025-01-09 12:47:52,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:52,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:52,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 12:47:52,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 12:47:52,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:52,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [2025-01-09 12:47:52,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249495991] [2025-01-09 12:47:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249495991] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587985148] [2025-01-09 12:47:52,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:52,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:52,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:47:52,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 12:47:52,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 12:47:52,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 12:47:52,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:52,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:52,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:47:52,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:47:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 688 proven. 12 refuted. 0 times theorem prover too weak. 2364 trivial. 0 not checked. [2025-01-09 12:47:52,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:47:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 140 proven. 12 refuted. 0 times theorem prover too weak. 2912 trivial. 0 not checked. [2025-01-09 12:47:52,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587985148] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:47:52,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:47:52,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-01-09 12:47:52,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666974091] [2025-01-09 12:47:52,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:47:52,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:47:52,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:52,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:47:52,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:47:52,883 INFO L87 Difference]: Start difference. First operand 515 states and 683 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:47:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:53,784 INFO L93 Difference]: Finished difference Result 739 states and 967 transitions. [2025-01-09 12:47:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 12:47:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 275 [2025-01-09 12:47:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:53,789 INFO L225 Difference]: With dead ends: 739 [2025-01-09 12:47:53,789 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 12:47:53,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 548 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2025-01-09 12:47:53,792 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 119 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:53,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 312 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:47:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 12:47:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 12:47:53,796 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-01-09 12:47:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 12:47:53,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2025-01-09 12:47:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:53,797 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 12:47:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:47:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 12:47:53,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 12:47:53,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:47:53,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 12:47:54,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:54,003 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:47:54,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 12:48:16,222 WARN L286 SmtUtils]: Spent 22.00s on a formula simplification. DAG size of input: 267 DAG size of output: 311 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-09 12:48:21,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:48:21,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:48:21 BoogieIcfgContainer [2025-01-09 12:48:21,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:48:21,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:48:21,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:48:21,798 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:48:21,801 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:47:30" (3/4) ... [2025-01-09 12:48:21,802 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 12:48:21,807 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 12:48:21,810 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 12:48:21,810 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 12:48:21,810 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 12:48:21,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 12:48:21,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 12:48:21,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 12:48:21,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:48:21,887 INFO L158 Benchmark]: Toolchain (without parser) took 52097.72ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 105.3MB in the beginning and 400.8MB in the end (delta: -295.5MB). Peak memory consumption was 582.0MB. Max. memory is 16.1GB. [2025-01-09 12:48:21,887 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:48:21,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.59ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 92.4MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:48:21,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.47ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:48:21,888 INFO L158 Benchmark]: Boogie Preprocessor took 36.35ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:48:21,890 INFO L158 Benchmark]: RCFGBuilder took 310.19ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 67.3MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:48:21,890 INFO L158 Benchmark]: TraceAbstraction took 51439.95ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 67.3MB in the beginning and 409.2MB in the end (delta: -341.8MB). Peak memory consumption was 568.4MB. Max. memory is 16.1GB. [2025-01-09 12:48:21,890 INFO L158 Benchmark]: Witness Printer took 87.65ms. Allocated memory is still 1.0GB. Free memory was 409.2MB in the beginning and 400.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:48:21,891 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.59ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 92.4MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.47ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.35ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.19ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 67.3MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 51439.95ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 880.8MB). Free memory was 67.3MB in the beginning and 409.2MB in the end (delta: -341.8MB). Peak memory consumption was 568.4MB. Max. memory is 16.1GB. * Witness Printer took 87.65ms. Allocated memory is still 1.0GB. Free memory was 409.2MB in the beginning and 400.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 20, TraceHistogramMax: 39, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1760 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1751 mSDsluCounter, 6519 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4521 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5001 IncrementalHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 1998 mSDtfsCounter, 5001 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 1028 SyntacticMatches, 6 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=19, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 599 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 3671 NumberOfCodeBlocks, 3197 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4100 ConstructedInterpolants, 0 QuantifiedInterpolants, 20795 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 27 InterpolantComputations, 19 PerfectInterpolantSequences, 31588/31772 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: 97]: Loop Invariant Derived loop invariant: (((((((((var_1_8 < (var_1_14 + 1)) || (0 < 1)) && ((((var_1_8 != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((3 + var_1_10) < var_1_9) || (var_1_8 == ((252 + var_1_9) % 256))) && (((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)) <= 127))) && ((var_1_8 == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((((3 + var_1_10) < var_1_9) || ((256 + var_1_8) == ((252 + var_1_9) % 256))) && (128 <= ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) || ((256 + var_1_8) != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) && (((((var_1_9 <= (3 + var_1_10)) && ((256 + var_1_8) == ((252 + var_1_9) % 256))) || (((252 + var_1_9) % 256) < 128)) && ((127 < ((252 + var_1_9) % 256)) || ((var_1_8 == ((252 + var_1_9) % 256)) && (var_1_9 <= (3 + var_1_10))))) || ((256 + var_1_8) == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))))))) || (last_1_var_1_14 < (last_1_var_1_15 + 1)))) && (var_1_14 == ((var_1_8 >= 0) ? (var_1_8 % 65536) : ((var_1_8 % 65536) + 65536)))) && (var_1_13 == var_1_10)) && (var_1_15 == var_1_3)) && (var_1_7 <= 0)) && (var_1_14 <= var_1_8)) || (((((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((var_1_8 + 1) <= 0)) && (((var_1_14 / var_1_3) + 1) <= var_1_14)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (var_1_1 == 0)) && (var_1_7 <= 0)) && (0 <= (((var_1_8 >= 0) ? (var_1_8 / 65536) : ((var_1_8 / 65536) - 1)) + 1)))) RESULT: Ultimate proved your program to be correct! [2025-01-09 12:48:21,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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