./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-23.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-23.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 377c50164edaea0f53442aa9874bfca88923ba53cddca037aa8305c7918e29d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:40:33,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:40:33,122 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:40:33,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:40:33,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:40:33,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:40:33,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:40:33,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:40:33,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:40:33,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:40:33,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:40:33,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:40:33,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:40:33,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:40:33,159 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:40:33,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:40:33,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:40:33,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:40:33,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:40:33,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:40:33,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:40:33,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:40:33,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:40:33,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:40:33,160 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:40:33,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:40:33,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:40:33,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:40:33,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:40:33,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:33,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:33,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:40:33,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:40:33,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:40:33,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:40:33,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:40:33,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:40:33,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:40:33,163 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 -> 377c50164edaea0f53442aa9874bfca88923ba53cddca037aa8305c7918e29d9 [2025-01-09 09:40:33,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:40:33,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:40:33,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:40:33,443 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:40:33,443 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:40:33,445 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-23.i [2025-01-09 09:40:34,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adf58d59c/517a73b3ec3945e38904cc114f9521a4/FLAG32126daeb [2025-01-09 09:40:35,098 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:40:35,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-23.i [2025-01-09 09:40:35,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adf58d59c/517a73b3ec3945e38904cc114f9521a4/FLAG32126daeb [2025-01-09 09:40:35,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adf58d59c/517a73b3ec3945e38904cc114f9521a4 [2025-01-09 09:40:35,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:40:35,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:40:35,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:40:35,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:40:35,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:40:35,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738da5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35, skipping insertion in model container [2025-01-09 09:40:35,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:40:35,336 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-23.i[916,929] [2025-01-09 09:40:35,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:40:35,495 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:40:35,510 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-23.i[916,929] [2025-01-09 09:40:35,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:40:35,645 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:40:35,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35 WrapperNode [2025-01-09 09:40:35,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:40:35,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:40:35,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:40:35,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:40:35,653 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:40:35" (1/1) ... [2025-01-09 09:40:35,677 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:40:35" (1/1) ... [2025-01-09 09:40:35,754 INFO L138 Inliner]: procedures = 26, calls = 90, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 516 [2025-01-09 09:40:35,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:40:35,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:40:35,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:40:35,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:40:35,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,824 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:40:35,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:40:35,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:40:35,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:40:35,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:40:35,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (1/1) ... [2025-01-09 09:40:35,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:35,922 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:40:35,931 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:40:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:40:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:40:35,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:40:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:40:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:40:35,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:40:36,080 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:40:36,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:40:37,105 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 09:40:37,106 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:40:37,122 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:40:37,125 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:40:37,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:37 BoogieIcfgContainer [2025-01-09 09:40:37,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:40:37,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:40:37,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:40:37,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:40:37,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:40:35" (1/3) ... [2025-01-09 09:40:37,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fc4754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:37, skipping insertion in model container [2025-01-09 09:40:37,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:35" (2/3) ... [2025-01-09 09:40:37,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fc4754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:37, skipping insertion in model container [2025-01-09 09:40:37,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:37" (3/3) ... [2025-01-09 09:40:37,137 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-23.i [2025-01-09 09:40:37,151 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:40:37,154 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-23.i that has 2 procedures, 219 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:40:37,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:40:37,241 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;@2e52c133, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:40:37,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:40:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 139 states have (on average 1.5035971223021583) internal successors, (209), 140 states have internal predecessors, (209), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 09:40:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 09:40:37,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:37,276 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash -243327687, now seen corresponding path program 1 times [2025-01-09 09:40:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:37,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773136228] [2025-01-09 09:40:37,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:37,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 09:40:37,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 09:40:37,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:37,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-01-09 09:40:37,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773136228] [2025-01-09 09:40:37,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773136228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720323967] [2025-01-09 09:40:37,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:37,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:37,890 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:40:37,892 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:40:38,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 09:40:38,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 09:40:38,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:38,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:38,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:40:38,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:40:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-01-09 09:40:38,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:40:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720323967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:38,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:40:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:40:38,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948297882] [2025-01-09 09:40:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:38,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:40:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:38,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:40:38,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:40:38,388 INFO L87 Difference]: Start difference. First operand has 219 states, 139 states have (on average 1.5035971223021583) internal successors, (209), 140 states have internal predecessors, (209), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 09:40:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:38,443 INFO L93 Difference]: Finished difference Result 432 states and 798 transitions. [2025-01-09 09:40:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:40:38,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) Word has length 483 [2025-01-09 09:40:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:38,458 INFO L225 Difference]: With dead ends: 432 [2025-01-09 09:40:38,458 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 09:40:38,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 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:40:38,466 INFO L435 NwaCegarLoop]: 356 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, 356 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:40:38,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 09:40:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-01-09 09:40:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.4744525547445255) internal successors, (202), 137 states have internal predecessors, (202), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 09:40:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 356 transitions. [2025-01-09 09:40:38,545 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 356 transitions. Word has length 483 [2025-01-09 09:40:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:38,546 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 356 transitions. [2025-01-09 09:40:38,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 09:40:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 356 transitions. [2025-01-09 09:40:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 09:40:38,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:38,560 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:40:38,761 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:40:38,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2039813103, now seen corresponding path program 1 times [2025-01-09 09:40:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:38,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519773366] [2025-01-09 09:40:38,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:38,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 09:40:38,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 09:40:38,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:38,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 09:40:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519773366] [2025-01-09 09:40:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519773366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:39,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571035123] [2025-01-09 09:40:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:39,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:39,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:39,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:39,800 INFO L87 Difference]: Start difference. First operand 216 states and 356 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:39,970 INFO L93 Difference]: Finished difference Result 643 states and 1064 transitions. [2025-01-09 09:40:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:39,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 483 [2025-01-09 09:40:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:39,979 INFO L225 Difference]: With dead ends: 643 [2025-01-09 09:40:39,980 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 09:40:39,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:39,986 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 215 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:39,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1023 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:40:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 09:40:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2025-01-09 09:40:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 09:40:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 705 transitions. [2025-01-09 09:40:40,101 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 705 transitions. Word has length 483 [2025-01-09 09:40:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:40,104 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 705 transitions. [2025-01-09 09:40:40,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 705 transitions. [2025-01-09 09:40:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 09:40:40,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:40,114 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:40:40,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:40,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:40,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2042534535, now seen corresponding path program 1 times [2025-01-09 09:40:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:40,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247340324] [2025-01-09 09:40:40,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:40,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 09:40:40,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 09:40:40,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:40,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 09:40:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247340324] [2025-01-09 09:40:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247340324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769762959] [2025-01-09 09:40:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:41,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:41,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:41,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:41,120 INFO L87 Difference]: Start difference. First operand 426 states and 705 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:41,715 INFO L93 Difference]: Finished difference Result 1832 states and 3013 transitions. [2025-01-09 09:40:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:40:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 484 [2025-01-09 09:40:41,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:41,731 INFO L225 Difference]: With dead ends: 1832 [2025-01-09 09:40:41,732 INFO L226 Difference]: Without dead ends: 1409 [2025-01-09 09:40:41,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:41,735 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 592 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:41,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 2024 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:40:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-01-09 09:40:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1399. [2025-01-09 09:40:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 826 states have (on average 1.4188861985472154) internal successors, (1172), 830 states have internal predecessors, (1172), 564 states have call successors, (564), 8 states have call predecessors, (564), 8 states have return successors, (564), 560 states have call predecessors, (564), 564 states have call successors, (564) [2025-01-09 09:40:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2300 transitions. [2025-01-09 09:40:42,000 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2300 transitions. Word has length 484 [2025-01-09 09:40:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:42,002 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 2300 transitions. [2025-01-09 09:40:42,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2300 transitions. [2025-01-09 09:40:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 09:40:42,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:42,013 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:40:42,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:42,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2119958646, now seen corresponding path program 1 times [2025-01-09 09:40:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351877004] [2025-01-09 09:40:42,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:42,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:40:42,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:40:42,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:42,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 09:40:42,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:42,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351877004] [2025-01-09 09:40:42,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351877004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:42,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:42,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487331234] [2025-01-09 09:40:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:42,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:42,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:42,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:42,266 INFO L87 Difference]: Start difference. First operand 1399 states and 2300 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:42,468 INFO L93 Difference]: Finished difference Result 3859 states and 6342 transitions. [2025-01-09 09:40:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-01-09 09:40:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:42,498 INFO L225 Difference]: With dead ends: 3859 [2025-01-09 09:40:42,498 INFO L226 Difference]: Without dead ends: 2463 [2025-01-09 09:40:42,508 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:42,510 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 244 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:42,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 693 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2025-01-09 09:40:42,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2453. [2025-01-09 09:40:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 1496 states have (on average 1.429144385026738) internal successors, (2138), 1508 states have internal predecessors, (2138), 940 states have call successors, (940), 16 states have call predecessors, (940), 16 states have return successors, (940), 928 states have call predecessors, (940), 940 states have call successors, (940) [2025-01-09 09:40:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 4018 transitions. [2025-01-09 09:40:42,893 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 4018 transitions. Word has length 485 [2025-01-09 09:40:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:42,895 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 4018 transitions. [2025-01-09 09:40:42,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 4018 transitions. [2025-01-09 09:40:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 09:40:42,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:42,902 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:40:42,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:42,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2137792228, now seen corresponding path program 1 times [2025-01-09 09:40:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948595950] [2025-01-09 09:40:42,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:42,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:42,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:40:43,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:40:43,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:43,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 09:40:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948595950] [2025-01-09 09:40:43,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948595950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337289803] [2025-01-09 09:40:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:43,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:43,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:43,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:43,804 INFO L87 Difference]: Start difference. First operand 2453 states and 4018 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:44,908 INFO L93 Difference]: Finished difference Result 6745 states and 11053 transitions. [2025-01-09 09:40:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:44,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-01-09 09:40:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:44,948 INFO L225 Difference]: With dead ends: 6745 [2025-01-09 09:40:44,948 INFO L226 Difference]: Without dead ends: 4295 [2025-01-09 09:40:44,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:44,963 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 378 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:44,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 892 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:40:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2025-01-09 09:40:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 3841. [2025-01-09 09:40:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 2406 states have (on average 1.4447215295095595) internal successors, (3476), 2424 states have internal predecessors, (3476), 1410 states have call successors, (1410), 24 states have call predecessors, (1410), 24 states have return successors, (1410), 1392 states have call predecessors, (1410), 1410 states have call successors, (1410) [2025-01-09 09:40:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 6296 transitions. [2025-01-09 09:40:45,535 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 6296 transitions. Word has length 485 [2025-01-09 09:40:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:45,537 INFO L471 AbstractCegarLoop]: Abstraction has 3841 states and 6296 transitions. [2025-01-09 09:40:45,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 6296 transitions. [2025-01-09 09:40:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 09:40:45,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:45,545 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:40:45,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:45,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1191975833, now seen corresponding path program 1 times [2025-01-09 09:40:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223150890] [2025-01-09 09:40:45,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:45,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:40:45,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:40:45,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:45,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 09:40:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223150890] [2025-01-09 09:40:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223150890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:46,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:46,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:46,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653078534] [2025-01-09 09:40:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:46,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:46,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:46,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:46,299 INFO L87 Difference]: Start difference. First operand 3841 states and 6296 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:47,564 INFO L93 Difference]: Finished difference Result 13947 states and 22775 transitions. [2025-01-09 09:40:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:47,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-01-09 09:40:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:47,652 INFO L225 Difference]: With dead ends: 13947 [2025-01-09 09:40:47,652 INFO L226 Difference]: Without dead ends: 10109 [2025-01-09 09:40:47,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:47,676 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 551 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:47,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 947 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:40:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10109 states. [2025-01-09 09:40:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10109 to 7321. [2025-01-09 09:40:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7321 states, 4650 states have (on average 1.4537634408602151) internal successors, (6760), 4692 states have internal predecessors, (6760), 2622 states have call successors, (2622), 48 states have call predecessors, (2622), 48 states have return successors, (2622), 2580 states have call predecessors, (2622), 2622 states have call successors, (2622) [2025-01-09 09:40:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 12004 transitions. [2025-01-09 09:40:48,598 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 12004 transitions. Word has length 485 [2025-01-09 09:40:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:48,599 INFO L471 AbstractCegarLoop]: Abstraction has 7321 states and 12004 transitions. [2025-01-09 09:40:48,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 12004 transitions. [2025-01-09 09:40:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 09:40:48,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:48,610 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:40:48,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:48,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash -802168873, now seen corresponding path program 1 times [2025-01-09 09:40:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:48,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131987479] [2025-01-09 09:40:48,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:48,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:40:48,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:40:48,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:48,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 09:40:49,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:49,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131987479] [2025-01-09 09:40:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131987479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:49,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:49,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:40:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936370282] [2025-01-09 09:40:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:49,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:40:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:49,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:40:49,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:40:49,671 INFO L87 Difference]: Start difference. First operand 7321 states and 12004 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:52,776 INFO L93 Difference]: Finished difference Result 26715 states and 43362 transitions. [2025-01-09 09:40:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:40:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-01-09 09:40:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:52,928 INFO L225 Difference]: With dead ends: 26715 [2025-01-09 09:40:52,928 INFO L226 Difference]: Without dead ends: 19201 [2025-01-09 09:40:52,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:40:52,975 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 1279 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 768 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:52,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 1467 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [768 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 09:40:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19201 states. [2025-01-09 09:40:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19201 to 7147. [2025-01-09 09:40:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7147 states, 5028 states have (on average 1.532219570405728) internal successors, (7704), 5058 states have internal predecessors, (7704), 2058 states have call successors, (2058), 60 states have call predecessors, (2058), 60 states have return successors, (2058), 2028 states have call predecessors, (2058), 2058 states have call successors, (2058) [2025-01-09 09:40:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7147 states to 7147 states and 11820 transitions. [2025-01-09 09:40:54,410 INFO L78 Accepts]: Start accepts. Automaton has 7147 states and 11820 transitions. Word has length 485 [2025-01-09 09:40:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:54,412 INFO L471 AbstractCegarLoop]: Abstraction has 7147 states and 11820 transitions. [2025-01-09 09:40:54,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:40:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 7147 states and 11820 transitions. [2025-01-09 09:40:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 09:40:54,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:54,427 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:40:54,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:54,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1254015447, now seen corresponding path program 1 times [2025-01-09 09:40:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:54,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266418001] [2025-01-09 09:40:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:54,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:40:54,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:40:54,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:54,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 162 proven. 66 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 09:40:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266418001] [2025-01-09 09:40:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266418001] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529579104] [2025-01-09 09:40:55,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:55,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:55,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:55,014 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:55,016 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:55,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:40:55,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:40:55,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:55,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:55,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:40:55,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:40:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 4206 proven. 51 refuted. 0 times theorem prover too weak. 7447 trivial. 0 not checked. [2025-01-09 09:40:55,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:40:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 177 proven. 51 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 09:40:56,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529579104] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:40:56,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:40:56,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 09:40:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812570447] [2025-01-09 09:40:56,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:40:56,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:40:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:56,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:40:56,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:40:56,099 INFO L87 Difference]: Start difference. First operand 7147 states and 11820 transitions. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 3 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 3 states have call predecessors, (118), 3 states have call successors, (118) [2025-01-09 09:40:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:57,686 INFO L93 Difference]: Finished difference Result 13316 states and 21668 transitions. [2025-01-09 09:40:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:40:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 3 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 3 states have call predecessors, (118), 3 states have call successors, (118) Word has length 485 [2025-01-09 09:40:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:57,732 INFO L225 Difference]: With dead ends: 13316 [2025-01-09 09:40:57,732 INFO L226 Difference]: Without dead ends: 6172 [2025-01-09 09:40:57,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 967 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:40:57,759 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 540 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:57,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 889 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:40:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6172 states. [2025-01-09 09:40:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6172 to 5723. [2025-01-09 09:40:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5723 states, 3580 states have (on average 1.3905027932960894) internal successors, (4978), 3610 states have internal predecessors, (4978), 2058 states have call successors, (2058), 84 states have call predecessors, (2058), 84 states have return successors, (2058), 2028 states have call predecessors, (2058), 2058 states have call successors, (2058) [2025-01-09 09:40:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 9094 transitions. [2025-01-09 09:40:58,558 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 9094 transitions. Word has length 485 [2025-01-09 09:40:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:58,559 INFO L471 AbstractCegarLoop]: Abstraction has 5723 states and 9094 transitions. [2025-01-09 09:40:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 3 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 3 states have call predecessors, (118), 3 states have call successors, (118) [2025-01-09 09:40:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 9094 transitions. [2025-01-09 09:40:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 09:40:58,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:58,566 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:40:58,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:58,767 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:58,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1311641963, now seen corresponding path program 1 times [2025-01-09 09:40:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022058554] [2025-01-09 09:40:58,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:40:58,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:40:58,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:58,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 09:40:59,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022058554] [2025-01-09 09:40:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022058554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:59,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276368248] [2025-01-09 09:40:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:59,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:59,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:59,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:59,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:59,319 INFO L87 Difference]: Start difference. First operand 5723 states and 9094 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:41:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:41:00,334 INFO L93 Difference]: Finished difference Result 11515 states and 18245 transitions. [2025-01-09 09:41:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:41:00,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 485 [2025-01-09 09:41:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:41:00,384 INFO L225 Difference]: With dead ends: 11515 [2025-01-09 09:41:00,385 INFO L226 Difference]: Without dead ends: 5771 [2025-01-09 09:41:00,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:41:00,413 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 264 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:41:00,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 659 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:41:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2025-01-09 09:41:01,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5771. [2025-01-09 09:41:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5771 states, 3616 states have (on average 1.3799778761061947) internal successors, (4990), 3646 states have internal predecessors, (4990), 2058 states have call successors, (2058), 96 states have call predecessors, (2058), 96 states have return successors, (2058), 2028 states have call predecessors, (2058), 2058 states have call successors, (2058) [2025-01-09 09:41:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5771 states to 5771 states and 9106 transitions. [2025-01-09 09:41:01,199 INFO L78 Accepts]: Start accepts. Automaton has 5771 states and 9106 transitions. Word has length 485 [2025-01-09 09:41:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:41:01,200 INFO L471 AbstractCegarLoop]: Abstraction has 5771 states and 9106 transitions. [2025-01-09 09:41:01,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 09:41:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 9106 transitions. [2025-01-09 09:41:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 09:41:01,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:41:01,207 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:01,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:41:01,207 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:41:01,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:41:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash 74561431, now seen corresponding path program 1 times [2025-01-09 09:41:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:41:01,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590363999] [2025-01-09 09:41:01,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:41:01,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:41:01,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:41:01,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:01,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 168 proven. 60 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 09:41:01,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:41:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590363999] [2025-01-09 09:41:01,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590363999] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:41:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740681801] [2025-01-09 09:41:01,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:01,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:41:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:41:01,977 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:41:01,981 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:41:02,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:41:02,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:41:02,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:02,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:02,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 09:41:02,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:41:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 4668 proven. 60 refuted. 0 times theorem prover too weak. 6976 trivial. 0 not checked. [2025-01-09 09:41:03,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:41:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 168 proven. 60 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 09:41:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740681801] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:41:04,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:41:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2025-01-09 09:41:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153330833] [2025-01-09 09:41:04,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:41:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 09:41:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:41:04,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 09:41:04,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:41:04,209 INFO L87 Difference]: Start difference. First operand 5771 states and 9106 transitions. Second operand has 18 states, 18 states have (on average 12.722222222222221) internal successors, (229), 18 states have internal predecessors, (229), 5 states have call successors, (174), 3 states have call predecessors, (174), 6 states have return successors, (175), 5 states have call predecessors, (175), 5 states have call successors, (175) [2025-01-09 09:41:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:41:07,365 INFO L93 Difference]: Finished difference Result 15232 states and 23938 transitions. [2025-01-09 09:41:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 09:41:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.722222222222221) internal successors, (229), 18 states have internal predecessors, (229), 5 states have call successors, (174), 3 states have call predecessors, (174), 6 states have return successors, (175), 5 states have call predecessors, (175), 5 states have call successors, (175) Word has length 485 [2025-01-09 09:41:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:41:07,427 INFO L225 Difference]: With dead ends: 15232 [2025-01-09 09:41:07,427 INFO L226 Difference]: Without dead ends: 9264 [2025-01-09 09:41:07,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=740, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 09:41:07,452 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1225 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 1082 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1082 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:41:07,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1488 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1082 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 09:41:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9264 states. [2025-01-09 09:41:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9264 to 5783. [2025-01-09 09:41:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5783 states, 3616 states have (on average 1.351216814159292) internal successors, (4886), 3646 states have internal predecessors, (4886), 2058 states have call successors, (2058), 108 states have call predecessors, (2058), 108 states have return successors, (2058), 2028 states have call predecessors, (2058), 2058 states have call successors, (2058) [2025-01-09 09:41:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 9002 transitions. [2025-01-09 09:41:08,298 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 9002 transitions. Word has length 485 [2025-01-09 09:41:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:41:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 5783 states and 9002 transitions. [2025-01-09 09:41:08,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.722222222222221) internal successors, (229), 18 states have internal predecessors, (229), 5 states have call successors, (174), 3 states have call predecessors, (174), 6 states have return successors, (175), 5 states have call predecessors, (175), 5 states have call successors, (175) [2025-01-09 09:41:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 9002 transitions. [2025-01-09 09:41:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 09:41:08,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:41:08,306 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:41:08,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:41:08,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:41:08,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:41:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash -627038443, now seen corresponding path program 1 times [2025-01-09 09:41:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:41:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123615501] [2025-01-09 09:41:08,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:41:08,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:41:08,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:41:08,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:08,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:41:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977640065] [2025-01-09 09:41:08,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:41:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:41:08,824 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:41:08,827 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:41:08,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 09:41:09,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 09:41:09,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:09,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:09,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 09:41:09,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:41:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 4299 proven. 897 refuted. 0 times theorem prover too weak. 6508 trivial. 0 not checked. [2025-01-09 09:41:14,759 INFO L312 TraceCheckSpWp]: Computing backward predicates...