./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-91.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-91.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 81608a26f1f917dbf3cca690c4063f534b4221c490476c1a0897767c4fef85cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:41:53,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:41:53,197 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:41:53,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:41:53,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:41:53,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:41:53,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:41:53,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:41:53,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:41:53,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:41:53,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:41:53,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:41:53,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:41:53,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:41:53,237 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:41:53,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:41:53,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:41:53,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:41:53,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:41:53,239 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:41:53,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:41:53,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:41:53,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:41:53,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:53,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:41:53,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:41:53,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:41:53,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:41:53,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:53,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:41:53,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:41:53,241 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:41:53,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:41:53,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:41:53,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:41:53,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:41:53,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:41:53,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:41:53,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:41:53,242 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 -> 81608a26f1f917dbf3cca690c4063f534b4221c490476c1a0897767c4fef85cd [2025-01-09 14:41:53,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:41:53,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:41:53,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:41:53,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:41:53,525 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:41:53,526 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-91.i [2025-01-09 14:41:54,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2837d73b3/c82b77b6226649d0b74d1ce7abaa2cc5/FLAGf3e711a57 [2025-01-09 14:41:55,197 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:41:55,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-91.i [2025-01-09 14:41:55,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2837d73b3/c82b77b6226649d0b74d1ce7abaa2cc5/FLAGf3e711a57 [2025-01-09 14:41:55,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2837d73b3/c82b77b6226649d0b74d1ce7abaa2cc5 [2025-01-09 14:41:55,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:41:55,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:41:55,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:41:55,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:41:55,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:41:55,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b9962d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55, skipping insertion in model container [2025-01-09 14:41:55,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:41:55,384 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-91.i[915,928] [2025-01-09 14:41:55,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:41:55,437 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:41:55,448 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-91.i[915,928] [2025-01-09 14:41:55,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:41:55,480 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:41:55,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55 WrapperNode [2025-01-09 14:41:55,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:41:55,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:41:55,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:41:55,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:41:55,488 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:41:55" (1/1) ... [2025-01-09 14:41:55,495 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:41:55" (1/1) ... [2025-01-09 14:41:55,518 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-01-09 14:41:55,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:41:55,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:41:55,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:41:55,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:41:55,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,544 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:41:55,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:41:55,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:41:55,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:41:55,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:41:55,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (1/1) ... [2025-01-09 14:41:55,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:41:55,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:41:55,592 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:41:55,599 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:41:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:41:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:41:55,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:41:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:41:55,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:41:55,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:41:55,681 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:41:55,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:41:55,898 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 14:41:55,898 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:41:55,908 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:41:55,909 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:41:55,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:55 BoogieIcfgContainer [2025-01-09 14:41:55,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:41:55,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:41:55,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:41:55,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:41:55,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:41:55" (1/3) ... [2025-01-09 14:41:55,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4402dd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:41:55, skipping insertion in model container [2025-01-09 14:41:55,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:41:55" (2/3) ... [2025-01-09 14:41:55,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4402dd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:41:55, skipping insertion in model container [2025-01-09 14:41:55,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:55" (3/3) ... [2025-01-09 14:41:55,921 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-91.i [2025-01-09 14:41:55,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:41:55,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-91.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:41:55,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:41:56,002 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;@6bd17cd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:41:56,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:41:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:41:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 14:41:56,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:41:56,014 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:56,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:41:56,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:41:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1781105435, now seen corresponding path program 1 times [2025-01-09 14:41:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:41:56,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107649708] [2025-01-09 14:41:56,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:41:56,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 14:41:56,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 14:41:56,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:56,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:41:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 14:41:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:41:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107649708] [2025-01-09 14:41:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107649708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:41:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7296683] [2025-01-09 14:41:56,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:56,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:41:56,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:41:56,238 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:41:56,240 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:41:56,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 14:41:56,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 14:41:56,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:56,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:41:56,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:41:56,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:41:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 14:41:56,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:41:56,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7296683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:41:56,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:41:56,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:41:56,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30056007] [2025-01-09 14:41:56,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:41:56,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:41:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:41:56,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:41:56,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:41:56,419 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 14:41:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:41:56,440 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2025-01-09 14:41:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:41:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2025-01-09 14:41:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:41:56,447 INFO L225 Difference]: With dead ends: 102 [2025-01-09 14:41:56,447 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 14:41:56,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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:41:56,453 INFO L435 NwaCegarLoop]: 74 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, 74 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:41:56,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:41:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 14:41:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 14:41:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:41:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2025-01-09 14:41:56,487 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 75 [2025-01-09 14:41:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:41:56,487 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2025-01-09 14:41:56,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 14:41:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2025-01-09 14:41:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 14:41:56,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:41:56,490 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:56,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:41:56,694 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:41:56,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:41:56,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:41:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 370277347, now seen corresponding path program 1 times [2025-01-09 14:41:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:41:56,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002724738] [2025-01-09 14:41:56,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:41:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:41:56,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 14:41:56,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 14:41:56,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:41:56,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:41:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 14:41:58,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:41:58,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002724738] [2025-01-09 14:41:58,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002724738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:41:58,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:41:58,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:41:58,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707192913] [2025-01-09 14:41:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:41:58,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:41:58,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:41:58,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:41:58,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:41:58,106 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:42:02,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:42:06,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:42:08,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:42:12,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:42:16,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:42:20,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:42:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:42:20,673 INFO L93 Difference]: Finished difference Result 158 states and 226 transitions. [2025-01-09 14:42:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:42:20,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2025-01-09 14:42:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:42:20,675 INFO L225 Difference]: With dead ends: 158 [2025-01-09 14:42:20,675 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 14:42:20,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:42:20,678 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 91 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:42:20,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 391 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 5 Unknown, 0 Unchecked, 22.4s Time] [2025-01-09 14:42:20,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 14:42:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 54. [2025-01-09 14:42:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:42:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-01-09 14:42:20,698 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 75 [2025-01-09 14:42:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:42:20,699 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-01-09 14:42:20,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:42:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-01-09 14:42:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 14:42:20,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:42:20,703 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:20,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:42:20,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:42:20,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:42:20,708 INFO L85 PathProgramCache]: Analyzing trace with hash -439069279, now seen corresponding path program 1 times [2025-01-09 14:42:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:42:20,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476014391] [2025-01-09 14:42:20,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:42:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:42:20,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 14:42:20,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 14:42:20,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:42:20,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:42:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623724716] [2025-01-09 14:42:20,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:42:20,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:42:20,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:42:20,803 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:42:20,806 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:42:20,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 14:42:20,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 14:42:20,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:42:20,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:42:20,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:42:20,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 14:42:20,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 14:42:20,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:42:20,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:42:21,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:42:21,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:42:21,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:42:21,035 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:42:21,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:42:21,233 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:42:21,286 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:42:21,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:42:21 BoogieIcfgContainer [2025-01-09 14:42:21,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:42:21,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:42:21,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:42:21,293 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:42:21,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:41:55" (3/4) ... [2025-01-09 14:42:21,295 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:42:21,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:42:21,297 INFO L158 Benchmark]: Toolchain (without parser) took 26058.88ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 73.3MB in the end (delta: 49.4MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2025-01-09 14:42:21,297 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:42:21,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.35ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:42:21,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.66ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:42:21,300 INFO L158 Benchmark]: Boogie Preprocessor took 35.87ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 105.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:42:21,301 INFO L158 Benchmark]: RCFGBuilder took 350.18ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 89.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:42:21,301 INFO L158 Benchmark]: TraceAbstraction took 25380.37ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 73.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2025-01-09 14:42:21,301 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 167.8MB. Free memory was 73.3MB in the beginning and 73.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:42:21,302 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.24ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.35ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.66ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.87ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 105.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 350.18ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 89.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25380.37ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 73.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 167.8MB. Free memory was 73.3MB in the beginning and 73.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000000; [L23] signed short int var_1_5 = 1; [L24] signed short int var_1_8 = -128; [L25] signed short int var_1_9 = 1; [L26] float var_1_10 = 25.8; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 1; [L29] float var_1_13 = 16.45; [L30] unsigned long int var_1_14 = 200; [L31] unsigned short int var_1_15 = 32; [L32] unsigned short int var_1_16 = 256; VAL [isInitial=0, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-128, var_1_9=1] [L90] isInitial = 1 [L91] FCALL initially() [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L65] var_1_8 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L66] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L67] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=1] [L68] var_1_9 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_9 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L69] RET assume_abort_if_not(var_1_9 >= -32767) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L71] var_1_11 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L72] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L77] var_1_13 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L78] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L79] var_1_16 = __VERIFIER_nondet_ushort() [L80] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=5, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=5, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=5, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L94] RET updateVariables() [L95] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=5, var_1_15=5, var_1_16=5, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L38] COND FALSE !(\read(var_1_11)) [L49] var_1_10 = var_1_13 VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=5, var_1_15=5, var_1_16=5, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L51] COND FALSE !(var_1_10 >= 50.4f) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=5, var_1_15=5, var_1_16=5, var_1_1=100000000, var_1_5=1, var_1_8=0, var_1_9=0] [L54] COND FALSE !(var_1_15 == (var_1_14 * var_1_15)) [L61] var_1_5 = var_1_8 VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=5, var_1_15=5, var_1_16=5, var_1_1=100000000, var_1_5=0, var_1_8=0, var_1_9=0] [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR (((var_1_10 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : 1) && ((var_1_15 == (var_1_14 * var_1_15)) ? ((var_1_10 >= (var_1_10 + var_1_10)) ? (var_1_5 == ((signed short int) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_5 == ((signed short int) var_1_8))) : (var_1_5 == ((signed short int) var_1_8)))) && (var_1_11 ? (var_1_12 ? (((var_1_15 & var_1_14) == var_1_15) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=5, var_1_15=5, var_1_16=5, var_1_1=100000000, var_1_5=0, var_1_8=0, var_1_9=0] [L86-L87] return (((((var_1_10 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : 1) && ((var_1_15 == (var_1_14 * var_1_15)) ? ((var_1_10 >= (var_1_10 + var_1_10)) ? (var_1_5 == ((signed short int) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_5 == ((signed short int) var_1_8))) : (var_1_5 == ((signed short int) var_1_8)))) && (var_1_11 ? (var_1_12 ? (((var_1_15 & var_1_14) == var_1_15) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13)))) && (var_1_14 == ((unsigned long int) var_1_15))) && (var_1_15 == ((unsigned short int) var_1_16)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=5, var_1_15=5, var_1_16=5, var_1_1=100000000, var_1_5=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=5, var_1_15=5, var_1_16=5, var_1_1=100000000, var_1_5=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 22.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 465 SdHoareTripleChecker+Invalid, 22.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 185 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 7, 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, 56 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 185 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 640/660 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:42:21,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-91.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 81608a26f1f917dbf3cca690c4063f534b4221c490476c1a0897767c4fef85cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:42:23,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:42:23,557 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:42:23,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:42:23,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:42:23,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:42:23,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:42:23,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:42:23,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:42:23,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:42:23,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:42:23,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:42:23,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:42:23,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:42:23,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:42:23,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:42:23,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:42:23,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:42:23,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:42:23,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:42:23,618 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 -> 81608a26f1f917dbf3cca690c4063f534b4221c490476c1a0897767c4fef85cd [2025-01-09 14:42:23,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:42:23,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:42:23,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:42:23,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:42:23,927 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:42:23,929 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-91.i [2025-01-09 14:42:25,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d448bdf38/201959c02b7f41f180d2130b6aecae04/FLAG7a40fb225 [2025-01-09 14:42:25,575 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:42:25,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-91.i [2025-01-09 14:42:25,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d448bdf38/201959c02b7f41f180d2130b6aecae04/FLAG7a40fb225 [2025-01-09 14:42:25,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d448bdf38/201959c02b7f41f180d2130b6aecae04 [2025-01-09 14:42:25,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:42:25,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:42:25,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:42:25,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:42:25,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:42:25,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:42:25" (1/1) ... [2025-01-09 14:42:25,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac65ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:25, skipping insertion in model container [2025-01-09 14:42:25,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:42:25" (1/1) ... [2025-01-09 14:42:25,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:42:26,022 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-91.i[915,928] [2025-01-09 14:42:26,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:42:26,063 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:42:26,071 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-91.i[915,928] [2025-01-09 14:42:26,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:42:26,103 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:42:26,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26 WrapperNode [2025-01-09 14:42:26,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:42:26,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:42:26,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:42:26,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:42:26,113 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:42:26" (1/1) ... [2025-01-09 14:42:26,124 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:42:26" (1/1) ... [2025-01-09 14:42:26,146 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2025-01-09 14:42:26,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:42:26,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:42:26,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:42:26,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:42:26,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,178 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:42:26,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:42:26,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:42:26,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:42:26,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:42:26,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (1/1) ... [2025-01-09 14:42:26,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:42:26,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:42:26,250 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:42:26,256 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:42:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:42:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:42:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:42:26,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:42:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:42:26,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:42:26,335 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:42:26,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:42:26,614 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 14:42:26,615 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:42:26,623 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:42:26,623 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:42:26,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:42:26 BoogieIcfgContainer [2025-01-09 14:42:26,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:42:26,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:42:26,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:42:26,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:42:26,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:42:25" (1/3) ... [2025-01-09 14:42:26,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b66a7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:42:26, skipping insertion in model container [2025-01-09 14:42:26,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:42:26" (2/3) ... [2025-01-09 14:42:26,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b66a7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:42:26, skipping insertion in model container [2025-01-09 14:42:26,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:42:26" (3/3) ... [2025-01-09 14:42:26,635 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-91.i [2025-01-09 14:42:26,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:42:26,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-91.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:42:26,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:42:26,716 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;@2434dd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:42:26,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:42:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:42:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 14:42:26,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:42:26,729 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:26,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:42:26,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:42:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash 516242951, now seen corresponding path program 1 times [2025-01-09 14:42:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:42:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20380284] [2025-01-09 14:42:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:42:26,743 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:42:26,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:42:26,746 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:42:26,748 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:42:26,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 14:42:26,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 14:42:26,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:42:26,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:42:26,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:42:26,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:42:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 14:42:26,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:42:26,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:42:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20380284] [2025-01-09 14:42:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20380284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:42:26,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:42:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:42:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166035015] [2025-01-09 14:42:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:42:26,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:42:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:42:27,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:42:27,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:42:27,015 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 14:42:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:42:27,034 INFO L93 Difference]: Finished difference Result 76 states and 124 transitions. [2025-01-09 14:42:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:42:27,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2025-01-09 14:42:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:42:27,041 INFO L225 Difference]: With dead ends: 76 [2025-01-09 14:42:27,041 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 14:42:27,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:42:27,045 INFO L435 NwaCegarLoop]: 54 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, 54 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:42:27,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:42:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 14:42:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 14:42:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 14:42:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2025-01-09 14:42:27,082 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 73 [2025-01-09 14:42:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:42:27,082 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2025-01-09 14:42:27,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 14:42:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2025-01-09 14:42:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 14:42:27,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:42:27,085 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:27,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 14:42:27,285 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:42:27,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:42:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:42:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1926208379, now seen corresponding path program 1 times [2025-01-09 14:42:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:42:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206227362] [2025-01-09 14:42:27,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:42:27,287 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:42:27,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:42:27,289 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:42:27,290 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:42:27,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 14:42:27,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 14:42:27,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:42:27,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:42:27,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:42:27,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:42:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 14:42:30,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:42:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 14:42:54,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:42:54,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206227362] [2025-01-09 14:42:54,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206227362] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 14:42:54,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:42:54,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-01-09 14:42:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120009075] [2025-01-09 14:42:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:42:54,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:42:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:42:54,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:42:54,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:42:54,411 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:43:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:43:05,890 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2025-01-09 14:43:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:43:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2025-01-09 14:43:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:43:05,894 INFO L225 Difference]: With dead ends: 81 [2025-01-09 14:43:05,894 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 14:43:05,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:43:05,895 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 102 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:43:05,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 263 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 14:43:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 14:43:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2025-01-09 14:43:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 14:43:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2025-01-09 14:43:05,911 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 73 [2025-01-09 14:43:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:43:05,911 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-01-09 14:43:05,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 14:43:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2025-01-09 14:43:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 14:43:05,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:43:05,913 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 14:43:06,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 14:43:06,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:43:06,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:43:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1868950077, now seen corresponding path program 1 times [2025-01-09 14:43:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:43:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122877981] [2025-01-09 14:43:06,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:43:06,118 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:43:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:43:06,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:43:06,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 14:43:06,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 14:43:06,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 14:43:06,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:43:06,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:43:06,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:43:06,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:43:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 14:43:09,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:43:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 14:43:20,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:43:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122877981] [2025-01-09 14:43:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122877981] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:43:20,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:43:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-01-09 14:43:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102628908] [2025-01-09 14:43:20,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:43:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 14:43:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:43:20,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 14:43:20,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:43:20,531 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22)