./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-17.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-17.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 c5b154791397fe03f4ccd2aee6b69c381d6379db1356ccf04a464c527d54c8e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:31:53,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:31:53,295 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:31:53,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:31:53,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:31:53,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:31:53,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:31:53,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:31:53,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:31:53,336 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:31:53,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:31:53,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:31:53,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:31:53,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:31:53,338 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:31:53,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:31:53,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:31:53,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:31:53,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:31:53,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:31:53,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:31:53,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:31:53,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:31:53,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:31:53,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:31:53,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:31:53,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:31:53,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:31:53,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:31:53,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:53,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:53,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:31:53,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:31:53,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:31:53,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:31:53,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:31:53,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:31:53,341 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 -> c5b154791397fe03f4ccd2aee6b69c381d6379db1356ccf04a464c527d54c8e6 [2025-01-09 14:31:53,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:31:53,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:31:53,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:31:53,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:31:53,575 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:31:53,577 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-17.i [2025-01-09 14:31:54,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25918535e/0f2366d61de049569674e0b8b017bdde/FLAG1fa375c61 [2025-01-09 14:31:55,094 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:31:55,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-17.i [2025-01-09 14:31:55,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25918535e/0f2366d61de049569674e0b8b017bdde/FLAG1fa375c61 [2025-01-09 14:31:55,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25918535e/0f2366d61de049569674e0b8b017bdde [2025-01-09 14:31:55,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:31:55,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:31:55,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:55,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:31:55,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:31:55,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e4d841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55, skipping insertion in model container [2025-01-09 14:31:55,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:31:55,228 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-17.i[915,928] [2025-01-09 14:31:55,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:55,279 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:31:55,286 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-17.i[915,928] [2025-01-09 14:31:55,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:31:55,313 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:31:55,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55 WrapperNode [2025-01-09 14:31:55,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:31:55,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:55,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:31:55,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:31:55,318 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:31:55" (1/1) ... [2025-01-09 14:31:55,323 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:31:55" (1/1) ... [2025-01-09 14:31:55,335 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-01-09 14:31:55,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:31:55,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:31:55,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:31:55,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:31:55,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,354 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:31:55,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:31:55,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:31:55,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:31:55,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:31:55,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (1/1) ... [2025-01-09 14:31:55,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:31:55,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:55,403 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:31:55,405 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:31:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:31:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:31:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:31:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:31:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:31:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:31:55,472 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:31:55,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:31:55,692 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 14:31:55,692 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:31:55,699 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:31:55,699 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:31:55,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:55 BoogieIcfgContainer [2025-01-09 14:31:55,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:31:55,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:31:55,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:31:55,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:31:55,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:31:55" (1/3) ... [2025-01-09 14:31:55,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f4761a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:55, skipping insertion in model container [2025-01-09 14:31:55,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:31:55" (2/3) ... [2025-01-09 14:31:55,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f4761a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:31:55, skipping insertion in model container [2025-01-09 14:31:55,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:55" (3/3) ... [2025-01-09 14:31:55,707 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-17.i [2025-01-09 14:31:55,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:31:55,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-17.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:31:55,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:31:55,778 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;@d5661f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:31:55,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:31:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 14:31:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 14:31:55,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:55,791 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:55,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:55,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -406369989, now seen corresponding path program 1 times [2025-01-09 14:31:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:55,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232775687] [2025-01-09 14:31:55,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:55,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:55,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:31:55,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:31:55,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:55,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 14:31:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232775687] [2025-01-09 14:31:56,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232775687] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:31:56,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881040568] [2025-01-09 14:31:56,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:56,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:56,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:56,003 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:31:56,005 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:31:56,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:31:56,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:31:56,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:56,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:56,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:31:56,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 14:31:56,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881040568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:56,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:31:56,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:31:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157605462] [2025-01-09 14:31:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:56,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:31:56,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:56,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:31:56,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:31:56,168 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 14:31:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:56,195 INFO L93 Difference]: Finished difference Result 124 states and 210 transitions. [2025-01-09 14:31:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:31:56,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-01-09 14:31:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:56,200 INFO L225 Difference]: With dead ends: 124 [2025-01-09 14:31:56,201 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 14:31:56,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:31:56,204 INFO L435 NwaCegarLoop]: 91 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, 91 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:31:56,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:31:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 14:31:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 14:31:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 14:31:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2025-01-09 14:31:56,231 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 144 [2025-01-09 14:31:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:56,232 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2025-01-09 14:31:56,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 14:31:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2025-01-09 14:31:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 14:31:56,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:56,234 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:56,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:31:56,438 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:31:56,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:56,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:56,439 INFO L85 PathProgramCache]: Analyzing trace with hash -213141567, now seen corresponding path program 1 times [2025-01-09 14:31:56,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:56,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909619484] [2025-01-09 14:31:56,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:56,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:56,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:31:56,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:31:56,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:56,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:31:56,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667402441] [2025-01-09 14:31:56,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:56,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:56,564 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:31:56,570 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:31:56,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:31:56,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:31:56,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:56,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:56,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 14:31:56,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:31:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 14:31:56,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:31:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:56,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909619484] [2025-01-09 14:31:56,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:31:56,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667402441] [2025-01-09 14:31:56,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667402441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:56,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:56,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:31:56,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780006176] [2025-01-09 14:31:56,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:56,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:31:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:56,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:31:56,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:31:56,868 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 14:31:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:57,025 INFO L93 Difference]: Finished difference Result 176 states and 261 transitions. [2025-01-09 14:31:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:31:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2025-01-09 14:31:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:57,028 INFO L225 Difference]: With dead ends: 176 [2025-01-09 14:31:57,029 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 14:31:57,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 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:31:57,030 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 56 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:57,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 236 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:31:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 14:31:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 84. [2025-01-09 14:31:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 14:31:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-01-09 14:31:57,056 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 144 [2025-01-09 14:31:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:57,056 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-01-09 14:31:57,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 14:31:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-01-09 14:31:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 14:31:57,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:57,063 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:57,070 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:31:57,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:57,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:57,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1561865795, now seen corresponding path program 1 times [2025-01-09 14:31:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:57,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318695376] [2025-01-09 14:31:57,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:57,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:57,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:31:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:31:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:31:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309040449] [2025-01-09 14:31:57,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:57,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:57,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:31:57,389 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:31:57,391 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:31:57,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:31:57,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:31:57,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:57,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:31:57,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:31:57,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:31:57,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:31:57,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:57,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:31:57,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:31:57,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:31:57,607 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:31:57,616 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:31:57,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:31:57,812 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:31:57,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:31:57,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:31:57 BoogieIcfgContainer [2025-01-09 14:31:57,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:31:57,869 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:31:57,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:31:57,869 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:31:57,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:31:55" (3/4) ... [2025-01-09 14:31:57,871 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:31:57,872 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:31:57,872 INFO L158 Benchmark]: Toolchain (without parser) took 2754.58ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 87.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2025-01-09 14:31:57,873 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:57,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.04ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:31:57,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.99ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:31:57,873 INFO L158 Benchmark]: Boogie Preprocessor took 38.69ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:57,873 INFO L158 Benchmark]: RCFGBuilder took 325.20ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 73.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:31:57,874 INFO L158 Benchmark]: TraceAbstraction took 2166.30ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 88.7MB in the end (delta: -16.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:57,874 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.8MB in the end (delta: 919.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:31:57,875 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.04ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.99ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.69ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.20ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 73.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2166.30ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 88.7MB in the end (delta: -16.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.8MB in the end (delta: 919.5kB). 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 someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10000000.8; [L23] double var_1_3 = 16.2; [L24] double var_1_4 = 7.5; [L25] double var_1_5 = 49.6; [L26] signed short int var_1_6 = -10; [L27] unsigned long int var_1_7 = 3280833198; [L28] unsigned long int var_1_8 = 10000000; [L29] signed short int var_1_10 = 1; [L30] signed long int var_1_11 = -32; [L31] double var_1_12 = 128.25; [L32] double var_1_13 = 4.4; [L33] signed long int var_1_14 = -1; [L34] signed long int var_1_15 = 4; [L35] signed long int var_1_16 = 64; [L36] signed long int var_1_17 = 4; [L37] unsigned char var_1_18 = 1; [L38] unsigned char var_1_19 = 1; VAL [isInitial=0, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L100] isInitial = 1 [L101] FCALL initially() [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L56] var_1_3 = __VERIFIER_nondet_double() [L57] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L57] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L58] var_1_4 = __VERIFIER_nondet_double() [L59] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L59] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L60] var_1_5 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L61] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L62] var_1_7 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=10000000] [L63] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=10000000] [L64] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=10000000] [L64] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=10000000] [L65] var_1_8 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1] [L66] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1] [L67] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L67] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L68] var_1_10 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L69] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L70] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L70] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L71] var_1_12 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L73] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L73] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L74] var_1_13 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L75] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L76] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L76] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L77] var_1_14 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L78] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L79] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L79] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L80] var_1_15 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L83] var_1_16 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L84] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L85] CALL assume_abort_if_not(var_1_16 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L85] RET assume_abort_if_not(var_1_16 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L86] var_1_17 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L87] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L88] CALL assume_abort_if_not(var_1_17 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L88] RET assume_abort_if_not(var_1_17 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L89] var_1_19 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L90] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L91] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L91] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L104] RET updateVariables() [L105] CALL step() [L42] COND TRUE (var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13)))) [L43] var_1_11 = (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))) VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L45] EXPR var_1_15 >> var_1_11 VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L45] COND FALSE !(((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) [L48] COND TRUE \read(var_1_18) [L49] var_1_1 = (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))) VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L51] COND FALSE !((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR (((var_1_18 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) ? (var_1_6 == ((signed short int) var_1_10)) : 1)) && (((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11 == ((signed long int) (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))))) : 1)) && ((((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) ? (var_1_18 == ((unsigned char) var_1_19)) : 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L96-L97] return (((var_1_18 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) ? (var_1_6 == ((signed short int) var_1_10)) : 1)) && (((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11 == ((signed long int) (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))))) : 1)) && ((((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) ? (var_1_18 == ((unsigned char) var_1_19)) : 1) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] [L19] reach_error() VAL [isInitial=1, var_1_10=-32767, var_1_11=0, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=-1, var_1_8=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 240 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 429 ConstructedInterpolants, 2 QuantifiedInterpolants, 457 SizeOfPredicates, 2 NumberOfNonLiveVariables, 626 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2992/3036 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:31:57,893 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-17.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 c5b154791397fe03f4ccd2aee6b69c381d6379db1356ccf04a464c527d54c8e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:31:59,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:32:00,024 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:32:00,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:32:00,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:32:00,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:32:00,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:32:00,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:32:00,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:32:00,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:32:00,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:32:00,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:32:00,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:32:00,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:32:00,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:32:00,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:32:00,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:32:00,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:32:00,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:32:00,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:32:00,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:32:00,055 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:32:00,055 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:32:00,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:32:00,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:32:00,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:32:00,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:32:00,055 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 -> c5b154791397fe03f4ccd2aee6b69c381d6379db1356ccf04a464c527d54c8e6 [2025-01-09 14:32:00,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:32:00,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:32:00,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:32:00,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:32:00,292 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:32:00,293 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-17.i [2025-01-09 14:32:01,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51c4a732/7223ebc382d2451496001e854f0a2163/FLAGe1ec02952 [2025-01-09 14:32:01,757 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:32:01,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-17.i [2025-01-09 14:32:01,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51c4a732/7223ebc382d2451496001e854f0a2163/FLAGe1ec02952 [2025-01-09 14:32:01,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51c4a732/7223ebc382d2451496001e854f0a2163 [2025-01-09 14:32:01,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:32:01,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:32:01,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:32:01,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:32:01,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:32:01,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:32:01" (1/1) ... [2025-01-09 14:32:01,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5812e66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:01, skipping insertion in model container [2025-01-09 14:32:01,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:32:01" (1/1) ... [2025-01-09 14:32:01,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:32:01,895 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-17.i[915,928] [2025-01-09 14:32:01,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:32:01,960 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:32:01,970 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-17.i[915,928] [2025-01-09 14:32:01,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:32:02,006 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:32:02,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02 WrapperNode [2025-01-09 14:32:02,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:32:02,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:32:02,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:32:02,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:32:02,014 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:32:02" (1/1) ... [2025-01-09 14:32:02,022 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:32:02" (1/1) ... [2025-01-09 14:32:02,041 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-01-09 14:32:02,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:32:02,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:32:02,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:32:02,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:32:02,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,070 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:32:02,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:32:02,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:32:02,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:32:02,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:32:02,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (1/1) ... [2025-01-09 14:32:02,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:32:02,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:32:02,119 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:32:02,123 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:32:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:32:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:32:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:32:02,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:32:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:32:02,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:32:02,216 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:32:02,217 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:32:16,169 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:32:16,170 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:32:16,176 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:32:16,177 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:32:16,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:32:16 BoogieIcfgContainer [2025-01-09 14:32:16,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:32:16,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:32:16,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:32:16,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:32:16,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:32:01" (1/3) ... [2025-01-09 14:32:16,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e7eefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:32:16, skipping insertion in model container [2025-01-09 14:32:16,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:32:02" (2/3) ... [2025-01-09 14:32:16,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e7eefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:32:16, skipping insertion in model container [2025-01-09 14:32:16,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:32:16" (3/3) ... [2025-01-09 14:32:16,184 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-17.i [2025-01-09 14:32:16,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:32:16,195 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-17.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:32:16,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:32:16,243 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;@39cfa94f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:32:16,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:32:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 14:32:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 14:32:16,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:32:16,254 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:16,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:32:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:32:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1546959871, now seen corresponding path program 1 times [2025-01-09 14:32:16,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:32:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471328970] [2025-01-09 14:32:16,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:32:16,264 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:32:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:32:16,267 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:32:16,268 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:32:16,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 14:32:17,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 14:32:17,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:32:17,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:32:17,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:32:17,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:32:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 14:32:19,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:32:19,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:32:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471328970] [2025-01-09 14:32:19,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471328970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:32:19,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:32:19,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:32:19,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896139981] [2025-01-09 14:32:19,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:32:19,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:32:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:32:19,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:32:19,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:32:19,772 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 14:32:31,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:32:35,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:32:39,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:32:43,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:32:47,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:32:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:32:47,867 INFO L93 Difference]: Finished difference Result 120 states and 201 transitions. [2025-01-09 14:32:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:32:48,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-01-09 14:32:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:32:48,059 INFO L225 Difference]: With dead ends: 120 [2025-01-09 14:32:48,059 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 14:32:48,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:32:48,063 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 90 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:32:48,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 142 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 182 Invalid, 5 Unknown, 0 Unchecked, 25.5s Time] [2025-01-09 14:32:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 14:32:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-01-09 14:32:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 14:32:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-01-09 14:32:48,094 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 141 [2025-01-09 14:32:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:32:48,095 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-01-09 14:32:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 14:32:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-01-09 14:32:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 14:32:48,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:32:48,099 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:48,128 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 (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:32:48,300 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:32:48,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:32:48,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:32:48,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1604218173, now seen corresponding path program 1 times [2025-01-09 14:32:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:32:48,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177666773] [2025-01-09 14:32:48,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:32:48,302 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:32:48,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:32:48,304 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:32:48,306 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:32:48,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 14:32:49,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 14:32:49,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:32:49,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:32:49,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:32:49,528 INFO L279 TraceCheckSpWp]: Computing forward predicates...