./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.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_fillercode_fillercodesize_ps-cn-250_file-11.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 568715a232aa16d18571b6e9b4b6f71d3297e66e84733db9163f76f7b8e7e31f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:39:03,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:39:03,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:39:03,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:39:03,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:39:03,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:39:03,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:39:03,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:39:03,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:39:03,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:39:03,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:39:03,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:39:03,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:39:03,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:39:03,598 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:39:03,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:39:03,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:39:03,598 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:39:03,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:39:03,599 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:39:03,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:39:03,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:39:03,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:39:03,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:03,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:39:03,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:39:03,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:39:03,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:39:03,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:03,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:39:03,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:39:03,601 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:39:03,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:39:03,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:39:03,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:39:03,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:39:03,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:39:03,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:39:03,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:39:03,602 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 -> 568715a232aa16d18571b6e9b4b6f71d3297e66e84733db9163f76f7b8e7e31f [2025-01-09 09:39:03,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:39:03,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:39:03,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:39:03,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:39:03,866 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:39:03,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-01-09 09:39:05,119 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fbba3e66/7e026c4142714a09a240f66398ed562e/FLAGdbfbb6163 [2025-01-09 09:39:05,424 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:39:05,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-01-09 09:39:05,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fbba3e66/7e026c4142714a09a240f66398ed562e/FLAGdbfbb6163 [2025-01-09 09:39:05,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0fbba3e66/7e026c4142714a09a240f66398ed562e [2025-01-09 09:39:05,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:39:05,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:39:05,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:39:05,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:39:05,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:39:05,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:05" (1/1) ... [2025-01-09 09:39:05,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9497a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:05, skipping insertion in model container [2025-01-09 09:39:05,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:05" (1/1) ... [2025-01-09 09:39:05,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:39:05,842 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_fillercode_fillercodesize_ps-cn-250_file-11.i[916,929] [2025-01-09 09:39:05,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:39:05,968 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:39:05,978 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_fillercode_fillercodesize_ps-cn-250_file-11.i[916,929] [2025-01-09 09:39:06,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:39:06,033 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:39:06,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06 WrapperNode [2025-01-09 09:39:06,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:39:06,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:39:06,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:39:06,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:39:06,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,108 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-01-09 09:39:06,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:39:06,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:39:06,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:39:06,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:39:06,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,155 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 09:39:06,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:39:06,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:39:06,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:39:06,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:39:06,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (1/1) ... [2025-01-09 09:39:06,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:06,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:06,227 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 09:39:06,232 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 09:39:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:39:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:39:06,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:39:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:39:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:39:06,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:39:06,326 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:39:06,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:39:06,963 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 09:39:06,963 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:39:06,973 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:39:06,974 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:39:06,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:06 BoogieIcfgContainer [2025-01-09 09:39:06,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:39:06,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:39:06,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:39:06,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:39:06,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:05" (1/3) ... [2025-01-09 09:39:06,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767b52ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:06, skipping insertion in model container [2025-01-09 09:39:06,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:06" (2/3) ... [2025-01-09 09:39:06,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767b52ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:06, skipping insertion in model container [2025-01-09 09:39:06,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:06" (3/3) ... [2025-01-09 09:39:06,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-11.i [2025-01-09 09:39:06,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:39:06,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-11.i that has 2 procedures, 237 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:39:07,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:39:07,056 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;@28459148, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:39:07,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:39:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 09:39:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-09 09:39:07,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:07,085 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:07,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:07,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash -568168530, now seen corresponding path program 1 times [2025-01-09 09:39:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:07,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049282157] [2025-01-09 09:39:07,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:07,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 09:39:07,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 09:39:07,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:07,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-01-09 09:39:07,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:07,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049282157] [2025-01-09 09:39:07,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049282157] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:39:07,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687408081] [2025-01-09 09:39:07,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:07,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:39:07,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:07,596 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 09:39:07,597 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 09:39:07,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 09:39:07,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 09:39:07,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:07,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:07,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:39:07,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:39:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-01-09 09:39:07,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:39:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687408081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:07,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:39:07,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:39:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739806499] [2025-01-09 09:39:07,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:07,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:39:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:07,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:39:07,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:39:07,966 INFO L87 Difference]: Start difference. First operand has 237 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-01-09 09:39:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:08,012 INFO L93 Difference]: Finished difference Result 468 states and 868 transitions. [2025-01-09 09:39:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:39:08,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) Word has length 496 [2025-01-09 09:39:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:08,025 INFO L225 Difference]: With dead ends: 468 [2025-01-09 09:39:08,025 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 09:39:08,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 497 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 09:39:08,030 INFO L435 NwaCegarLoop]: 389 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, 389 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 09:39:08,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 09:39:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-01-09 09:39:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 151 states have internal predecessors, (227), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 09:39:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 389 transitions. [2025-01-09 09:39:08,080 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 389 transitions. Word has length 496 [2025-01-09 09:39:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:08,081 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 389 transitions. [2025-01-09 09:39:08,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-01-09 09:39:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 389 transitions. [2025-01-09 09:39:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-09 09:39:08,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:08,089 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:08,102 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 09:39:08,290 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 09:39:08,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:08,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1612948392, now seen corresponding path program 1 times [2025-01-09 09:39:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:08,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766574228] [2025-01-09 09:39:08,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:08,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 09:39:08,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 09:39:08,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:08,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:39:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766574228] [2025-01-09 09:39:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766574228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:08,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:39:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131672819] [2025-01-09 09:39:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:39:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:08,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:39:08,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:39:08,771 INFO L87 Difference]: Start difference. First operand 234 states and 389 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:08,820 INFO L93 Difference]: Finished difference Result 603 states and 1004 transitions. [2025-01-09 09:39:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:39:08,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 496 [2025-01-09 09:39:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:08,824 INFO L225 Difference]: With dead ends: 603 [2025-01-09 09:39:08,824 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 09:39:08,825 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 09:39:08,826 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 254 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:08,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 860 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 09:39:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2025-01-09 09:39:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 248 states have internal predecessors, (376), 119 states have call successors, (119), 2 states have call predecessors, (119), 2 states have return successors, (119), 118 states have call predecessors, (119), 119 states have call successors, (119) [2025-01-09 09:39:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 614 transitions. [2025-01-09 09:39:08,881 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 614 transitions. Word has length 496 [2025-01-09 09:39:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:08,883 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 614 transitions. [2025-01-09 09:39:08,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 614 transitions. [2025-01-09 09:39:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-09 09:39:08,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:08,887 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:08,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:39:08,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:08,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1218581606, now seen corresponding path program 1 times [2025-01-09 09:39:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:08,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494164786] [2025-01-09 09:39:08,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:08,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-09 09:39:08,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-09 09:39:09,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:09,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:39:09,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:09,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494164786] [2025-01-09 09:39:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494164786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:09,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:09,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:39:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120916586] [2025-01-09 09:39:09,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:09,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:39:09,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:09,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:39:09,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:39:09,288 INFO L87 Difference]: Start difference. First operand 369 states and 614 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:09,369 INFO L93 Difference]: Finished difference Result 974 states and 1623 transitions. [2025-01-09 09:39:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:39:09,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 496 [2025-01-09 09:39:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:09,380 INFO L225 Difference]: With dead ends: 974 [2025-01-09 09:39:09,381 INFO L226 Difference]: Without dead ends: 608 [2025-01-09 09:39:09,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:39:09,384 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 228 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:09,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 904 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-01-09 09:39:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2025-01-09 09:39:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 418 states have (on average 1.5382775119617225) internal successors, (643), 421 states have internal predecessors, (643), 181 states have call successors, (181), 4 states have call predecessors, (181), 4 states have return successors, (181), 178 states have call predecessors, (181), 181 states have call successors, (181) [2025-01-09 09:39:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1005 transitions. [2025-01-09 09:39:09,469 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1005 transitions. Word has length 496 [2025-01-09 09:39:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:09,470 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 1005 transitions. [2025-01-09 09:39:09,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1005 transitions. [2025-01-09 09:39:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-01-09 09:39:09,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:09,474 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:09,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:39:09,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:09,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2070328669, now seen corresponding path program 1 times [2025-01-09 09:39:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579674943] [2025-01-09 09:39:09,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:09,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-01-09 09:39:09,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-01-09 09:39:09,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:09,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:39:09,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579674943] [2025-01-09 09:39:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579674943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:09,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:39:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771673868] [2025-01-09 09:39:09,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:09,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:39:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:09,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:39:09,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:39:09,963 INFO L87 Difference]: Start difference. First operand 604 states and 1005 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:10,457 INFO L93 Difference]: Finished difference Result 1676 states and 2776 transitions. [2025-01-09 09:39:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:39:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 497 [2025-01-09 09:39:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:10,467 INFO L225 Difference]: With dead ends: 1676 [2025-01-09 09:39:10,468 INFO L226 Difference]: Without dead ends: 1075 [2025-01-09 09:39:10,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:39:10,472 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 615 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:10,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1117 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:39:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-01-09 09:39:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1037. [2025-01-09 09:39:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 775 states have (on average 1.5729032258064517) internal successors, (1219), 782 states have internal predecessors, (1219), 249 states have call successors, (249), 12 states have call predecessors, (249), 12 states have return successors, (249), 242 states have call predecessors, (249), 249 states have call successors, (249) [2025-01-09 09:39:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1717 transitions. [2025-01-09 09:39:10,569 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1717 transitions. Word has length 497 [2025-01-09 09:39:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:10,570 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1717 transitions. [2025-01-09 09:39:10,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1717 transitions. [2025-01-09 09:39:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-01-09 09:39:10,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:10,574 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:10,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:39:10,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:10,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1025208670, now seen corresponding path program 1 times [2025-01-09 09:39:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:10,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844792348] [2025-01-09 09:39:10,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:10,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-09 09:39:10,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-09 09:39:10,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:10,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:39:11,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:11,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844792348] [2025-01-09 09:39:11,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844792348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:11,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:11,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:39:11,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242702995] [2025-01-09 09:39:11,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:11,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:39:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:11,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:39:11,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:39:11,311 INFO L87 Difference]: Start difference. First operand 1037 states and 1717 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:13,002 INFO L93 Difference]: Finished difference Result 4204 states and 6928 transitions. [2025-01-09 09:39:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:39:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 498 [2025-01-09 09:39:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:13,021 INFO L225 Difference]: With dead ends: 4204 [2025-01-09 09:39:13,022 INFO L226 Difference]: Without dead ends: 3170 [2025-01-09 09:39:13,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:39:13,027 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1349 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:13,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1929 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 09:39:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2025-01-09 09:39:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3121. [2025-01-09 09:39:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2252 states have (on average 1.5399644760213145) internal successors, (3468), 2274 states have internal predecessors, (3468), 828 states have call successors, (828), 40 states have call predecessors, (828), 40 states have return successors, (828), 806 states have call predecessors, (828), 828 states have call successors, (828) [2025-01-09 09:39:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 5124 transitions. [2025-01-09 09:39:13,304 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 5124 transitions. Word has length 498 [2025-01-09 09:39:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:13,305 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 5124 transitions. [2025-01-09 09:39:13,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 5124 transitions. [2025-01-09 09:39:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-01-09 09:39:13,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:13,311 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:13,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:39:13,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:13,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1171901472, now seen corresponding path program 1 times [2025-01-09 09:39:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396821254] [2025-01-09 09:39:13,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:13,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-09 09:39:13,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-09 09:39:13,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:13,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:39:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396821254] [2025-01-09 09:39:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396821254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:14,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:14,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:39:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143112946] [2025-01-09 09:39:14,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:14,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:39:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:14,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:39:14,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:39:14,207 INFO L87 Difference]: Start difference. First operand 3121 states and 5124 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:14,415 INFO L93 Difference]: Finished difference Result 6336 states and 10360 transitions. [2025-01-09 09:39:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:39:14,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 498 [2025-01-09 09:39:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:14,435 INFO L225 Difference]: With dead ends: 6336 [2025-01-09 09:39:14,435 INFO L226 Difference]: Without dead ends: 3363 [2025-01-09 09:39:14,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:39:14,441 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 32 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:14,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1497 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2025-01-09 09:39:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3217. [2025-01-09 09:39:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 2348 states have (on average 1.5383304940374787) internal successors, (3612), 2370 states have internal predecessors, (3612), 828 states have call successors, (828), 40 states have call predecessors, (828), 40 states have return successors, (828), 806 states have call predecessors, (828), 828 states have call successors, (828) [2025-01-09 09:39:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 5268 transitions. [2025-01-09 09:39:14,669 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 5268 transitions. Word has length 498 [2025-01-09 09:39:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:14,670 INFO L471 AbstractCegarLoop]: Abstraction has 3217 states and 5268 transitions. [2025-01-09 09:39:14,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:39:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 5268 transitions. [2025-01-09 09:39:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-01-09 09:39:14,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:14,676 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:14,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:39:14,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1170054430, now seen corresponding path program 1 times [2025-01-09 09:39:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139638262] [2025-01-09 09:39:14,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:14,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-09 09:39:14,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-09 09:39:14,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:47,743 WARN L286 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 09:40:03,824 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 09:40:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:40:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:03,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139638262] [2025-01-09 09:40:03,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139638262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:03,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:03,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:40:03,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522543174] [2025-01-09 09:40:03,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:03,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:40:03,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:03,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:40:03,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:40:03,881 INFO L87 Difference]: Start difference. First operand 3217 states and 5268 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-01-09 09:40:12,479 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 44 DAG size of output: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 09:40:14,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:40:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:15,280 INFO L93 Difference]: Finished difference Result 9320 states and 15177 transitions. [2025-01-09 09:40:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:40:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 498 [2025-01-09 09:40:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:15,313 INFO L225 Difference]: With dead ends: 9320 [2025-01-09 09:40:15,313 INFO L226 Difference]: Without dead ends: 6251 [2025-01-09 09:40:15,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:40:15,325 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 1046 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:15,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1700 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 09:40:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2025-01-09 09:40:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6232. [2025-01-09 09:40:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6232 states, 4532 states have (on average 1.5220653133274493) internal successors, (6898), 4575 states have internal predecessors, (6898), 1599 states have call successors, (1599), 100 states have call predecessors, (1599), 100 states have return successors, (1599), 1556 states have call predecessors, (1599), 1599 states have call successors, (1599) [2025-01-09 09:40:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 10096 transitions. [2025-01-09 09:40:15,759 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 10096 transitions. Word has length 498 [2025-01-09 09:40:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:15,760 INFO L471 AbstractCegarLoop]: Abstraction has 6232 states and 10096 transitions. [2025-01-09 09:40:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-01-09 09:40:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 10096 transitions. [2025-01-09 09:40:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-01-09 09:40:15,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:15,765 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:15,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:40:15,765 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:15,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1314916260, now seen corresponding path program 1 times [2025-01-09 09:40:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057435350] [2025-01-09 09:40:15,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:15,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-01-09 09:40:15,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-01-09 09:40:15,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:15,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:40:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057435350] [2025-01-09 09:40:16,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057435350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:16,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471617551] [2025-01-09 09:40:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:16,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:16,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:16,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:16,156 INFO L87 Difference]: Start difference. First operand 6232 states and 10096 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:40:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:16,793 INFO L93 Difference]: Finished difference Result 14081 states and 22958 transitions. [2025-01-09 09:40:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:40:16,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 498 [2025-01-09 09:40:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:16,830 INFO L225 Difference]: With dead ends: 14081 [2025-01-09 09:40:16,830 INFO L226 Difference]: Without dead ends: 7997 [2025-01-09 09:40:16,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:40:16,843 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 348 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:16,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1364 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:40:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7997 states. [2025-01-09 09:40:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7997 to 7355. [2025-01-09 09:40:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7355 states, 5655 states have (on average 1.5674624226348364) internal successors, (8864), 5697 states have internal predecessors, (8864), 1599 states have call successors, (1599), 100 states have call predecessors, (1599), 100 states have return successors, (1599), 1557 states have call predecessors, (1599), 1599 states have call successors, (1599) [2025-01-09 09:40:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 12062 transitions. [2025-01-09 09:40:17,393 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 12062 transitions. Word has length 498 [2025-01-09 09:40:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:17,394 INFO L471 AbstractCegarLoop]: Abstraction has 7355 states and 12062 transitions. [2025-01-09 09:40:17,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:40:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 12062 transitions. [2025-01-09 09:40:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-01-09 09:40:17,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:17,406 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:17,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:40:17,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash -697050024, now seen corresponding path program 1 times [2025-01-09 09:40:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:17,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142176907] [2025-01-09 09:40:17,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:17,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-01-09 09:40:17,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-01-09 09:40:17,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:17,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:40:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142176907] [2025-01-09 09:40:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142176907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056843961] [2025-01-09 09:40:17,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:17,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:17,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:17,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:17,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:17,959 INFO L87 Difference]: Start difference. First operand 7355 states and 12062 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:40:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:18,238 INFO L93 Difference]: Finished difference Result 16336 states and 26759 transitions. [2025-01-09 09:40:18,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:18,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 499 [2025-01-09 09:40:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:18,292 INFO L225 Difference]: With dead ends: 16336 [2025-01-09 09:40:18,292 INFO L226 Difference]: Without dead ends: 9942 [2025-01-09 09:40:18,310 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 09:40:18,310 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 234 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:18,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 771 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9942 states. [2025-01-09 09:40:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9942 to 9834. [2025-01-09 09:40:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9834 states, 7596 states have (on average 1.570300157977883) internal successors, (11928), 7652 states have internal predecessors, (11928), 2105 states have call successors, (2105), 132 states have call predecessors, (2105), 132 states have return successors, (2105), 2049 states have call predecessors, (2105), 2105 states have call successors, (2105) [2025-01-09 09:40:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 16138 transitions. [2025-01-09 09:40:18,806 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 16138 transitions. Word has length 499 [2025-01-09 09:40:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:18,807 INFO L471 AbstractCegarLoop]: Abstraction has 9834 states and 16138 transitions. [2025-01-09 09:40:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:40:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 16138 transitions. [2025-01-09 09:40:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 09:40:18,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:18,813 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:18,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:40:18,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1402146910, now seen corresponding path program 1 times [2025-01-09 09:40:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302107262] [2025-01-09 09:40:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:18,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 09:40:18,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 09:40:18,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:18,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 9 proven. 231 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-01-09 09:40:19,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:19,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302107262] [2025-01-09 09:40:19,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302107262] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:19,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11865044] [2025-01-09 09:40:19,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:19,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:19,367 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 09:40:19,367 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 09:40:19,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 09:40:19,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 09:40:19,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:19,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:19,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 09:40:19,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:40:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 1010 proven. 231 refuted. 0 times theorem prover too weak. 11719 trivial. 0 not checked. [2025-01-09 09:40:20,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:40:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 9 proven. 231 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-01-09 09:40:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11865044] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:40:21,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:40:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 18 [2025-01-09 09:40:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490182071] [2025-01-09 09:40:21,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:40:21,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 09:40:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:21,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 09:40:21,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:40:21,070 INFO L87 Difference]: Start difference. First operand 9834 states and 16138 transitions. Second operand has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 2 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 2 states have call predecessors, (159), 2 states have call successors, (159) [2025-01-09 09:40:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:23,486 INFO L93 Difference]: Finished difference Result 31097 states and 50403 transitions. [2025-01-09 09:40:23,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 09:40:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 2 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 2 states have call predecessors, (159), 2 states have call successors, (159) Word has length 500 [2025-01-09 09:40:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:23,559 INFO L225 Difference]: With dead ends: 31097 [2025-01-09 09:40:23,560 INFO L226 Difference]: Without dead ends: 22024 [2025-01-09 09:40:23,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 993 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=691, Invalid=1565, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 09:40:23,589 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 1929 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:23,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 1742 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:40:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22024 states. [2025-01-09 09:40:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22024 to 10840. [2025-01-09 09:40:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10840 states, 8472 states have (on average 1.5339943342776203) internal successors, (12996), 8528 states have internal predecessors, (12996), 2105 states have call successors, (2105), 262 states have call predecessors, (2105), 262 states have return successors, (2105), 2049 states have call predecessors, (2105), 2105 states have call successors, (2105) [2025-01-09 09:40:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10840 states to 10840 states and 17206 transitions. [2025-01-09 09:40:24,386 INFO L78 Accepts]: Start accepts. Automaton has 10840 states and 17206 transitions. Word has length 500 [2025-01-09 09:40:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:24,387 INFO L471 AbstractCegarLoop]: Abstraction has 10840 states and 17206 transitions. [2025-01-09 09:40:24,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 2 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 2 states have call predecessors, (159), 2 states have call successors, (159) [2025-01-09 09:40:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 10840 states and 17206 transitions. [2025-01-09 09:40:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-09 09:40:24,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:24,393 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:24,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:40:24,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:24,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:24,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash 158406699, now seen corresponding path program 1 times [2025-01-09 09:40:24,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:24,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338555944] [2025-01-09 09:40:24,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:24,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:24,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 09:40:24,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 09:40:24,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:24,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 114 proven. 126 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-01-09 09:40:24,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338555944] [2025-01-09 09:40:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338555944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096581957] [2025-01-09 09:40:24,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:24,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:24,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:24,911 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 09:40:24,913 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 09:40:25,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-09 09:40:25,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-09 09:40:25,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:25,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:25,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 09:40:25,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:40:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6180 proven. 90 refuted. 0 times theorem prover too weak. 6690 trivial. 0 not checked. [2025-01-09 09:40:25,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:40:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 150 proven. 90 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-01-09 09:40:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096581957] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:40:25,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:40:25,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-01-09 09:40:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337215280] [2025-01-09 09:40:25,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:40:25,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:40:25,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:25,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:40:25,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:40:25,818 INFO L87 Difference]: Start difference. First operand 10840 states and 17206 transitions. Second operand has 11 states, 11 states have (on average 17.545454545454547) internal successors, (193), 11 states have internal predecessors, (193), 4 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 4 states have call predecessors, (155), 4 states have call successors, (155) [2025-01-09 09:40:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:27,291 INFO L93 Difference]: Finished difference Result 22601 states and 35493 transitions. [2025-01-09 09:40:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 09:40:27,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.545454545454547) internal successors, (193), 11 states have internal predecessors, (193), 4 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 4 states have call predecessors, (155), 4 states have call successors, (155) Word has length 501 [2025-01-09 09:40:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:27,328 INFO L225 Difference]: With dead ends: 22601 [2025-01-09 09:40:27,328 INFO L226 Difference]: Without dead ends: 12246 [2025-01-09 09:40:27,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1024 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2025-01-09 09:40:27,344 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 740 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:27,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1575 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:40:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12246 states. [2025-01-09 09:40:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12246 to 9064. [2025-01-09 09:40:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9064 states, 7301 states have (on average 1.5460895767703053) internal successors, (11288), 7341 states have internal predecessors, (11288), 1553 states have call successors, (1553), 209 states have call predecessors, (1553), 209 states have return successors, (1553), 1513 states have call predecessors, (1553), 1553 states have call successors, (1553) [2025-01-09 09:40:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9064 states to 9064 states and 14394 transitions. [2025-01-09 09:40:27,863 INFO L78 Accepts]: Start accepts. Automaton has 9064 states and 14394 transitions. Word has length 501 [2025-01-09 09:40:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:27,864 INFO L471 AbstractCegarLoop]: Abstraction has 9064 states and 14394 transitions. [2025-01-09 09:40:27,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.545454545454547) internal successors, (193), 11 states have internal predecessors, (193), 4 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 4 states have call predecessors, (155), 4 states have call successors, (155) [2025-01-09 09:40:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 9064 states and 14394 transitions. [2025-01-09 09:40:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 09:40:27,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:27,870 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:27,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:40:28,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:28,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:28,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash 258715577, now seen corresponding path program 1 times [2025-01-09 09:40:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:28,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409483341] [2025-01-09 09:40:28,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:28,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:28,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:40:28,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:40:28,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:28,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-01-09 09:40:28,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:28,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409483341] [2025-01-09 09:40:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409483341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:28,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:28,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:28,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028744782] [2025-01-09 09:40:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:28,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:28,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:28,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:28,440 INFO L87 Difference]: Start difference. First operand 9064 states and 14394 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:40:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:29,034 INFO L93 Difference]: Finished difference Result 23131 states and 36536 transitions. [2025-01-09 09:40:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:29,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 504 [2025-01-09 09:40:29,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:29,080 INFO L225 Difference]: With dead ends: 23131 [2025-01-09 09:40:29,080 INFO L226 Difference]: Without dead ends: 14945 [2025-01-09 09:40:29,095 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 09:40:29,096 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 243 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:29,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 896 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14945 states. [2025-01-09 09:40:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14945 to 9708. [2025-01-09 09:40:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9708 states, 7945 states have (on average 1.553681560730019) internal successors, (12344), 7985 states have internal predecessors, (12344), 1553 states have call successors, (1553), 209 states have call predecessors, (1553), 209 states have return successors, (1553), 1513 states have call predecessors, (1553), 1553 states have call successors, (1553) [2025-01-09 09:40:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9708 states to 9708 states and 15450 transitions. [2025-01-09 09:40:29,781 INFO L78 Accepts]: Start accepts. Automaton has 9708 states and 15450 transitions. Word has length 504 [2025-01-09 09:40:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 9708 states and 15450 transitions. [2025-01-09 09:40:29,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-01-09 09:40:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 9708 states and 15450 transitions. [2025-01-09 09:40:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 09:40:29,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:29,787 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:29,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:40:29,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:29,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -585289925, now seen corresponding path program 1 times [2025-01-09 09:40:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841497178] [2025-01-09 09:40:29,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:29,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:40:29,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:40:29,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:29,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 123 proven. 117 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-01-09 09:40:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841497178] [2025-01-09 09:40:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841497178] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712718870] [2025-01-09 09:40:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:30,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:30,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:30,093 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 09:40:30,095 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 09:40:30,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:40:30,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:40:30,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:30,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:30,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:40:30,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:40:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 4304 proven. 48 refuted. 0 times theorem prover too weak. 8608 trivial. 0 not checked. [2025-01-09 09:40:30,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:40:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 192 proven. 48 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-01-09 09:40:30,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712718870] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:40:30,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:40:30,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 09:40:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272767660] [2025-01-09 09:40:30,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:40:30,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:40:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:30,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:40:30,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:40:30,833 INFO L87 Difference]: Start difference. First operand 9708 states and 15450 transitions. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 3 states have call successors, (136), 2 states have call predecessors, (136), 4 states have return successors, (138), 3 states have call predecessors, (138), 3 states have call successors, (138) [2025-01-09 09:40:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:31,777 INFO L93 Difference]: Finished difference Result 19122 states and 30181 transitions. [2025-01-09 09:40:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:40:31,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 3 states have call successors, (136), 2 states have call predecessors, (136), 4 states have return successors, (138), 3 states have call predecessors, (138), 3 states have call successors, (138) Word has length 504 [2025-01-09 09:40:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:31,808 INFO L225 Difference]: With dead ends: 19122 [2025-01-09 09:40:31,808 INFO L226 Difference]: Without dead ends: 10072 [2025-01-09 09:40:31,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1022 GetRequests, 1005 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:40:31,821 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 540 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:31,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 719 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:40:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10072 states. [2025-01-09 09:40:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10072 to 9260. [2025-01-09 09:40:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9260 states, 7479 states have (on average 1.523331996256184) internal successors, (11393), 7519 states have internal predecessors, (11393), 1553 states have call successors, (1553), 227 states have call predecessors, (1553), 227 states have return successors, (1553), 1513 states have call predecessors, (1553), 1553 states have call successors, (1553) [2025-01-09 09:40:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9260 states to 9260 states and 14499 transitions. [2025-01-09 09:40:32,423 INFO L78 Accepts]: Start accepts. Automaton has 9260 states and 14499 transitions. Word has length 504 [2025-01-09 09:40:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:32,425 INFO L471 AbstractCegarLoop]: Abstraction has 9260 states and 14499 transitions. [2025-01-09 09:40:32,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 3 states have call successors, (136), 2 states have call predecessors, (136), 4 states have return successors, (138), 3 states have call predecessors, (138), 3 states have call successors, (138) [2025-01-09 09:40:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9260 states and 14499 transitions. [2025-01-09 09:40:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-01-09 09:40:32,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:32,430 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:32,438 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 09:40:32,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 09:40:32,631 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:32,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash -921237171, now seen corresponding path program 1 times [2025-01-09 09:40:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596636061] [2025-01-09 09:40:32,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:32,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 09:40:32,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 09:40:32,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:32,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 174 proven. 66 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-01-09 09:40:32,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:32,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596636061] [2025-01-09 09:40:32,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596636061] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:32,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882290302] [2025-01-09 09:40:32,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:32,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:32,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:32,874 INFO L229 MonitoredProcess]: Starting monitored process 6 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 09:40:32,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process