./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-60.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_operatoramount_amount250_file-60.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 3224c7ce33f237be232cf79b6768d3049de036e94cfbba7e5633ddcf2e2d784f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:26:07,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:26:07,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:26:07,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:26:07,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:26:08,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:26:08,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:26:08,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:26:08,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:26:08,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:26:08,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:26:08,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:26:08,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:26:08,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:26:08,015 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:26:08,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:26:08,016 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:26:08,016 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:26:08,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:08,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:08,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:08,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:08,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:26:08,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:08,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:08,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:08,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:26:08,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:26:08,018 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 -> 3224c7ce33f237be232cf79b6768d3049de036e94cfbba7e5633ddcf2e2d784f [2025-01-09 14:26:08,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:26:08,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:26:08,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:26:08,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:26:08,265 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:26:08,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-60.i [2025-01-09 14:26:09,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af28bf1d9/81d1ac504dce481baf342b3ebb9c3c3e/FLAG0b54c0d6e [2025-01-09 14:26:09,834 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:26:09,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-60.i [2025-01-09 14:26:09,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af28bf1d9/81d1ac504dce481baf342b3ebb9c3c3e/FLAG0b54c0d6e [2025-01-09 14:26:10,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af28bf1d9/81d1ac504dce481baf342b3ebb9c3c3e [2025-01-09 14:26:10,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:26:10,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:26:10,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:10,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:26:10,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:26:10,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ea8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10, skipping insertion in model container [2025-01-09 14:26:10,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:26:10,193 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_operatoramount_amount250_file-60.i[916,929] [2025-01-09 14:26:10,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:10,336 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:26:10,347 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_operatoramount_amount250_file-60.i[916,929] [2025-01-09 14:26:10,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:10,409 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:26:10,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10 WrapperNode [2025-01-09 14:26:10,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:10,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:10,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:26:10,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:26:10,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,488 INFO L138 Inliner]: procedures = 26, calls = 77, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 433 [2025-01-09 14:26:10,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:10,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:26:10,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:26:10,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:26:10,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,541 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 14:26:10,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:26:10,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:26:10,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:26:10,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:26:10,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (1/1) ... [2025-01-09 14:26:10,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:10,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:10,633 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 14:26:10,638 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 14:26:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:26:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:26:10,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:26:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:26:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:26:10,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:26:10,734 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:26:10,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:26:11,310 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-01-09 14:26:11,310 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:26:11,322 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:26:11,324 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:26:11,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:11 BoogieIcfgContainer [2025-01-09 14:26:11,325 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:26:11,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:26:11,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:26:11,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:26:11,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:26:10" (1/3) ... [2025-01-09 14:26:11,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe6e6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:11, skipping insertion in model container [2025-01-09 14:26:11,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:10" (2/3) ... [2025-01-09 14:26:11,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe6e6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:11, skipping insertion in model container [2025-01-09 14:26:11,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:11" (3/3) ... [2025-01-09 14:26:11,332 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-60.i [2025-01-09 14:26:11,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:26:11,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-60.i that has 2 procedures, 186 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:26:11,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:26:11,403 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;@701bd2e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:26:11,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:26:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 120 states have internal predecessors, (171), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 14:26:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-01-09 14:26:11,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:11,425 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:26:11,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:11,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:11,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1081907171, now seen corresponding path program 1 times [2025-01-09 14:26:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905687236] [2025-01-09 14:26:11,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:11,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:11,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:11,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:11,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-01-09 14:26:11,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905687236] [2025-01-09 14:26:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905687236] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970809396] [2025-01-09 14:26:11,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:11,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:11,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:11,931 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 14:26:11,939 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 14:26:12,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:12,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:12,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:12,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:12,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:26:12,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-01-09 14:26:12,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:26:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970809396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:12,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:26:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:26:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881855118] [2025-01-09 14:26:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:26:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:12,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:26:12,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:26:12,309 INFO L87 Difference]: Start difference. First operand has 186 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 120 states have internal predecessors, (171), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-01-09 14:26:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:12,354 INFO L93 Difference]: Finished difference Result 366 states and 657 transitions. [2025-01-09 14:26:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:26:12,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) Word has length 406 [2025-01-09 14:26:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:12,361 INFO L225 Difference]: With dead ends: 366 [2025-01-09 14:26:12,362 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 14:26:12,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 407 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 14:26:12,369 INFO L435 NwaCegarLoop]: 292 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, 292 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 14:26:12,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 14:26:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-01-09 14:26:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 14:26:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 292 transitions. [2025-01-09 14:26:12,426 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 292 transitions. Word has length 406 [2025-01-09 14:26:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:12,428 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 292 transitions. [2025-01-09 14:26:12,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-01-09 14:26:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 292 transitions. [2025-01-09 14:26:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-01-09 14:26:12,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:12,437 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:26:12,446 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 14:26:12,642 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 14:26:12,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:12,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1974298361, now seen corresponding path program 1 times [2025-01-09 14:26:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417868919] [2025-01-09 14:26:12,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:12,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:12,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:12,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:12,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:26:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417868919] [2025-01-09 14:26:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417868919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:13,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:13,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:13,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53685941] [2025-01-09 14:26:13,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:13,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:13,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:13,803 INFO L87 Difference]: Start difference. First operand 183 states and 292 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:26:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:14,072 INFO L93 Difference]: Finished difference Result 543 states and 869 transitions. [2025-01-09 14:26:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:14,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 406 [2025-01-09 14:26:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:14,076 INFO L225 Difference]: With dead ends: 543 [2025-01-09 14:26:14,076 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 14:26:14,078 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 14:26:14,078 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 166 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:14,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 854 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 14:26:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 293. [2025-01-09 14:26:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 162 states have internal predecessors, (209), 128 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 14:26:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 465 transitions. [2025-01-09 14:26:14,114 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 465 transitions. Word has length 406 [2025-01-09 14:26:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:14,115 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 465 transitions. [2025-01-09 14:26:14,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:26:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 465 transitions. [2025-01-09 14:26:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-01-09 14:26:14,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:14,123 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:26:14,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:26:14,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:14,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 712874503, now seen corresponding path program 1 times [2025-01-09 14:26:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:14,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580809162] [2025-01-09 14:26:14,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:14,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:14,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:14,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:14,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:26:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:14,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580809162] [2025-01-09 14:26:14,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580809162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:14,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:26:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427627027] [2025-01-09 14:26:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:14,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:26:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:14,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:26:14,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:26:14,863 INFO L87 Difference]: Start difference. First operand 293 states and 465 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:26:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:14,941 INFO L93 Difference]: Finished difference Result 653 states and 1043 transitions. [2025-01-09 14:26:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:26:14,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 406 [2025-01-09 14:26:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:14,946 INFO L225 Difference]: With dead ends: 653 [2025-01-09 14:26:14,949 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 14:26:14,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 14:26:14,951 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 175 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:14,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 566 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 14:26:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2025-01-09 14:26:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 275 states have internal predecessors, (367), 192 states have call successors, (192), 3 states have call predecessors, (192), 3 states have return successors, (192), 192 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 14:26:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 751 transitions. [2025-01-09 14:26:15,031 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 751 transitions. Word has length 406 [2025-01-09 14:26:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:15,033 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 751 transitions. [2025-01-09 14:26:15,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:26:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 751 transitions. [2025-01-09 14:26:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-01-09 14:26:15,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:15,037 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:26:15,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:26:15,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:15,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash 318507717, now seen corresponding path program 1 times [2025-01-09 14:26:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812451150] [2025-01-09 14:26:15,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:15,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:15,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:15,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:15,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-01-09 14:26:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812451150] [2025-01-09 14:26:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812451150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915135053] [2025-01-09 14:26:15,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:15,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:15,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:15,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:15,476 INFO L87 Difference]: Start difference. First operand 471 states and 751 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:26:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:15,588 INFO L93 Difference]: Finished difference Result 1187 states and 1901 transitions. [2025-01-09 14:26:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 406 [2025-01-09 14:26:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:15,598 INFO L225 Difference]: With dead ends: 1187 [2025-01-09 14:26:15,600 INFO L226 Difference]: Without dead ends: 829 [2025-01-09 14:26:15,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 14:26:15,602 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 286 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:15,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1303 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-01-09 14:26:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 475. [2025-01-09 14:26:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 279 states have (on average 1.3297491039426523) internal successors, (371), 279 states have internal predecessors, (371), 192 states have call successors, (192), 3 states have call predecessors, (192), 3 states have return successors, (192), 192 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 14:26:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 755 transitions. [2025-01-09 14:26:15,691 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 755 transitions. Word has length 406 [2025-01-09 14:26:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:15,692 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 755 transitions. [2025-01-09 14:26:15,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-01-09 14:26:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 755 transitions. [2025-01-09 14:26:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-01-09 14:26:15,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:15,697 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:26:15,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:26:15,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:15,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1370436025, now seen corresponding path program 1 times [2025-01-09 14:26:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:15,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161764242] [2025-01-09 14:26:15,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:15,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:16,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:16,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:16,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 60 proven. 129 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-01-09 14:26:16,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161764242] [2025-01-09 14:26:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161764242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756783921] [2025-01-09 14:26:16,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:16,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:16,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:16,362 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 14:26:16,365 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 14:26:16,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:16,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:16,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:16,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:16,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:26:16,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 3339 proven. 135 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2025-01-09 14:26:17,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 54 proven. 135 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-01-09 14:26:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756783921] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:18,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:18,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-01-09 14:26:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534414732] [2025-01-09 14:26:18,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:26:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:18,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:26:18,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:26:18,674 INFO L87 Difference]: Start difference. First operand 475 states and 755 transitions. Second operand has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 5 states have call successors, (173), 3 states have call predecessors, (173), 6 states have return successors, (174), 5 states have call predecessors, (174), 5 states have call successors, (174) [2025-01-09 14:26:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:21,851 INFO L93 Difference]: Finished difference Result 1616 states and 2510 transitions. [2025-01-09 14:26:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 14:26:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 5 states have call successors, (173), 3 states have call predecessors, (173), 6 states have return successors, (174), 5 states have call predecessors, (174), 5 states have call successors, (174) Word has length 406 [2025-01-09 14:26:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:21,862 INFO L225 Difference]: With dead ends: 1616 [2025-01-09 14:26:21,863 INFO L226 Difference]: Without dead ends: 1254 [2025-01-09 14:26:21,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2014 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1099, Invalid=4303, Unknown=0, NotChecked=0, Total=5402 [2025-01-09 14:26:21,870 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 2902 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 2084 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2921 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2084 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:21,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2921 Valid, 1751 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2084 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:26:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-01-09 14:26:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 841. [2025-01-09 14:26:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 555 states have (on average 1.381981981981982) internal successors, (767), 557 states have internal predecessors, (767), 273 states have call successors, (273), 12 states have call predecessors, (273), 12 states have return successors, (273), 271 states have call predecessors, (273), 273 states have call successors, (273) [2025-01-09 14:26:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1313 transitions. [2025-01-09 14:26:21,976 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1313 transitions. Word has length 406 [2025-01-09 14:26:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:21,977 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1313 transitions. [2025-01-09 14:26:21,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 5 states have call successors, (173), 3 states have call predecessors, (173), 6 states have return successors, (174), 5 states have call predecessors, (174), 5 states have call successors, (174) [2025-01-09 14:26:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1313 transitions. [2025-01-09 14:26:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-01-09 14:26:21,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:21,985 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:26:22,003 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 14:26:22,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:22,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:22,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1107499257, now seen corresponding path program 1 times [2025-01-09 14:26:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983325954] [2025-01-09 14:26:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:22,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:22,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:22,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:22,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:26:22,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936023283] [2025-01-09 14:26:22,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:22,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:22,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:22,676 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 14:26:22,680 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 14:26:22,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:22,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:22,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:22,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:22,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:26:22,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 5269 proven. 180 refuted. 0 times theorem prover too weak. 2615 trivial. 0 not checked. [2025-01-09 14:26:23,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:24,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983325954] [2025-01-09 14:26:24,633 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:26:24,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936023283] [2025-01-09 14:26:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936023283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:24,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:26:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-01-09 14:26:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696350253] [2025-01-09 14:26:24,634 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:24,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:26:24,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:24,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:26:24,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:26:24,635 INFO L87 Difference]: Start difference. First operand 841 states and 1313 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 10 states have internal predecessors, (101), 3 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 3 states have call predecessors, (64), 3 states have call successors, (64) [2025-01-09 14:26:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:25,331 INFO L93 Difference]: Finished difference Result 1708 states and 2663 transitions. [2025-01-09 14:26:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:26:25,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 10 states have internal predecessors, (101), 3 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 3 states have call predecessors, (64), 3 states have call successors, (64) Word has length 406 [2025-01-09 14:26:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:25,339 INFO L225 Difference]: With dead ends: 1708 [2025-01-09 14:26:25,339 INFO L226 Difference]: Without dead ends: 988 [2025-01-09 14:26:25,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:26:25,342 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 218 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:25,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1448 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:26:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-01-09 14:26:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 850. [2025-01-09 14:26:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 562 states have (on average 1.3772241992882561) internal successors, (774), 564 states have internal predecessors, (774), 273 states have call successors, (273), 14 states have call predecessors, (273), 14 states have return successors, (273), 271 states have call predecessors, (273), 273 states have call successors, (273) [2025-01-09 14:26:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1320 transitions. [2025-01-09 14:26:25,401 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1320 transitions. Word has length 406 [2025-01-09 14:26:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:25,401 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1320 transitions. [2025-01-09 14:26:25,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 10 states have internal predecessors, (101), 3 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 3 states have call predecessors, (64), 3 states have call successors, (64) [2025-01-09 14:26:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1320 transitions. [2025-01-09 14:26:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-01-09 14:26:25,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:25,406 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:26:25,414 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 14:26:25,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:25,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:25,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:25,608 INFO L85 PathProgramCache]: Analyzing trace with hash -683852535, now seen corresponding path program 1 times [2025-01-09 14:26:25,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:25,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967369042] [2025-01-09 14:26:25,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:25,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 14:26:25,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 14:26:25,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:25,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:26:25,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134875547] [2025-01-09 14:26:25,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:25,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:25,966 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 14:26:25,968 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 14:26:26,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes.