./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.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_amount25_file-33.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 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:33:57,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:33:57,287 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:33:57,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:33:57,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:33:57,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:33:57,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:33:57,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:33:57,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:33:57,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:33:57,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:33:57,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:33:57,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:33:57,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:33:57,321 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:33:57,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:33:57,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:33:57,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:33:57,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:33:57,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:33:57,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:33:57,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:33:57,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:33:57,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:33:57,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:33:57,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:33:57,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:33:57,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:33:57,324 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 -> 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 [2025-01-09 14:33:57,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:33:57,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:33:57,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:33:57,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:33:57,568 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:33:57,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2025-01-09 14:33:58,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d8a24c4b/22b54a13b6ef417294e6210480e0532e/FLAG48f9b7b43 [2025-01-09 14:33:59,019 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:33:59,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2025-01-09 14:33:59,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d8a24c4b/22b54a13b6ef417294e6210480e0532e/FLAG48f9b7b43 [2025-01-09 14:33:59,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d8a24c4b/22b54a13b6ef417294e6210480e0532e [2025-01-09 14:33:59,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:33:59,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:33:59,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:33:59,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:33:59,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:33:59,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0a8f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59, skipping insertion in model container [2025-01-09 14:33:59,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:33:59,165 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_amount25_file-33.i[915,928] [2025-01-09 14:33:59,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:33:59,196 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:33:59,204 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_amount25_file-33.i[915,928] [2025-01-09 14:33:59,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:33:59,224 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:33:59,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59 WrapperNode [2025-01-09 14:33:59,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:33:59,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:33:59,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:33:59,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:33:59,229 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:33:59" (1/1) ... [2025-01-09 14:33:59,233 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:33:59" (1/1) ... [2025-01-09 14:33:59,245 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-01-09 14:33:59,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:33:59,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:33:59,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:33:59,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:33:59,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,260 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:33:59,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:33:59,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:33:59,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:33:59,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:33:59,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (1/1) ... [2025-01-09 14:33:59,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:33:59,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:33:59,295 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:33:59,297 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:33:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:33:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:33:59,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:33:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:33:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:33:59,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:33:59,365 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:33:59,366 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:33:59,497 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 14:33:59,498 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:33:59,503 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:33:59,504 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:33:59,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:33:59 BoogieIcfgContainer [2025-01-09 14:33:59,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:33:59,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:33:59,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:33:59,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:33:59,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:33:59" (1/3) ... [2025-01-09 14:33:59,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c857787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:33:59, skipping insertion in model container [2025-01-09 14:33:59,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:33:59" (2/3) ... [2025-01-09 14:33:59,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c857787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:33:59, skipping insertion in model container [2025-01-09 14:33:59,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:33:59" (3/3) ... [2025-01-09 14:33:59,511 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-33.i [2025-01-09 14:33:59,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:33:59,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-33.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:33:59,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:33:59,574 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;@599d87f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:33:59,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:33:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 14:33:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 14:33:59,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:59,587 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:59,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:33:59,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:33:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1715457517, now seen corresponding path program 1 times [2025-01-09 14:33:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:33:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77261385] [2025-01-09 14:33:59,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:33:59,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 14:33:59,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 14:33:59,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:59,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 14:33:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:33:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77261385] [2025-01-09 14:33:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77261385] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:33:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380216896] [2025-01-09 14:33:59,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:33:59,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:33:59,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:33:59,726 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:33:59,728 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:33:59,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 14:33:59,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 14:33:59,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:33:59,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:33:59,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:33:59,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:33:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 14:33:59,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:33:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380216896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:33:59,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:33:59,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:33:59,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297930801] [2025-01-09 14:33:59,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:33:59,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:33:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:33:59,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:33:59,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:33:59,867 INFO L87 Difference]: Start difference. First operand has 49 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:33:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:33:59,881 INFO L93 Difference]: Finished difference Result 90 states and 141 transitions. [2025-01-09 14:33:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:33:59,883 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2025-01-09 14:33:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:33:59,888 INFO L225 Difference]: With dead ends: 90 [2025-01-09 14:33:59,888 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 14:33:59,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:33:59,893 INFO L435 NwaCegarLoop]: 60 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, 60 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:33:59,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:33:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 14:33:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 14:33:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 14:33:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2025-01-09 14:33:59,923 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 64 [2025-01-09 14:33:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:33:59,924 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-01-09 14:33:59,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:33:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2025-01-09 14:33:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 14:33:59,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:33:59,926 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:59,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:34:00,130 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:34:00,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 178334039, now seen corresponding path program 1 times [2025-01-09 14:34:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249037214] [2025-01-09 14:34:00,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:00,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 14:34:00,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 14:34:00,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:00,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:34:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249037214] [2025-01-09 14:34:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249037214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:34:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612062957] [2025-01-09 14:34:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:00,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:34:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:00,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:34:00,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:34:00,342 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:00,449 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2025-01-09 14:34:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:34:00,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 64 [2025-01-09 14:34:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:00,455 INFO L225 Difference]: With dead ends: 140 [2025-01-09 14:34:00,455 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 14:34:00,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:34:00,456 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:00,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 151 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 14:34:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-01-09 14:34:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2025-01-09 14:34:00,467 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 64 [2025-01-09 14:34:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:00,467 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2025-01-09 14:34:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2025-01-09 14:34:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 14:34:00,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:00,468 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:00,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:34:00,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:00,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -111661097, now seen corresponding path program 1 times [2025-01-09 14:34:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350945566] [2025-01-09 14:34:00,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:00,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 14:34:00,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 14:34:00,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:00,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:34:00,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:00,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350945566] [2025-01-09 14:34:00,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350945566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:00,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:00,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:34:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145168563] [2025-01-09 14:34:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:00,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:34:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:00,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:34:00,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:34:00,629 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:00,730 INFO L93 Difference]: Finished difference Result 185 states and 244 transitions. [2025-01-09 14:34:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:34:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2025-01-09 14:34:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:00,732 INFO L225 Difference]: With dead ends: 185 [2025-01-09 14:34:00,732 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 14:34:00,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:34:00,733 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 77 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:00,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 227 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 14:34:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-01-09 14:34:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 70 states have internal predecessors, (86), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2025-01-09 14:34:00,740 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 68 [2025-01-09 14:34:00,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:00,741 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2025-01-09 14:34:00,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2025-01-09 14:34:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 14:34:00,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:00,742 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:00,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:34:00,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:00,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1122778347, now seen corresponding path program 1 times [2025-01-09 14:34:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:00,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894331538] [2025-01-09 14:34:00,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:00,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 14:34:00,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 14:34:00,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:00,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:34:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894331538] [2025-01-09 14:34:01,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894331538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:01,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:01,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:34:01,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729027045] [2025-01-09 14:34:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:01,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:34:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:01,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:34:01,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:34:01,534 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:01,728 INFO L93 Difference]: Finished difference Result 229 states and 300 transitions. [2025-01-09 14:34:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:34:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2025-01-09 14:34:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:01,730 INFO L225 Difference]: With dead ends: 229 [2025-01-09 14:34:01,730 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 14:34:01,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:34:01,731 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 84 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:01,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 224 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 14:34:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2025-01-09 14:34:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 95 states have (on average 1.2) internal successors, (114), 95 states have internal predecessors, (114), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 14:34:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2025-01-09 14:34:01,760 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 68 [2025-01-09 14:34:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:01,760 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2025-01-09 14:34:01,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2025-01-09 14:34:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 14:34:01,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:01,762 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:01,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:34:01,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:01,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash -442719977, now seen corresponding path program 1 times [2025-01-09 14:34:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:01,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590675522] [2025-01-09 14:34:01,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:01,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 14:34:01,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 14:34:01,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:01,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:34:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590675522] [2025-01-09 14:34:03,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590675522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:03,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:34:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335872842] [2025-01-09 14:34:03,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:03,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:34:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:03,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:34:03,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:34:03,590 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:04,483 INFO L93 Difference]: Finished difference Result 153 states and 192 transitions. [2025-01-09 14:34:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:34:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2025-01-09 14:34:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:04,485 INFO L225 Difference]: With dead ends: 153 [2025-01-09 14:34:04,485 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 14:34:04,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:34:04,486 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 105 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:04,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 276 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:34:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 14:34:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2025-01-09 14:34:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.1743119266055047) internal successors, (128), 109 states have internal predecessors, (128), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 14:34:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 176 transitions. [2025-01-09 14:34:04,508 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 176 transitions. Word has length 68 [2025-01-09 14:34:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 176 transitions. [2025-01-09 14:34:04,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 176 transitions. [2025-01-09 14:34:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 14:34:04,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:04,513 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:04,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:34:04,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:04,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash 214753525, now seen corresponding path program 1 times [2025-01-09 14:34:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:04,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774135791] [2025-01-09 14:34:04,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:04,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 14:34:04,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 14:34:04,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:04,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-01-09 14:34:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774135791] [2025-01-09 14:34:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774135791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:34:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509665093] [2025-01-09 14:34:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:04,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:34:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:04,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:34:04,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:34:04,704 INFO L87 Difference]: Start difference. First operand 137 states and 176 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 14:34:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:04,729 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2025-01-09 14:34:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:34:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-01-09 14:34:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:04,730 INFO L225 Difference]: With dead ends: 147 [2025-01-09 14:34:04,730 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 14:34:04,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:34:04,733 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:04,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 93 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:34:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 14:34:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2025-01-09 14:34:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 63 states have internal predecessors, (69), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2025-01-09 14:34:04,742 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 131 [2025-01-09 14:34:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:04,743 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2025-01-09 14:34:04,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 14:34:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2025-01-09 14:34:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 14:34:04,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:04,745 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:04,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:34:04,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:04,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1344958686, now seen corresponding path program 1 times [2025-01-09 14:34:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:04,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-01-09 14:34:04,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 14:34:04,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 14:34:04,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:04,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 40 proven. 27 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-01-09 14:34:04,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:34:04,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-01-09 14:34:04,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572021751] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:34:04,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722430905] [2025-01-09 14:34:04,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:04,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:04,981 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:34:04,985 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:34:05,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 14:34:05,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 14:34:05,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:05,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:05,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 14:34:05,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 331 proven. 15 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-01-09 14:34:07,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:34:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 50 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 14:34:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722430905] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:34:08,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:34:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 15 [2025-01-09 14:34:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461662507] [2025-01-09 14:34:08,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:34:08,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:34:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:34:08,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:34:08,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:34:08,955 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 14:34:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:09,104 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2025-01-09 14:34:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:34:09,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 133 [2025-01-09 14:34:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:09,105 INFO L225 Difference]: With dead ends: 153 [2025-01-09 14:34:09,106 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 14:34:09,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:34:09,107 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 86 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:09,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 263 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 14:34:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-01-09 14:34:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 states have internal predecessors, (79), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-01-09 14:34:09,117 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 133 [2025-01-09 14:34:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:09,118 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-01-09 14:34:09,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 3 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 14:34:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-01-09 14:34:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 14:34:09,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:09,120 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:09,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:34:09,324 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:34:09,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:09,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1190270766, now seen corresponding path program 1 times [2025-01-09 14:34:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:34:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299734340] [2025-01-09 14:34:09,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:34:09,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 14:34:09,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 14:34:09,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:09,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:34:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185805662] [2025-01-09 14:34:09,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:09,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:34:09,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:09,395 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:34:09,397 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:34:09,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 14:34:09,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 14:34:09,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:09,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:34:09,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:34:09,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 14:34:09,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 14:34:09,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:09,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:34:09,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:34:09,757 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:34:09,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:34:09,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:34:09,959 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:34:09,963 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:10,028 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:34:10,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:34:10 BoogieIcfgContainer [2025-01-09 14:34:10,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:34:10,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:34:10,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:34:10,035 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:34:10,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:33:59" (3/4) ... [2025-01-09 14:34:10,037 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:34:10,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:34:10,038 INFO L158 Benchmark]: Toolchain (without parser) took 10994.63ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 109.6MB in the beginning and 467.5MB in the end (delta: -358.0MB). Peak memory consumption was 330.8MB. Max. memory is 16.1GB. [2025-01-09 14:34:10,038 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:34:10,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.27ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 97.2MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:34:10,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.33ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 95.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:34:10,039 INFO L158 Benchmark]: Boogie Preprocessor took 22.45ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:34:10,039 INFO L158 Benchmark]: RCFGBuilder took 235.17ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 77.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:34:10,039 INFO L158 Benchmark]: TraceAbstraction took 10528.31ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 77.5MB in the beginning and 467.8MB in the end (delta: -390.3MB). Peak memory consumption was 297.3MB. Max. memory is 16.1GB. [2025-01-09 14:34:10,039 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 830.5MB. Free memory was 467.8MB in the beginning and 467.5MB in the end (delta: 267.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:34:10,040 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.27ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 97.2MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.33ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 95.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.45ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 235.17ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 77.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10528.31ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 77.5MB in the beginning and 467.8MB in the end (delta: -390.3MB). Peak memory consumption was 297.3MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 830.5MB. Free memory was 467.8MB in the beginning and 467.5MB in the end (delta: 267.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] unsigned char var_1_7 = 200; [L24] unsigned char var_1_8 = 4; [L25] signed char var_1_9 = 50; [L26] signed char var_1_12 = -5; [L27] float var_1_13 = 999999999999.8; [L28] float var_1_14 = 100.5; [L29] float var_1_15 = 32.75; [L30] unsigned char var_1_16 = 1; [L31] unsigned char var_1_17 = 1; [L32] unsigned char var_1_18 = 128; [L33] unsigned char last_1_var_1_7 = 200; [L34] signed char last_1_var_1_9 = 50; VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=4, var_1_9=50] [L87] isInitial = 1 [L88] FCALL initially() [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=4, var_1_9=50] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=1, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-272, var_1_7=200, var_1_8=1, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 [L46] signed short int stepLocal_2 = var_1_1; [L47] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=200, var_1_8=1, var_1_9=50] [L48] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=200, var_1_8=1, var_1_9=50] [L49] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=200, var_1_8=1, var_1_9=50] [L55] COND TRUE var_1_18 == var_1_18 [L56] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L58] signed short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, stepLocal_3=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L59] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_2=-272, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND FALSE !(!(cond)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L93] RET __VERIFIER_assert(property()) [L94] isInitial = 0 VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=1, var_1_9=50] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=-255, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=-255, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=-255, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=-255, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=-255, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=-255, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=-255, var_1_18=1, var_1_1=-272, var_1_7=1, var_1_8=126, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=1, var_1_17=-255, var_1_18=1, var_1_1=126, var_1_7=1, var_1_8=126, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 [L46] signed short int stepLocal_2 = var_1_1; [L47] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=126, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=1, var_1_8=126, var_1_9=50] [L48] COND TRUE \read(var_1_16) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_1=0, stepLocal_2=126, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=1, var_1_8=126, var_1_9=50] [L49] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_2=126, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=1, var_1_8=126, var_1_9=50] [L55] COND TRUE var_1_18 == var_1_18 [L56] var_1_7 = var_1_8 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_2=126, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=126, var_1_8=126, var_1_9=50] [L58] signed short int stepLocal_3 = var_1_1; VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_2=126, stepLocal_3=126, var_1_12=-127, var_1_13=4999999999999/5, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=126, var_1_8=126, var_1_9=50] [L59] COND TRUE var_1_18 == stepLocal_3 [L60] var_1_13 = (var_1_14 - var_1_15) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, stepLocal_2=126, var_1_12=-127, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=126, var_1_8=126, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=126, var_1_8=126, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=126, var_1_8=126, var_1_9=50] [L19] reach_error() VAL [isInitial=0, last_1_var_1_7=1, last_1_var_1_9=50, var_1_12=-127, var_1_16=-255, var_1_17=-255, var_1_18=126, var_1_1=126, var_1_7=126, var_1_8=126, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 1294 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 947 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 584 IncrementalHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 347 mSDtfsCounter, 584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 66 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1063 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 916 ConstructedInterpolants, 0 QuantifiedInterpolants, 4038 SizeOfPredicates, 15 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 2633/2716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 14:34:10,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_amount25_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:34:12,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:34:12,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:34:12,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:34:12,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:34:12,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:34:12,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:34:12,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:34:12,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:34:12,164 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:34:12,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:34:12,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:34:12,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:34:12,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:34:12,164 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:34:12,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:34:12,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:34:12,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:34:12,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:34:12,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:34:12,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:34:12,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:34:12,171 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 -> 9be54bf039b1b69bac47621c18caa89883f4e5db7b74fe4f3e62990547785f77 [2025-01-09 14:34:12,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:34:12,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:34:12,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:34:12,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:34:12,413 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:34:12,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2025-01-09 14:34:13,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c03332689/1e8a6bd66a9b4f23827731953b2f1624/FLAG77cf5275e [2025-01-09 14:34:13,924 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:34:13,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-33.i [2025-01-09 14:34:13,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c03332689/1e8a6bd66a9b4f23827731953b2f1624/FLAG77cf5275e [2025-01-09 14:34:14,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c03332689/1e8a6bd66a9b4f23827731953b2f1624 [2025-01-09 14:34:14,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:34:14,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:34:14,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:34:14,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:34:14,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:34:14,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a58a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14, skipping insertion in model container [2025-01-09 14:34:14,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:34:14,371 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_amount25_file-33.i[915,928] [2025-01-09 14:34:14,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:34:14,414 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:34:14,424 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_amount25_file-33.i[915,928] [2025-01-09 14:34:14,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:34:14,447 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:34:14,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14 WrapperNode [2025-01-09 14:34:14,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:34:14,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:34:14,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:34:14,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:34:14,454 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:34:14" (1/1) ... [2025-01-09 14:34:14,461 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:34:14" (1/1) ... [2025-01-09 14:34:14,473 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-01-09 14:34:14,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:34:14,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:34:14,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:34:14,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:34:14,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,496 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:34:14,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:34:14,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:34:14,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:34:14,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:34:14,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (1/1) ... [2025-01-09 14:34:14,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:34:14,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:34:14,548 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:34:14,555 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:34:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:34:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:34:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:34:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:34:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:34:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:34:14,631 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:34:14,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:34:14,881 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 14:34:14,882 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:34:14,891 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:34:14,891 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:34:14,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:34:14 BoogieIcfgContainer [2025-01-09 14:34:14,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:34:14,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:34:14,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:34:14,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:34:14,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:34:14" (1/3) ... [2025-01-09 14:34:14,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d3e323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:34:14, skipping insertion in model container [2025-01-09 14:34:14,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:34:14" (2/3) ... [2025-01-09 14:34:14,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d3e323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:34:14, skipping insertion in model container [2025-01-09 14:34:14,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:34:14" (3/3) ... [2025-01-09 14:34:14,902 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-33.i [2025-01-09 14:34:14,913 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:34:14,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-33.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:34:14,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:34:14,967 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;@16294f35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:34:14,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:34:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 14:34:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 14:34:14,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:14,975 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:14,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:14,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:14,983 INFO L85 PathProgramCache]: Analyzing trace with hash 661716409, now seen corresponding path program 1 times [2025-01-09 14:34:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499339733] [2025-01-09 14:34:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:14,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:14,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:34:15,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:34:15,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 14:34:15,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 14:34:15,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 14:34:15,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:15,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:15,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:34:15,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 14:34:15,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:34:15,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:34:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499339733] [2025-01-09 14:34:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499339733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:34:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184902011] [2025-01-09 14:34:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:15,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:34:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:34:15,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:34:15,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:34:15,165 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:34:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:15,179 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2025-01-09 14:34:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:34:15,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2025-01-09 14:34:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:15,188 INFO L225 Difference]: With dead ends: 72 [2025-01-09 14:34:15,188 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 14:34:15,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:34:15,192 INFO L435 NwaCegarLoop]: 48 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, 48 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:34:15,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:34:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 14:34:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 14:34:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 14:34:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-01-09 14:34:15,216 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 60 [2025-01-09 14:34:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-01-09 14:34:15,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:34:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-01-09 14:34:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 14:34:15,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:15,222 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:15,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 14:34:15,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:15,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:15,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2094544637, now seen corresponding path program 1 times [2025-01-09 14:34:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860626283] [2025-01-09 14:34:15,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:15,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:34:15,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:34:15,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 14:34:15,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 14:34:15,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 14:34:15,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:15,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:15,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 14:34:15,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:34:15,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:34:15,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:34:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860626283] [2025-01-09 14:34:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860626283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:15,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:15,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:34:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688048481] [2025-01-09 14:34:15,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:15,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:34:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:34:15,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:34:15,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:34:15,682 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:15,928 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2025-01-09 14:34:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:34:15,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2025-01-09 14:34:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:15,932 INFO L225 Difference]: With dead ends: 112 [2025-01-09 14:34:15,933 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 14:34:15,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:34:15,934 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 58 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:15,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:34:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 14:34:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2025-01-09 14:34:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2025-01-09 14:34:15,954 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 60 [2025-01-09 14:34:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:15,954 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2025-01-09 14:34:15,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2025-01-09 14:34:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 14:34:15,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:15,956 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:15,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:34:16,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:16,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:16,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1701517627, now seen corresponding path program 1 times [2025-01-09 14:34:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215233018] [2025-01-09 14:34:16,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:16,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:16,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:34:16,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:34:16,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 14:34:16,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 14:34:16,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 14:34:16,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:16,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:16,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:34:16,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 14:34:16,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:34:16,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:34:16,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215233018] [2025-01-09 14:34:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215233018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:16,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:16,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:34:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624415144] [2025-01-09 14:34:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:16,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:34:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:34:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:34:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:34:16,349 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:34:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:16,597 INFO L93 Difference]: Finished difference Result 151 states and 195 transitions. [2025-01-09 14:34:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:34:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2025-01-09 14:34:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:16,601 INFO L225 Difference]: With dead ends: 151 [2025-01-09 14:34:16,601 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 14:34:16,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:34:16,602 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 65 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:16,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 107 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 14:34:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-01-09 14:34:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2025-01-09 14:34:16,619 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 60 [2025-01-09 14:34:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:16,619 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2025-01-09 14:34:16,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 14:34:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2025-01-09 14:34:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 14:34:16,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:16,620 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:16,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:34:16,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:16,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:16,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2082535712, now seen corresponding path program 1 times [2025-01-09 14:34:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:16,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110687310] [2025-01-09 14:34:16,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:16,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:16,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:34:16,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:34:16,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 14:34:16,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 14:34:16,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 14:34:16,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:16,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:16,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 14:34:16,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:34:17,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:34:17,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:34:17,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110687310] [2025-01-09 14:34:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110687310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:17,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:17,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:34:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704800837] [2025-01-09 14:34:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:17,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:34:17,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:34:17,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:34:17,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:34:17,079 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:17,336 INFO L93 Difference]: Finished difference Result 267 states and 324 transitions. [2025-01-09 14:34:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:34:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-01-09 14:34:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:17,339 INFO L225 Difference]: With dead ends: 267 [2025-01-09 14:34:17,339 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 14:34:17,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:34:17,340 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 72 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:17,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 247 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:34:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 14:34:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2025-01-09 14:34:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 87 states have internal predecessors, (98), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 14:34:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2025-01-09 14:34:17,374 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 61 [2025-01-09 14:34:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:17,374 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2025-01-09 14:34:17,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2025-01-09 14:34:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 14:34:17,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:17,375 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:17,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 14:34:17,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:17,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:17,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2084382754, now seen corresponding path program 1 times [2025-01-09 14:34:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991043400] [2025-01-09 14:34:17,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:17,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:34:17,579 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:34:17,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 14:34:17,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 14:34:17,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 14:34:17,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:17,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:17,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 14:34:17,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:34:29,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:34:29,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:34:29,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991043400] [2025-01-09 14:34:29,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991043400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:29,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:34:29,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592538577] [2025-01-09 14:34:29,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:29,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:34:29,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:34:29,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:34:29,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:34:29,584 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:29,995 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2025-01-09 14:34:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:34:29,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-01-09 14:34:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:29,997 INFO L225 Difference]: With dead ends: 128 [2025-01-09 14:34:30,000 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 14:34:30,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:34:30,002 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:30,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 192 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:34:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 14:34:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-01-09 14:34:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 90 states have internal predecessors, (101), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 14:34:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2025-01-09 14:34:30,023 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 61 [2025-01-09 14:34:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:30,023 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2025-01-09 14:34:30,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2025-01-09 14:34:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 14:34:30,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:30,025 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:30,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-01-09 14:34:30,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:30,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:30,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1367867768, now seen corresponding path program 1 times [2025-01-09 14:34:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:30,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177884312] [2025-01-09 14:34:30,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:30,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:30,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:34:30,231 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:34:30,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 14:34:30,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 14:34:30,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 14:34:30,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:30,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:30,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:34:30,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 14:34:30,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:34:30,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:34:30,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177884312] [2025-01-09 14:34:30,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177884312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:34:30,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:34:30,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:34:30,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460495514] [2025-01-09 14:34:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:34:30,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:34:30,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:34:30,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:34:30,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:34:30,342 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:34:30,426 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2025-01-09 14:34:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:34:30,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 62 [2025-01-09 14:34:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:34:30,430 INFO L225 Difference]: With dead ends: 134 [2025-01-09 14:34:30,430 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 14:34:30,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:34:30,431 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:34:30,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:34:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 14:34:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2025-01-09 14:34:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 14:34:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2025-01-09 14:34:30,439 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 62 [2025-01-09 14:34:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:34:30,439 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2025-01-09 14:34:30,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 14:34:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2025-01-09 14:34:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 14:34:30,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:34:30,440 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:34:30,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 14:34:30,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:30,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:34:30,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:34:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash 24764098, now seen corresponding path program 1 times [2025-01-09 14:34:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:34:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358614259] [2025-01-09 14:34:30,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:34:30,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:34:30,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:34:30,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:34:30,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 14:34:30,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:34:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:34:30,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:34:30,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:34:30,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:34:30,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:34:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 346 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 14:34:50,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:35:12,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:35:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358614259] [2025-01-09 14:35:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358614259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:35:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1313276475] [2025-01-09 14:35:12,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:35:12,148 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 14:35:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 14:35:12,170 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 14:35:12,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-01-09 14:35:12,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 14:35:12,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 14:35:12,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:35:12,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:35:12,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 14:35:12,532 INFO L279 TraceCheckSpWp]: Computing forward predicates...