./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-80.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-80.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 3afd69b93f97a26a35dc01482a1f1a3fd2a20e17dd6f40d85ef6c5a9b20259e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:28:49,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:28:49,104 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:28:49,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:28:49,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:28:49,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:28:49,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:28:49,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:28:49,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:28:49,131 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:28:49,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:28:49,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:28:49,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:28:49,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:28:49,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:28:49,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:28:49,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:28:49,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:28:49,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:28:49,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:28:49,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:28:49,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:28:49,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:28:49,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:49,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:28:49,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:49,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:28:49,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:28:49,135 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 -> 3afd69b93f97a26a35dc01482a1f1a3fd2a20e17dd6f40d85ef6c5a9b20259e7 [2025-01-09 14:28:49,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:28:49,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:28:49,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:28:49,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:28:49,372 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:28:49,373 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-80.i [2025-01-09 14:28:50,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13436a3c5/ce72945ebe1c49f88d873d49dd8c55a5/FLAGa69fbfd7f [2025-01-09 14:28:50,868 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:28:50,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-80.i [2025-01-09 14:28:50,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13436a3c5/ce72945ebe1c49f88d873d49dd8c55a5/FLAGa69fbfd7f [2025-01-09 14:28:51,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13436a3c5/ce72945ebe1c49f88d873d49dd8c55a5 [2025-01-09 14:28:51,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:28:51,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:28:51,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:28:51,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:28:51,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:28:51,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6c4c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51, skipping insertion in model container [2025-01-09 14:28:51,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:28:51,275 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-80.i[916,929] [2025-01-09 14:28:51,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:28:51,375 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:28:51,385 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-80.i[916,929] [2025-01-09 14:28:51,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:28:51,473 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:28:51,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51 WrapperNode [2025-01-09 14:28:51,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:28:51,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:28:51,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:28:51,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:28:51,481 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:28:51" (1/1) ... [2025-01-09 14:28:51,496 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:28:51" (1/1) ... [2025-01-09 14:28:51,529 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 388 [2025-01-09 14:28:51,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:28:51,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:28:51,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:28:51,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:28:51,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,556 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:28:51,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:28:51,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:28:51,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:28:51,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:28:51,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (1/1) ... [2025-01-09 14:28:51,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:51,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:51,627 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:28:51,634 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:28:51,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:28:51,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:28:51,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:28:51,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:28:51,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:28:51,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:28:51,733 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:28:51,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:28:52,472 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 14:28:52,473 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:28:52,490 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:28:52,490 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:28:52,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:28:52 BoogieIcfgContainer [2025-01-09 14:28:52,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:28:52,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:28:52,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:28:52,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:28:52,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:28:51" (1/3) ... [2025-01-09 14:28:52,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcfc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:28:52, skipping insertion in model container [2025-01-09 14:28:52,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:51" (2/3) ... [2025-01-09 14:28:52,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcfc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:28:52, skipping insertion in model container [2025-01-09 14:28:52,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:28:52" (3/3) ... [2025-01-09 14:28:52,502 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-80.i [2025-01-09 14:28:52,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:28:52,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-80.i that has 2 procedures, 167 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:28:52,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:28:52,596 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;@1dd0a162, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:28:52,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:28:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 116 states have internal predecessors, (170), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 14:28:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-01-09 14:28:52,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:52,622 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:52,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:52,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1132208589, now seen corresponding path program 1 times [2025-01-09 14:28:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:52,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754725306] [2025-01-09 14:28:52,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:52,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:52,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-01-09 14:28:52,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-01-09 14:28:52,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:52,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-01-09 14:28:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754725306] [2025-01-09 14:28:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754725306] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679389563] [2025-01-09 14:28:53,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:53,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:53,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:53,059 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:28:53,060 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:28:53,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-01-09 14:28:53,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-01-09 14:28:53,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:53,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:53,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:28:53,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-01-09 14:28:53,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:28:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679389563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:53,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:28:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:28:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691501322] [2025-01-09 14:28:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:53,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:28:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:53,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:28:53,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:28:53,355 INFO L87 Difference]: Start difference. First operand has 167 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 116 states have internal predecessors, (170), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 14:28:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:53,383 INFO L93 Difference]: Finished difference Result 328 states and 580 transitions. [2025-01-09 14:28:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:28:53,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) Word has length 316 [2025-01-09 14:28:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:53,392 INFO L225 Difference]: With dead ends: 328 [2025-01-09 14:28:53,393 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 14:28:53,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 317 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:28:53,397 INFO L435 NwaCegarLoop]: 262 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, 262 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:28:53,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:28:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 14:28:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-01-09 14:28:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 113 states have internal predecessors, (164), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 14:28:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 262 transitions. [2025-01-09 14:28:53,442 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 262 transitions. Word has length 316 [2025-01-09 14:28:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:53,443 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 262 transitions. [2025-01-09 14:28:53,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-01-09 14:28:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 262 transitions. [2025-01-09 14:28:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-01-09 14:28:53,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:53,447 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:53,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:28:53,648 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:28:53,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:53,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -214855363, now seen corresponding path program 1 times [2025-01-09 14:28:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661993663] [2025-01-09 14:28:53,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:53,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-01-09 14:28:53,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-01-09 14:28:53,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:53,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 14:28:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:53,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661993663] [2025-01-09 14:28:53,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661993663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:53,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:53,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:53,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272932684] [2025-01-09 14:28:53,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:53,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:53,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:53,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:54,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:54,001 INFO L87 Difference]: Start difference. First operand 164 states and 262 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:54,080 INFO L93 Difference]: Finished difference Result 391 states and 623 transitions. [2025-01-09 14:28:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:54,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 316 [2025-01-09 14:28:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:54,085 INFO L225 Difference]: With dead ends: 391 [2025-01-09 14:28:54,085 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 14:28:54,087 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 14:28:54,088 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 81 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:54,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 507 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:28:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 14:28:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2025-01-09 14:28:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 173 states have (on average 1.4855491329479769) internal successors, (257), 174 states have internal predecessors, (257), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 14:28:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 359 transitions. [2025-01-09 14:28:54,115 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 359 transitions. Word has length 316 [2025-01-09 14:28:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:54,116 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 359 transitions. [2025-01-09 14:28:54,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 359 transitions. [2025-01-09 14:28:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-09 14:28:54,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:54,121 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:54,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:28:54,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:54,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1539372576, now seen corresponding path program 1 times [2025-01-09 14:28:54,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:54,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459422694] [2025-01-09 14:28:54,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:54,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-09 14:28:54,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-09 14:28:54,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:54,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 14:28:54,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:54,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459422694] [2025-01-09 14:28:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459422694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:54,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:54,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:28:54,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459150974] [2025-01-09 14:28:54,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:54,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:28:54,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:54,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:28:54,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:28:54,530 INFO L87 Difference]: Start difference. First operand 227 states and 359 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:54,784 INFO L93 Difference]: Finished difference Result 742 states and 1171 transitions. [2025-01-09 14:28:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:28:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 317 [2025-01-09 14:28:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:54,791 INFO L225 Difference]: With dead ends: 742 [2025-01-09 14:28:54,791 INFO L226 Difference]: Without dead ends: 518 [2025-01-09 14:28:54,792 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 14:28:54,793 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 344 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:54,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 761 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:28:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-01-09 14:28:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 447. [2025-01-09 14:28:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 340 states have (on average 1.4852941176470589) internal successors, (505), 342 states have internal predecessors, (505), 102 states have call successors, (102), 4 states have call predecessors, (102), 4 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 14:28:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 709 transitions. [2025-01-09 14:28:54,868 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 709 transitions. Word has length 317 [2025-01-09 14:28:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:54,870 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 709 transitions. [2025-01-09 14:28:54,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 709 transitions. [2025-01-09 14:28:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-09 14:28:54,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:54,875 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:54,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:28:54,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 269980106, now seen corresponding path program 1 times [2025-01-09 14:28:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:54,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961608450] [2025-01-09 14:28:54,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:54,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 14:28:54,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 14:28:54,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:54,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 14:28:55,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:55,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961608450] [2025-01-09 14:28:55,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961608450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:55,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:28:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445220144] [2025-01-09 14:28:55,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:55,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:28:55,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:55,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:28:55,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:28:55,327 INFO L87 Difference]: Start difference. First operand 447 states and 709 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:55,589 INFO L93 Difference]: Finished difference Result 1493 states and 2368 transitions. [2025-01-09 14:28:55,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:28:55,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 318 [2025-01-09 14:28:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:55,597 INFO L225 Difference]: With dead ends: 1493 [2025-01-09 14:28:55,597 INFO L226 Difference]: Without dead ends: 1049 [2025-01-09 14:28:55,600 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:28:55,600 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 348 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:55,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 757 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:28:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-01-09 14:28:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 889. [2025-01-09 14:28:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 676 states have (on average 1.4733727810650887) internal successors, (996), 680 states have internal predecessors, (996), 204 states have call successors, (204), 8 states have call predecessors, (204), 8 states have return successors, (204), 200 states have call predecessors, (204), 204 states have call successors, (204) [2025-01-09 14:28:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1404 transitions. [2025-01-09 14:28:55,711 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1404 transitions. Word has length 318 [2025-01-09 14:28:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:55,711 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1404 transitions. [2025-01-09 14:28:55,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1404 transitions. [2025-01-09 14:28:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 14:28:55,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:55,715 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:55,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:28:55,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:55,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:55,716 INFO L85 PathProgramCache]: Analyzing trace with hash 183146680, now seen corresponding path program 1 times [2025-01-09 14:28:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020316081] [2025-01-09 14:28:55,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:55,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:28:55,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:28:55,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:55,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 14:28:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020316081] [2025-01-09 14:28:56,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020316081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:56,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:28:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693291303] [2025-01-09 14:28:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:56,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:28:56,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:56,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:28:56,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:28:56,263 INFO L87 Difference]: Start difference. First operand 889 states and 1404 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:56,376 INFO L93 Difference]: Finished difference Result 2305 states and 3626 transitions. [2025-01-09 14:28:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:28:56,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 319 [2025-01-09 14:28:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:56,389 INFO L225 Difference]: With dead ends: 2305 [2025-01-09 14:28:56,389 INFO L226 Difference]: Without dead ends: 1419 [2025-01-09 14:28:56,391 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:28:56,392 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 99 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:56,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 822 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:28:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2025-01-09 14:28:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1413. [2025-01-09 14:28:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1168 states have (on average 1.5) internal successors, (1752), 1180 states have internal predecessors, (1752), 228 states have call successors, (228), 16 states have call predecessors, (228), 16 states have return successors, (228), 216 states have call predecessors, (228), 228 states have call successors, (228) [2025-01-09 14:28:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2208 transitions. [2025-01-09 14:28:56,495 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2208 transitions. Word has length 319 [2025-01-09 14:28:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:56,496 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2208 transitions. [2025-01-09 14:28:56,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2208 transitions. [2025-01-09 14:28:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 14:28:56,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:56,503 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:28:56,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:56,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1740081354, now seen corresponding path program 1 times [2025-01-09 14:28:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:56,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455028164] [2025-01-09 14:28:56,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:56,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:28:56,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:28:56,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:56,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 14:28:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455028164] [2025-01-09 14:28:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455028164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:57,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:28:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679056173] [2025-01-09 14:28:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:28:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:57,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:28:57,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:28:57,143 INFO L87 Difference]: Start difference. First operand 1413 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:57,380 INFO L93 Difference]: Finished difference Result 3089 states and 4766 transitions. [2025-01-09 14:28:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:28:57,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 319 [2025-01-09 14:28:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:57,392 INFO L225 Difference]: With dead ends: 3089 [2025-01-09 14:28:57,393 INFO L226 Difference]: Without dead ends: 1679 [2025-01-09 14:28:57,397 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:28:57,398 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 212 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:57,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 757 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:28:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-01-09 14:28:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1413. [2025-01-09 14:28:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1168 states have (on average 1.4931506849315068) internal successors, (1744), 1180 states have internal predecessors, (1744), 228 states have call successors, (228), 16 states have call predecessors, (228), 16 states have return successors, (228), 216 states have call predecessors, (228), 228 states have call successors, (228) [2025-01-09 14:28:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2200 transitions. [2025-01-09 14:28:57,518 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2200 transitions. Word has length 319 [2025-01-09 14:28:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:57,519 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2200 transitions. [2025-01-09 14:28:57,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:28:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2200 transitions. [2025-01-09 14:28:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 14:28:57,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:57,524 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:57,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:28:57,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1874094860, now seen corresponding path program 1 times [2025-01-09 14:28:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835111194] [2025-01-09 14:28:57,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:28:58,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:28:58,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:58,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 6 proven. 138 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-01-09 14:28:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835111194] [2025-01-09 14:28:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835111194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574548989] [2025-01-09 14:28:58,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:58,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:58,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:58,284 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:28:58,285 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:28:58,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:28:58,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:28:58,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:58,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:58,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:28:58,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 1588 proven. 114 refuted. 0 times theorem prover too weak. 3002 trivial. 0 not checked. [2025-01-09 14:28:58,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:28:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 30 proven. 114 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-01-09 14:28:59,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574548989] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:28:59,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:28:59,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-01-09 14:28:59,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236191204] [2025-01-09 14:28:59,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:28:59,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:28:59,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:59,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:28:59,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:28:59,175 INFO L87 Difference]: Start difference. First operand 1413 states and 2200 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 3 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 3 states have call predecessors, (135), 3 states have call successors, (135) [2025-01-09 14:28:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:59,777 INFO L93 Difference]: Finished difference Result 2380 states and 3683 transitions. [2025-01-09 14:28:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:28:59,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 3 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 3 states have call predecessors, (135), 3 states have call successors, (135) Word has length 319 [2025-01-09 14:28:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:59,783 INFO L225 Difference]: With dead ends: 2380 [2025-01-09 14:28:59,783 INFO L226 Difference]: Without dead ends: 970 [2025-01-09 14:28:59,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 633 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:28:59,786 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 248 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:59,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 719 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:28:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-01-09 14:28:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 962. [2025-01-09 14:28:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 726 states have (on average 1.396694214876033) internal successors, (1014), 731 states have internal predecessors, (1014), 214 states have call successors, (214), 21 states have call predecessors, (214), 21 states have return successors, (214), 209 states have call predecessors, (214), 214 states have call successors, (214) [2025-01-09 14:28:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1442 transitions. [2025-01-09 14:28:59,846 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1442 transitions. Word has length 319 [2025-01-09 14:28:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:59,846 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1442 transitions. [2025-01-09 14:28:59,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 3 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 3 states have call predecessors, (135), 3 states have call successors, (135) [2025-01-09 14:28:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1442 transitions. [2025-01-09 14:28:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 14:28:59,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:59,850 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,858 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:29:00,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:00,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:00,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1738259232, now seen corresponding path program 1 times [2025-01-09 14:29:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:00,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866266133] [2025-01-09 14:29:00,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:00,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:29:00,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:29:00,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:00,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-01-09 14:29:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866266133] [2025-01-09 14:29:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866266133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:00,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:00,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:29:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836717066] [2025-01-09 14:29:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:00,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:29:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:00,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:29:00,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:00,974 INFO L87 Difference]: Start difference. First operand 962 states and 1442 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:29:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:01,141 INFO L93 Difference]: Finished difference Result 2128 states and 3186 transitions. [2025-01-09 14:29:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:29:01,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 319 [2025-01-09 14:29:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:01,153 INFO L225 Difference]: With dead ends: 2128 [2025-01-09 14:29:01,153 INFO L226 Difference]: Without dead ends: 1178 [2025-01-09 14:29:01,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:01,159 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 79 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:01,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 694 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-01-09 14:29:01,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1163. [2025-01-09 14:29:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 918 states have (on average 1.4139433551198257) internal successors, (1298), 926 states have internal predecessors, (1298), 220 states have call successors, (220), 24 states have call predecessors, (220), 24 states have return successors, (220), 212 states have call predecessors, (220), 220 states have call successors, (220) [2025-01-09 14:29:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1738 transitions. [2025-01-09 14:29:01,272 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1738 transitions. Word has length 319 [2025-01-09 14:29:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:01,273 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1738 transitions. [2025-01-09 14:29:01,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-01-09 14:29:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1738 transitions. [2025-01-09 14:29:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 14:29:01,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:01,281 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:01,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:29:01,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:01,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash -67179102, now seen corresponding path program 1 times [2025-01-09 14:29:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:01,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820705684] [2025-01-09 14:29:01,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:01,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:29:01,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:29:01,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:01,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 117 proven. 27 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-01-09 14:29:01,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:01,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820705684] [2025-01-09 14:29:01,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820705684] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:01,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730596672] [2025-01-09 14:29:01,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:01,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:01,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:01,865 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:29:01,867 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:29:01,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 14:29:02,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 14:29:02,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:02,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:02,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:29:02,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 806 proven. 258 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2025-01-09 14:29:02,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-01-09 14:29:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730596672] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:29:02,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:29:02,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 16 [2025-01-09 14:29:02,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978850741] [2025-01-09 14:29:02,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:02,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:29:02,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:02,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:29:02,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:29:02,787 INFO L87 Difference]: Start difference. First operand 1163 states and 1738 transitions. Second operand has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 4 states have call successors, (137), 3 states have call predecessors, (137), 5 states have return successors, (139), 4 states have call predecessors, (139), 4 states have call successors, (139) [2025-01-09 14:29:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:03,890 INFO L93 Difference]: Finished difference Result 1993 states and 2934 transitions. [2025-01-09 14:29:03,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 14:29:03,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 4 states have call successors, (137), 3 states have call predecessors, (137), 5 states have return successors, (139), 4 states have call predecessors, (139), 4 states have call successors, (139) Word has length 319 [2025-01-09 14:29:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:03,897 INFO L225 Difference]: With dead ends: 1993 [2025-01-09 14:29:03,897 INFO L226 Difference]: Without dead ends: 833 [2025-01-09 14:29:03,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 630 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=1130, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 14:29:03,901 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 518 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:03,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1404 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:29:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-09 14:29:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 816. [2025-01-09 14:29:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 546 states have (on average 1.2747252747252746) internal successors, (696), 547 states have internal predecessors, (696), 235 states have call successors, (235), 34 states have call predecessors, (235), 34 states have return successors, (235), 234 states have call predecessors, (235), 235 states have call successors, (235) [2025-01-09 14:29:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1166 transitions. [2025-01-09 14:29:03,950 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1166 transitions. Word has length 319 [2025-01-09 14:29:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:03,950 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1166 transitions. [2025-01-09 14:29:03,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.6875) internal successors, (187), 16 states have internal predecessors, (187), 4 states have call successors, (137), 3 states have call predecessors, (137), 5 states have return successors, (139), 4 states have call predecessors, (139), 4 states have call successors, (139) [2025-01-09 14:29:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1166 transitions. [2025-01-09 14:29:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 14:29:03,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:03,954 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:03,961 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:29:04,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:04,155 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:04,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:04,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1410359080, now seen corresponding path program 1 times [2025-01-09 14:29:04,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:04,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993020391] [2025-01-09 14:29:04,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:04,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:04,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:29:04,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:29:04,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:04,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 315 proven. 225 refuted. 0 times theorem prover too weak. 4164 trivial. 0 not checked. [2025-01-09 14:29:22,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:22,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993020391] [2025-01-09 14:29:22,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993020391] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:22,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002198851] [2025-01-09 14:29:22,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:22,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:22,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:22,176 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:29:22,178 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:29:22,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 14:29:22,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 14:29:22,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:22,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:22,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:29:22,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 1938 proven. 39 refuted. 0 times theorem prover too weak. 2727 trivial. 0 not checked. [2025-01-09 14:29:23,258 INFO L312 TraceCheckSpWp]: Computing backward predicates...