./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-16.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-16.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 8e52341f27f00c0c2ceedafaab379711ebb86ba8e7b8a717254138078fb8d030 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:20:17,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:20:17,425 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:20:17,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:20:17,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:20:17,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:20:17,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:20:17,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:20:17,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:20:17,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:20:17,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:20:17,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:20:17,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:20:17,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:20:17,446 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:20:17,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:20:17,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:20:17,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:20:17,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:20:17,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:20:17,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:20:17,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:20:17,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:20:17,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:20:17,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:20:17,449 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 -> 8e52341f27f00c0c2ceedafaab379711ebb86ba8e7b8a717254138078fb8d030 [2025-01-09 14:20:17,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:20:17,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:20:17,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:20:17,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:20:17,675 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:20:17,676 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-16.i [2025-01-09 14:20:18,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8574decf4/3c10accf99de43c9ab3a3c6e748d1c5f/FLAGc6778e810 [2025-01-09 14:20:19,159 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:20:19,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-16.i [2025-01-09 14:20:19,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8574decf4/3c10accf99de43c9ab3a3c6e748d1c5f/FLAGc6778e810 [2025-01-09 14:20:19,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8574decf4/3c10accf99de43c9ab3a3c6e748d1c5f [2025-01-09 14:20:19,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:20:19,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:20:19,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:20:19,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:20:19,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:20:19,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dd29d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19, skipping insertion in model container [2025-01-09 14:20:19,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:20:19,532 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-16.i[916,929] [2025-01-09 14:20:19,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:20:19,662 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:20:19,673 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-16.i[916,929] [2025-01-09 14:20:19,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:20:19,759 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:20:19,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19 WrapperNode [2025-01-09 14:20:19,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:20:19,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:20:19,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:20:19,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:20:19,764 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:20:19" (1/1) ... [2025-01-09 14:20:19,773 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:20:19" (1/1) ... [2025-01-09 14:20:19,814 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2025-01-09 14:20:19,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:20:19,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:20:19,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:20:19,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:20:19,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,856 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:20:19,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:20:19,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:20:19,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:20:19,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:20:19,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (1/1) ... [2025-01-09 14:20:19,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:20:19,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:19,939 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:20:19,941 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:20:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:20:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:20:19,960 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:20:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:20:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:20:19,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:20:20,043 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:20:20,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:20:20,667 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-01-09 14:20:20,667 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:20:20,677 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:20:20,680 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:20:20,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:20:20 BoogieIcfgContainer [2025-01-09 14:20:20,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:20:20,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:20:20,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:20:20,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:20:20,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:20:19" (1/3) ... [2025-01-09 14:20:20,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573cee6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:20:20, skipping insertion in model container [2025-01-09 14:20:20,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:20:19" (2/3) ... [2025-01-09 14:20:20,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573cee6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:20:20, skipping insertion in model container [2025-01-09 14:20:20,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:20:20" (3/3) ... [2025-01-09 14:20:20,688 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-16.i [2025-01-09 14:20:20,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:20:20,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-16.i that has 2 procedures, 168 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:20:20,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:20:20,756 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;@5fbcc145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:20:20,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:20:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 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:20:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-01-09 14:20:20,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:20,776 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, 1] [2025-01-09 14:20:20,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:20,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash -596595730, now seen corresponding path program 1 times [2025-01-09 14:20:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490916223] [2025-01-09 14:20:20,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:20,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 14:20:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 14:20:20,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:20,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:21,242 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:20:21,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:21,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490916223] [2025-01-09 14:20:21,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490916223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:21,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218550154] [2025-01-09 14:20:21,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:21,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:21,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:21,246 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:20:21,248 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:20:21,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 14:20:21,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 14:20:21,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:21,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:21,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:20:21,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:21,527 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:20:21,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:20:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218550154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:20:21,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:20:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028504614] [2025-01-09 14:20:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:20:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:21,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:20:21,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:20:21,546 INFO L87 Difference]: Start difference. First operand has 168 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 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 40.5) internal successors, (81), 2 states have internal predecessors, (81), 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:20:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:21,578 INFO L93 Difference]: Finished difference Result 330 states and 586 transitions. [2025-01-09 14:20:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:20:21,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 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 321 [2025-01-09 14:20:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:21,588 INFO L225 Difference]: With dead ends: 330 [2025-01-09 14:20:21,589 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 14:20:21,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 322 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:20:21,596 INFO L435 NwaCegarLoop]: 265 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, 265 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:20:21,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:20:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 14:20:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-01-09 14:20:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 114 states have (on average 1.4649122807017543) internal successors, (167), 114 states have internal predecessors, (167), 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:20:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 265 transitions. [2025-01-09 14:20:21,646 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 265 transitions. Word has length 321 [2025-01-09 14:20:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:21,646 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 265 transitions. [2025-01-09 14:20:21,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 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:20:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 265 transitions. [2025-01-09 14:20:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-01-09 14:20:21,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:21,650 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, 1] [2025-01-09 14:20:21,658 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:20:21,851 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:20:21,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:21,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash -180626004, now seen corresponding path program 1 times [2025-01-09 14:20:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:21,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741342974] [2025-01-09 14:20:21,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:21,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 14:20:21,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 14:20:21,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:21,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:22,158 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:20:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:22,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741342974] [2025-01-09 14:20:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741342974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:22,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:22,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:20:22,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068833496] [2025-01-09 14:20:22,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:22,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:20:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:22,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:20:22,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:22,162 INFO L87 Difference]: Start difference. First operand 165 states and 265 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:20:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:22,251 INFO L93 Difference]: Finished difference Result 476 states and 766 transitions. [2025-01-09 14:20:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:20:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 321 [2025-01-09 14:20:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:22,256 INFO L225 Difference]: With dead ends: 476 [2025-01-09 14:20:22,258 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 14:20:22,258 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:20:22,259 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 222 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:22,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 707 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:20:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 14:20:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 189. [2025-01-09 14:20:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.5) internal successors, (207), 138 states have internal predecessors, (207), 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:20:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 305 transitions. [2025-01-09 14:20:22,287 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 305 transitions. Word has length 321 [2025-01-09 14:20:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:22,289 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 305 transitions. [2025-01-09 14:20:22,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:20:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 305 transitions. [2025-01-09 14:20:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-01-09 14:20:22,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:22,295 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, 1] [2025-01-09 14:20:22,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:20:22,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:22,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash 520973870, now seen corresponding path program 1 times [2025-01-09 14:20:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:22,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493213971] [2025-01-09 14:20:22,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:22,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 14:20:22,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 14:20:22,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:22,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:22,920 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:20:22,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:22,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493213971] [2025-01-09 14:20:22,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493213971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:22,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:22,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:20:22,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315715479] [2025-01-09 14:20:22,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:22,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:20:22,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:22,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:20:22,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:20:22,924 INFO L87 Difference]: Start difference. First operand 189 states and 305 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:20:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:23,145 INFO L93 Difference]: Finished difference Result 661 states and 1074 transitions. [2025-01-09 14:20:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:20:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 321 [2025-01-09 14:20:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:23,151 INFO L225 Difference]: With dead ends: 661 [2025-01-09 14:20:23,151 INFO L226 Difference]: Without dead ends: 475 [2025-01-09 14:20:23,153 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:20:23,154 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 289 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:23,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 883 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:20:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-01-09 14:20:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 381. [2025-01-09 14:20:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 280 states have (on average 1.5071428571428571) internal successors, (422), 280 states have internal predecessors, (422), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 14:20:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 618 transitions. [2025-01-09 14:20:23,197 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 618 transitions. Word has length 321 [2025-01-09 14:20:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:23,197 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 618 transitions. [2025-01-09 14:20:23,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:20:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 618 transitions. [2025-01-09 14:20:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 14:20:23,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:23,201 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, 1, 1] [2025-01-09 14:20:23,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:20:23,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:23,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash -460589446, now seen corresponding path program 1 times [2025-01-09 14:20:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789504908] [2025-01-09 14:20:23,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:23,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 14:20:23,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 14:20:23,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:23,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:23,651 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:20:23,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:23,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789504908] [2025-01-09 14:20:23,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789504908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:23,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:23,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:20:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580206668] [2025-01-09 14:20:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:23,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:20:23,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:23,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:20:23,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:23,653 INFO L87 Difference]: Start difference. First operand 381 states and 618 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:20:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:23,713 INFO L93 Difference]: Finished difference Result 1137 states and 1848 transitions. [2025-01-09 14:20:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:20:23,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 322 [2025-01-09 14:20:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:23,719 INFO L225 Difference]: With dead ends: 1137 [2025-01-09 14:20:23,719 INFO L226 Difference]: Without dead ends: 759 [2025-01-09 14:20:23,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:20:23,721 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 158 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:23,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 517 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:20:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-01-09 14:20:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2025-01-09 14:20:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 556 states have (on average 1.5035971223021583) internal successors, (836), 556 states have internal predecessors, (836), 196 states have call successors, (196), 4 states have call predecessors, (196), 4 states have return successors, (196), 196 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 14:20:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1228 transitions. [2025-01-09 14:20:23,856 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1228 transitions. Word has length 322 [2025-01-09 14:20:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:23,857 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1228 transitions. [2025-01-09 14:20:23,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:20:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1228 transitions. [2025-01-09 14:20:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 14:20:23,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:23,861 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, 1, 1] [2025-01-09 14:20:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:20:23,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -37887620, now seen corresponding path program 1 times [2025-01-09 14:20:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69421441] [2025-01-09 14:20:23,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:23,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:23,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 14:20:24,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 14:20:24,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:24,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:24,560 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:20:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69421441] [2025-01-09 14:20:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69421441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:24,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:20:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503639716] [2025-01-09 14:20:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:24,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:20:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:24,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:20:24,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:20:24,561 INFO L87 Difference]: Start difference. First operand 757 states and 1228 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:20:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:24,879 INFO L93 Difference]: Finished difference Result 2639 states and 4285 transitions. [2025-01-09 14:20:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:20:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 322 [2025-01-09 14:20:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:24,890 INFO L225 Difference]: With dead ends: 2639 [2025-01-09 14:20:24,890 INFO L226 Difference]: Without dead ends: 1885 [2025-01-09 14:20:24,893 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:20:24,893 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 290 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:24,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 867 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:20:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2025-01-09 14:20:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1509. [2025-01-09 14:20:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1108 states have (on average 1.4945848375451263) internal successors, (1656), 1108 states have internal predecessors, (1656), 392 states have call successors, (392), 8 states have call predecessors, (392), 8 states have return successors, (392), 392 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 14:20:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2440 transitions. [2025-01-09 14:20:25,076 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2440 transitions. Word has length 322 [2025-01-09 14:20:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:25,077 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2440 transitions. [2025-01-09 14:20:25,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:20:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2440 transitions. [2025-01-09 14:20:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 14:20:25,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:25,086 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, 1, 1, 1] [2025-01-09 14:20:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:20:25,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 489452554, now seen corresponding path program 1 times [2025-01-09 14:20:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188307400] [2025-01-09 14:20:25,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:25,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 14:20:25,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 14:20:25,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:25,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:26,060 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:20:26,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188307400] [2025-01-09 14:20:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188307400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:20:26,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:20:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:20:26,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771636485] [2025-01-09 14:20:26,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:20:26,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:20:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:26,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:20:26,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:20:26,061 INFO L87 Difference]: Start difference. First operand 1509 states and 2440 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:20:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:26,591 INFO L93 Difference]: Finished difference Result 3768 states and 6095 transitions. [2025-01-09 14:20:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:20:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 323 [2025-01-09 14:20:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:26,601 INFO L225 Difference]: With dead ends: 3768 [2025-01-09 14:20:26,602 INFO L226 Difference]: Without dead ends: 2262 [2025-01-09 14:20:26,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:20:26,605 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 184 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:26,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 852 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:20:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2025-01-09 14:20:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2204. [2025-01-09 14:20:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 1753 states have (on average 1.5390758699372504) internal successors, (2698), 1753 states have internal predecessors, (2698), 441 states have call successors, (441), 9 states have call predecessors, (441), 9 states have return successors, (441), 441 states have call predecessors, (441), 441 states have call successors, (441) [2025-01-09 14:20:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 3580 transitions. [2025-01-09 14:20:26,746 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 3580 transitions. Word has length 323 [2025-01-09 14:20:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:26,747 INFO L471 AbstractCegarLoop]: Abstraction has 2204 states and 3580 transitions. [2025-01-09 14:20:26,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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:20:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 3580 transitions. [2025-01-09 14:20:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 14:20:26,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:26,751 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, 1, 1, 1] [2025-01-09 14:20:26,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:20:26,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:26,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash 95085768, now seen corresponding path program 1 times [2025-01-09 14:20:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:26,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362486903] [2025-01-09 14:20:26,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:26,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 14:20:27,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 14:20:27,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:27,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 18 proven. 126 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-01-09 14:20:27,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:27,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362486903] [2025-01-09 14:20:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362486903] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:27,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810873980] [2025-01-09 14:20:27,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:27,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:27,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:27,839 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:20:27,840 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:20:28,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 14:20:28,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 14:20:28,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:28,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:28,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:20:28,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 1068 proven. 126 refuted. 0 times theorem prover too weak. 3510 trivial. 0 not checked. [2025-01-09 14:20:29,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 18 proven. 126 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-01-09 14:20:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810873980] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:20:29,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:20:29,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2025-01-09 14:20:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386769814] [2025-01-09 14:20:29,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:20:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:29,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:20:29,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:20:29,543 INFO L87 Difference]: Start difference. First operand 2204 states and 3580 transitions. Second operand has 17 states, 17 states have (on average 9.588235294117647) internal successors, (163), 17 states have internal predecessors, (163), 6 states have call successors, (147), 3 states have call predecessors, (147), 6 states have return successors, (147), 6 states have call predecessors, (147), 6 states have call successors, (147) [2025-01-09 14:20:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:20:30,800 INFO L93 Difference]: Finished difference Result 6957 states and 11224 transitions. [2025-01-09 14:20:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:20:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.588235294117647) internal successors, (163), 17 states have internal predecessors, (163), 6 states have call successors, (147), 3 states have call predecessors, (147), 6 states have return successors, (147), 6 states have call predecessors, (147), 6 states have call successors, (147) Word has length 323 [2025-01-09 14:20:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:20:30,824 INFO L225 Difference]: With dead ends: 6957 [2025-01-09 14:20:30,824 INFO L226 Difference]: Without dead ends: 5147 [2025-01-09 14:20:30,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:20:30,829 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 628 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:20:30,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1550 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:20:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2025-01-09 14:20:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 3945. [2025-01-09 14:20:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3945 states, 3029 states have (on average 1.4942225156817432) internal successors, (4526), 3037 states have internal predecessors, (4526), 881 states have call successors, (881), 34 states have call predecessors, (881), 34 states have return successors, (881), 873 states have call predecessors, (881), 881 states have call successors, (881) [2025-01-09 14:20:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3945 states to 3945 states and 6288 transitions. [2025-01-09 14:20:31,055 INFO L78 Accepts]: Start accepts. Automaton has 3945 states and 6288 transitions. Word has length 323 [2025-01-09 14:20:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:20:31,056 INFO L471 AbstractCegarLoop]: Abstraction has 3945 states and 6288 transitions. [2025-01-09 14:20:31,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.588235294117647) internal successors, (163), 17 states have internal predecessors, (163), 6 states have call successors, (147), 3 states have call predecessors, (147), 6 states have return successors, (147), 6 states have call predecessors, (147), 6 states have call successors, (147) [2025-01-09 14:20:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3945 states and 6288 transitions. [2025-01-09 14:20:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 14:20:31,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:20:31,062 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, 1, 1, 1] [2025-01-09 14:20:31,071 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:20:31,262 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:20:31,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:20:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:20:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1954302074, now seen corresponding path program 1 times [2025-01-09 14:20:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:20:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663403569] [2025-01-09 14:20:31,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:20:31,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 14:20:32,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 14:20:32,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:32,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 168 proven. 246 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2025-01-09 14:20:39,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:20:39,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663403569] [2025-01-09 14:20:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663403569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:39,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198771668] [2025-01-09 14:20:39,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:20:39,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:20:39,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:20:39,636 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:20:39,638 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:20:39,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 14:20:39,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 14:20:39,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:20:39,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:20:39,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 14:20:39,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:20:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 3302 proven. 384 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-01-09 14:20:43,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:20:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198771668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:20:46,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:20:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 46 [2025-01-09 14:20:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127616587] [2025-01-09 14:20:46,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:20:46,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 14:20:46,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:20:46,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 14:20:46,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=3284, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 14:20:46,654 INFO L87 Difference]: Start difference. First operand 3945 states and 6288 transitions. Second operand has 46 states, 45 states have (on average 3.8444444444444446) internal successors, (173), 42 states have internal predecessors, (173), 14 states have call successors, (98), 8 states have call predecessors, (98), 13 states have return successors, (98), 13 states have call predecessors, (98), 14 states have call successors, (98) [2025-01-09 14:21:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:06,246 INFO L93 Difference]: Finished difference Result 19079 states and 29746 transitions. [2025-01-09 14:21:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-01-09 14:21:06,250 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.8444444444444446) internal successors, (173), 42 states have internal predecessors, (173), 14 states have call successors, (98), 8 states have call predecessors, (98), 13 states have return successors, (98), 13 states have call predecessors, (98), 14 states have call successors, (98) Word has length 323 [2025-01-09 14:21:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:06,330 INFO L225 Difference]: With dead ends: 19079 [2025-01-09 14:21:06,331 INFO L226 Difference]: Without dead ends: 15253 [2025-01-09 14:21:06,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5027 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=3065, Invalid=16117, Unknown=0, NotChecked=0, Total=19182 [2025-01-09 14:21:06,343 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 5442 mSDsluCounter, 5753 mSDsCounter, 0 mSdLazyCounter, 9029 mSolverCounterSat, 1385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5469 SdHoareTripleChecker+Valid, 6087 SdHoareTripleChecker+Invalid, 10414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1385 IncrementalHoareTripleChecker+Valid, 9029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:06,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5469 Valid, 6087 Invalid, 10414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1385 Valid, 9029 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-01-09 14:21:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15253 states. [2025-01-09 14:21:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15253 to 11509. [2025-01-09 14:21:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11509 states, 9169 states have (on average 1.483367869996728) internal successors, (13601), 9209 states have internal predecessors, (13601), 2129 states have call successors, (2129), 210 states have call predecessors, (2129), 210 states have return successors, (2129), 2089 states have call predecessors, (2129), 2129 states have call successors, (2129) [2025-01-09 14:21:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11509 states to 11509 states and 17859 transitions. [2025-01-09 14:21:07,357 INFO L78 Accepts]: Start accepts. Automaton has 11509 states and 17859 transitions. Word has length 323 [2025-01-09 14:21:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:07,358 INFO L471 AbstractCegarLoop]: Abstraction has 11509 states and 17859 transitions. [2025-01-09 14:21:07,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.8444444444444446) internal successors, (173), 42 states have internal predecessors, (173), 14 states have call successors, (98), 8 states have call predecessors, (98), 13 states have return successors, (98), 13 states have call predecessors, (98), 14 states have call successors, (98) [2025-01-09 14:21:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11509 states and 17859 transitions. [2025-01-09 14:21:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:21:07,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:07,374 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, 1, 1, 1, 1, 1] [2025-01-09 14:21:07,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:21:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:07,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 117105379, now seen corresponding path program 1 times [2025-01-09 14:21:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917191643] [2025-01-09 14:21:07,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:07,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:21:08,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:21:08,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:08,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat