./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.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_loopvsstraightlinecode_25-while_file-34.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 5d5e6a48faf77affdea7472a901365f0e051dda2e417ea5311d5eeddd5db501f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:28:43,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:28:43,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:28:43,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:28:43,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:28:43,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:28:43,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:28:43,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:28:43,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:28:43,283 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:28:43,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:28:43,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:28:43,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:28:43,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:28:43,284 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:28:43,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:28:43,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:28:43,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:28:43,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:28:43,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:28:43,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:28:43,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:28:43,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:28:43,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:43,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:43,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:28:43,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:28:43,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:28:43,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:28:43,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:28:43,288 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 -> 5d5e6a48faf77affdea7472a901365f0e051dda2e417ea5311d5eeddd5db501f [2025-01-09 13:28:43,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:28:43,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:28:43,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:28:43,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:28:43,554 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:28:43,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2025-01-09 13:28:44,718 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c95496359/34a29c89d555408694ae739d37dd473e/FLAG383211c12 [2025-01-09 13:28:44,929 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:28:44,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2025-01-09 13:28:44,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c95496359/34a29c89d555408694ae739d37dd473e/FLAG383211c12 [2025-01-09 13:28:44,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c95496359/34a29c89d555408694ae739d37dd473e [2025-01-09 13:28:44,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:28:44,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:28:44,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:44,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:28:44,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:28:44,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:44" (1/1) ... [2025-01-09 13:28:44,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d463407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:44, skipping insertion in model container [2025-01-09 13:28:44,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:44" (1/1) ... [2025-01-09 13:28:44,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:28:45,068 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_loopvsstraightlinecode_25-while_file-34.i[915,928] [2025-01-09 13:28:45,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:45,125 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:28:45,133 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_loopvsstraightlinecode_25-while_file-34.i[915,928] [2025-01-09 13:28:45,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:45,166 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:28:45,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45 WrapperNode [2025-01-09 13:28:45,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:45,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:45,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:28:45,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:28:45,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,197 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-01-09 13:28:45,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:45,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:28:45,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:28:45,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:28:45,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,225 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 13:28:45,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:28:45,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:28:45,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:28:45,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:28:45,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (1/1) ... [2025-01-09 13:28:45,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:45,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:45,272 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 13:28:45,275 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 13:28:45,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:28:45,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:28:45,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:28:45,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:28:45,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:28:45,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:28:45,349 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:28:45,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:28:45,483 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 13:28:45,483 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:28:45,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:28:45,492 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:28:45,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:45 BoogieIcfgContainer [2025-01-09 13:28:45,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:28:45,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:28:45,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:28:45,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:28:45,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:28:44" (1/3) ... [2025-01-09 13:28:45,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632d759a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:28:45, skipping insertion in model container [2025-01-09 13:28:45,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:45" (2/3) ... [2025-01-09 13:28:45,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632d759a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:28:45, skipping insertion in model container [2025-01-09 13:28:45,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:45" (3/3) ... [2025-01-09 13:28:45,501 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-34.i [2025-01-09 13:28:45,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:28:45,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-34.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:28:45,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:28:45,572 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;@2413aa11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:28:45,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:28:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:28:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 13:28:45,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:45,583 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:45,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:45,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash -245360027, now seen corresponding path program 1 times [2025-01-09 13:28:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:45,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366588821] [2025-01-09 13:28:45,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:45,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 13:28:45,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 13:28:45,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:45,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:28:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:28:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366588821] [2025-01-09 13:28:47,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366588821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:28:47,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:28:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:28:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441181034] [2025-01-09 13:28:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:28:47,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:28:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:28:47,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:28:47,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:28:47,733 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:28:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:48,140 INFO L93 Difference]: Finished difference Result 127 states and 203 transitions. [2025-01-09 13:28:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:28:48,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2025-01-09 13:28:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:48,147 INFO L225 Difference]: With dead ends: 127 [2025-01-09 13:28:48,147 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 13:28:48,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:28:48,151 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:28:48,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 221 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:28:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 13:28:48,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2025-01-09 13:28:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:28:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2025-01-09 13:28:48,184 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 63 [2025-01-09 13:28:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:48,185 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2025-01-09 13:28:48,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:28:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2025-01-09 13:28:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 13:28:48,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:48,187 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:48,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 13:28:48,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:48,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -243512985, now seen corresponding path program 1 times [2025-01-09 13:28:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:48,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100286460] [2025-01-09 13:28:48,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:48,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 13:28:48,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 13:28:48,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:48,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:28:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:28:49,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100286460] [2025-01-09 13:28:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100286460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:28:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:28:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:28:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84631869] [2025-01-09 13:28:49,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:28:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:28:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:28:49,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:28:49,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:28:49,188 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:28:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:49,464 INFO L93 Difference]: Finished difference Result 234 states and 315 transitions. [2025-01-09 13:28:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:28:49,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2025-01-09 13:28:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:49,466 INFO L225 Difference]: With dead ends: 234 [2025-01-09 13:28:49,466 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 13:28:49,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:28:49,467 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 98 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:28:49,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 270 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:28:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 13:28:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 140. [2025-01-09 13:28:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.168421052631579) internal successors, (111), 95 states have internal predecessors, (111), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:28:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2025-01-09 13:28:49,498 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 63 [2025-01-09 13:28:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:49,499 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2025-01-09 13:28:49,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:28:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2025-01-09 13:28:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 13:28:49,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:49,500 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:49,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:28:49,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:49,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2082707303, now seen corresponding path program 1 times [2025-01-09 13:28:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:49,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652213142] [2025-01-09 13:28:49,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:49,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 13:28:49,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 13:28:49,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:49,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:28:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:28:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652213142] [2025-01-09 13:28:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652213142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:28:50,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:28:50,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:28:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488882094] [2025-01-09 13:28:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:28:50,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:28:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:28:50,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:28:50,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:28:50,984 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:28:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:51,215 INFO L93 Difference]: Finished difference Result 240 states and 311 transitions. [2025-01-09 13:28:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:28:51,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-01-09 13:28:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:51,217 INFO L225 Difference]: With dead ends: 240 [2025-01-09 13:28:51,217 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 13:28:51,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:28:51,218 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 35 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:28:51,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 205 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:28:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 13:28:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 146. [2025-01-09 13:28:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 101 states have internal predecessors, (119), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:28:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2025-01-09 13:28:51,236 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 64 [2025-01-09 13:28:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:51,236 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2025-01-09 13:28:51,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:28:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2025-01-09 13:28:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 13:28:51,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:51,238 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:51,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:28:51,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:51,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2025449001, now seen corresponding path program 1 times [2025-01-09 13:28:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:51,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739958553] [2025-01-09 13:28:51,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:51,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 13:28:51,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 13:28:51,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:51,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 13:28:51,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:28:51,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739958553] [2025-01-09 13:28:51,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739958553] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:28:51,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071877655] [2025-01-09 13:28:51,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:51,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:28:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:51,354 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 13:28:51,356 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 13:28:51,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 13:28:51,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 13:28:51,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:51,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:51,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:28:51,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:28:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 13:28:51,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:28:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 13:28:51,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071877655] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:28:51,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:28:51,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 13:28:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914146485] [2025-01-09 13:28:51,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:28:51,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:28:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:28:51,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:28:51,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:28:51,653 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:28:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:51,798 INFO L93 Difference]: Finished difference Result 232 states and 295 transitions. [2025-01-09 13:28:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:28:51,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 64 [2025-01-09 13:28:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:51,801 INFO L225 Difference]: With dead ends: 232 [2025-01-09 13:28:51,801 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 13:28:51,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:28:51,804 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:28:51,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 73 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:28:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 13:28:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2025-01-09 13:28:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:28:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2025-01-09 13:28:51,823 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 64 [2025-01-09 13:28:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:51,823 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2025-01-09 13:28:51,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 13:28:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2025-01-09 13:28:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 13:28:51,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:51,824 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:51,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:28:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:28:52,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:52,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1143511438, now seen corresponding path program 1 times [2025-01-09 13:28:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:52,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095320022] [2025-01-09 13:28:52,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:52,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 13:28:52,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 13:28:52,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:52,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:28:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:28:52,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095320022] [2025-01-09 13:28:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095320022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:28:52,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:28:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:28:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305359743] [2025-01-09 13:28:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:28:52,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:28:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:28:52,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:28:52,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:28:52,135 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:28:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:52,217 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2025-01-09 13:28:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:28:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-01-09 13:28:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:52,220 INFO L225 Difference]: With dead ends: 196 [2025-01-09 13:28:52,220 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 13:28:52,221 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 13:28:52,221 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 42 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:28:52,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 128 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:28:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 13:28:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2025-01-09 13:28:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 73 states have internal predecessors, (78), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:28:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2025-01-09 13:28:52,242 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 64 [2025-01-09 13:28:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:52,243 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2025-01-09 13:28:52,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:28:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2025-01-09 13:28:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 13:28:52,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:52,248 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:28:52,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:28:52,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:52,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1479327049, now seen corresponding path program 1 times [2025-01-09 13:28:52,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:52,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96580446] [2025-01-09 13:28:52,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:52,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:52,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 13:28:52,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 13:28:52,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:52,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2025-01-09 13:28:53,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:28:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96580446] [2025-01-09 13:28:53,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96580446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:28:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318191459] [2025-01-09 13:28:53,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:53,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:28:53,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:53,463 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 13:28:53,464 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 13:28:53,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 13:28:53,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 13:28:53,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:53,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:53,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 13:28:53,536 INFO L279 TraceCheckSpWp]: Computing forward predicates...