./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:25:25,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:25:25,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:25:25,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:25:25,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:25:25,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:25:25,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:25:25,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:25:25,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:25:25,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:25:25,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:25:25,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:25:25,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:25:25,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:25:25,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:25:25,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:25:25,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:25:25,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:25:25,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:25:25,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:25:25,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:25:25,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:25,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:25:25,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:25:25,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:25:25,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:25:25,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:25:25,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:25:25,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:25:25,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:25:25,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:25:25,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:25:25,412 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/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 -> 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 [2025-03-17 04:25:25,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:25:25,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:25:25,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:25:25,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:25:25,647 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:25:25,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2025-03-17 04:25:26,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa3ba0c3/e8f64325bf524c8fb7083011823dc8ea/FLAG8a87f5732 [2025-03-17 04:25:27,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:25:27,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2025-03-17 04:25:27,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa3ba0c3/e8f64325bf524c8fb7083011823dc8ea/FLAG8a87f5732 [2025-03-17 04:25:27,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa3ba0c3/e8f64325bf524c8fb7083011823dc8ea [2025-03-17 04:25:27,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:25:27,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:25:27,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:27,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:25:27,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:25:27,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f713cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27, skipping insertion in model container [2025-03-17 04:25:27,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:25:27,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i[915,928] [2025-03-17 04:25:27,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:27,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:25:27,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i[915,928] [2025-03-17 04:25:27,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:27,518 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:25:27,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27 WrapperNode [2025-03-17 04:25:27,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:27,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:27,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:25:27,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:25:27,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,544 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2025-03-17 04:25:27,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:27,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:25:27,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:25:27,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:25:27,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,560 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-03-17 04:25:27,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:25:27,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:25:27,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:25:27,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:25:27,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (1/1) ... [2025-03-17 04:25:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:27,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:27,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:25:27,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:25:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:25:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:25:27,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:25:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:25:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:25:27,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:25:27,670 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:25:27,672 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:25:27,831 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:25:27,831 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:25:27,839 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:25:27,839 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:25:27,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:27 BoogieIcfgContainer [2025-03-17 04:25:27,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:25:27,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:25:27,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:25:27,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:25:27,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:25:27" (1/3) ... [2025-03-17 04:25:27,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afe8e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:27, skipping insertion in model container [2025-03-17 04:25:27,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:27" (2/3) ... [2025-03-17 04:25:27,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afe8e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:27, skipping insertion in model container [2025-03-17 04:25:27,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:27" (3/3) ... [2025-03-17 04:25:27,847 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-99.i [2025-03-17 04:25:27,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:25:27,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-99.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:25:27,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:25:27,900 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;@7edd544, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:25:27,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:25:27,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 04:25:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 04:25:27,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:27,911 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:27,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:27,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1145465674, now seen corresponding path program 1 times [2025-03-17 04:25:27,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901712974] [2025-03-17 04:25:27,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:27,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 04:25:27,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 04:25:27,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:27,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 04:25:28,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:28,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901712974] [2025-03-17 04:25:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901712974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236586010] [2025-03-17 04:25:28,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:28,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:28,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:28,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:25:28,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:25:28,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 04:25:28,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 04:25:28,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:28,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:28,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:25:28,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 04:25:28,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:25:28,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236586010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:28,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:28,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:25:28,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093223871] [2025-03-17 04:25:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:28,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:25:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:28,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:25:28,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:25:28,214 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:25:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:28,228 INFO L93 Difference]: Finished difference Result 67 states and 111 transitions. [2025-03-17 04:25:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:25:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 79 [2025-03-17 04:25:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:28,236 INFO L225 Difference]: With dead ends: 67 [2025-03-17 04:25:28,237 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 04:25:28,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-03-17 04:25:28,242 INFO L435 NwaCegarLoop]: 46 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, 46 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-03-17 04:25:28,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:25:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 04:25:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 04:25:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 04:25:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2025-03-17 04:25:28,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 79 [2025-03-17 04:25:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:28,270 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2025-03-17 04:25:28,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:25:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2025-03-17 04:25:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 04:25:28,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:28,274 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:28,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:25:28,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:25:28,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:28,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash -178078055, now seen corresponding path program 1 times [2025-03-17 04:25:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:28,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675987889] [2025-03-17 04:25:28,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:28,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 04:25:28,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 04:25:28,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:28,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:25:29,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:29,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675987889] [2025-03-17 04:25:29,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675987889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:29,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:29,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:25:29,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908285582] [2025-03-17 04:25:29,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:29,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:25:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:29,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:25:29,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:25:29,235 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:25:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:29,391 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-03-17 04:25:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:25:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 79 [2025-03-17 04:25:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:29,392 INFO L225 Difference]: With dead ends: 53 [2025-03-17 04:25:29,393 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 04:25:29,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:25:29,393 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:29,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:25:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 04:25:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-17 04:25:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 04:25:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2025-03-17 04:25:29,416 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 79 [2025-03-17 04:25:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:29,417 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2025-03-17 04:25:29,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:25:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2025-03-17 04:25:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 04:25:29,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:29,418 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:29,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:25:29,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:29,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash -178048264, now seen corresponding path program 1 times [2025-03-17 04:25:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886856673] [2025-03-17 04:25:29,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:29,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 04:25:29,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 04:25:29,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:29,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:25:29,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:25:29,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 04:25:29,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 04:25:29,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:29,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:25:29,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:25:29,524 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:25:29,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:25:29,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:25:29,528 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:25:29,571 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:25:29,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:25:29 BoogieIcfgContainer [2025-03-17 04:25:29,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:25:29,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:25:29,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:25:29,579 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:25:29,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:27" (3/4) ... [2025-03-17 04:25:29,582 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:25:29,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:25:29,583 INFO L158 Benchmark]: Toolchain (without parser) took 2233.94ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 81.0MB in the end (delta: 26.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2025-03-17 04:25:29,583 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:29,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.37ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 95.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:29,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.71ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:29,583 INFO L158 Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:29,584 INFO L158 Benchmark]: IcfgBuilder took 270.51ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 77.2MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:29,584 INFO L158 Benchmark]: TraceAbstraction took 1736.91ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 81.0MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:29,585 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 81.0MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:29,586 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.37ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 95.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.71ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.49ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 270.51ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 77.2MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1736.91ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 81.0MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 81.0MB 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 someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 3.25; [L24] double var_1_3 = 32.75; [L25] double var_1_4 = 128.75; [L26] unsigned char var_1_6 = 32; [L27] unsigned char var_1_7 = 32; [L28] unsigned char var_1_8 = 16; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] signed short int var_1_12 = 10; [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L44] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L45] var_1_3 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L46] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L47] var_1_4 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L48] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L49] var_1_6 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=32, var_1_8=16, var_1_9=0] [L50] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=32, var_1_8=16, var_1_9=0] [L51] CALL assume_abort_if_not(var_1_6 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=32, var_1_8=16, var_1_9=0] [L51] RET assume_abort_if_not(var_1_6 <= 64) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=32, var_1_8=16, var_1_9=0] [L52] var_1_7 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_7 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=16, var_1_9=0] [L53] RET assume_abort_if_not(var_1_7 >= 32) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=16, var_1_9=0] [L54] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=16, var_1_9=0] [L54] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=16, var_1_9=0] [L55] var_1_8 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_9=0] [L56] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_9=0] [L57] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=0] [L57] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=0] [L58] var_1_9 = __VERIFIER_nondet_uchar() [L59] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512] [L59] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512] [L60] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L60] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L61] var_1_11 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L62] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L63] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L63] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L76] RET updateVariables() [L77] CALL step() [L36] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L37] COND FALSE !((var_1_2 <= (var_1_3 - var_1_4)) && var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L40] var_1_12 = var_1_1 [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((var_1_2 <= (var_1_3 - var_1_4)) && var_1_10) ? (var_1_1 == ((unsigned char) (((var_1_6 + var_1_7) - var_1_8) + var_1_9))) : 1) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((signed short int) var_1_1)) ; [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_1=1, var_1_6=-225, var_1_7=130879, var_1_8=-512, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 63 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 171 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 101 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 191 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 912/936 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-03-17 04:25:29,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:25:31,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:25:31,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:25:31,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:25:31,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:25:31,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:25:31,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:25:31,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:25:31,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:25:31,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:25:31,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:25:31,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:25:31,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:25:31,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:25:31,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:25:31,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:25:31,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:25:31,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:31,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:25:31,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:25:31,525 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/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 -> 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 [2025-03-17 04:25:31,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:25:31,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:25:31,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:25:31,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:25:31,771 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:25:31,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2025-03-17 04:25:32,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c8c88a/949dd1833fbb4c00a4569cace453d6d0/FLAG0427569a8 [2025-03-17 04:25:33,130 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:25:33,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2025-03-17 04:25:33,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c8c88a/949dd1833fbb4c00a4569cace453d6d0/FLAG0427569a8 [2025-03-17 04:25:33,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c8c88a/949dd1833fbb4c00a4569cace453d6d0 [2025-03-17 04:25:33,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:25:33,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:25:33,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:33,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:25:33,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:25:33,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d2c1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33, skipping insertion in model container [2025-03-17 04:25:33,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:25:33,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i[915,928] [2025-03-17 04:25:33,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:33,629 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:25:33,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i[915,928] [2025-03-17 04:25:33,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:33,660 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:25:33,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33 WrapperNode [2025-03-17 04:25:33,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:33,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:33,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:25:33,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:25:33,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,684 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2025-03-17 04:25:33,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:33,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:25:33,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:25:33,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:25:33,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,700 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-03-17 04:25:33,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:25:33,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:25:33,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:25:33,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:25:33,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (1/1) ... [2025-03-17 04:25:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:33,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:33,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:25:33,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:25:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:25:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:25:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:25:33,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:25:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:25:33,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:25:33,807 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:25:33,809 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:25:34,430 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:25:34,431 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:25:34,437 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:25:34,437 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:25:34,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:34 BoogieIcfgContainer [2025-03-17 04:25:34,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:25:34,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:25:34,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:25:34,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:25:34,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:25:33" (1/3) ... [2025-03-17 04:25:34,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d32daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:34, skipping insertion in model container [2025-03-17 04:25:34,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:33" (2/3) ... [2025-03-17 04:25:34,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d32daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:34, skipping insertion in model container [2025-03-17 04:25:34,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:34" (3/3) ... [2025-03-17 04:25:34,445 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-99.i [2025-03-17 04:25:34,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:25:34,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-99.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:25:34,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:25:34,503 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;@6895df60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:25:34,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:25:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 04:25:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 04:25:34,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:34,514 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:34,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:34,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1145465674, now seen corresponding path program 1 times [2025-03-17 04:25:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778503666] [2025-03-17 04:25:34,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:34,526 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-03-17 04:25:34,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:25:34,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-17 04:25:34,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:34,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 04:25:34,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 04:25:34,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:34,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:34,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:25:34,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 04:25:34,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:25:34,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:34,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778503666] [2025-03-17 04:25:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778503666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:34,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:34,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:25:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120211295] [2025-03-17 04:25:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:34,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:25:34,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:34,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:25:34,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:25:34,727 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:25:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:34,739 INFO L93 Difference]: Finished difference Result 67 states and 111 transitions. [2025-03-17 04:25:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:25:34,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 79 [2025-03-17 04:25:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:34,748 INFO L225 Difference]: With dead ends: 67 [2025-03-17 04:25:34,748 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 04:25:34,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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-03-17 04:25:34,754 INFO L435 NwaCegarLoop]: 46 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, 46 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-03-17 04:25:34,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:25:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 04:25:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 04:25:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 04:25:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2025-03-17 04:25:34,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 79 [2025-03-17 04:25:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:34,790 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2025-03-17 04:25:34,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:25:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2025-03-17 04:25:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 04:25:34,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:34,793 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:34,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:34,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-17 04:25:34,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:34,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:34,995 INFO L85 PathProgramCache]: Analyzing trace with hash -178078055, now seen corresponding path program 1 times [2025-03-17 04:25:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:34,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400062122] [2025-03-17 04:25:34,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:34,996 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-03-17 04:25:34,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:25:34,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-17 04:25:35,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:35,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 04:25:35,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 04:25:35,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:35,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:35,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 04:25:35,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 04:25:36,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 04:25:36,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400062122] [2025-03-17 04:25:36,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400062122] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:36,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 26 [2025-03-17 04:25:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982367883] [2025-03-17 04:25:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:36,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:25:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:36,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:25:36,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-03-17 04:25:36,768 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:25:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:37,573 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-03-17 04:25:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:25:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 79 [2025-03-17 04:25:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:37,575 INFO L225 Difference]: With dead ends: 53 [2025-03-17 04:25:37,576 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 04:25:37,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2025-03-17 04:25:37,577 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:37,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:25:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 04:25:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-17 04:25:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 04:25:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2025-03-17 04:25:37,590 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 79 [2025-03-17 04:25:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2025-03-17 04:25:37,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-17 04:25:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2025-03-17 04:25:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 04:25:37,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:37,592 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 04:25:37,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-17 04:25:37,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:37,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -178048264, now seen corresponding path program 1 times [2025-03-17 04:25:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883313816] [2025-03-17 04:25:37,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:37,795 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-03-17 04:25:37,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:25:37,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-17 04:25:37,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 04:25:37,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 04:25:37,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 04:25:37,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:37,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:37,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 04:25:37,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 04:25:40,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:25:40,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:40,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883313816] [2025-03-17 04:25:40,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883313816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:40,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:40,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 04:25:40,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185570386] [2025-03-17 04:25:40,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:40,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:25:40,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:40,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:25:40,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:25:40,770 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:25:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:47,572 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2025-03-17 04:25:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 04:25:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 79 [2025-03-17 04:25:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:47,580 INFO L225 Difference]: With dead ends: 56 [2025-03-17 04:25:47,580 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:25:47,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:25:47,581 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:47,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 110 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-17 04:25:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:25:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:25:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 04:25:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:25:47,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-03-17 04:25:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:47,582 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:25:47,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 04:25:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:25:47,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:25:47,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:25:47,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2025-03-17 04:25:47,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-17 04:25:47,789 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:25:47,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:25:50,894 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:25:50,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-17 04:25:50,903 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-17 04:25:50,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:25:50 BoogieIcfgContainer [2025-03-17 04:25:50,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:25:50,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:25:50,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:25:50,908 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:25:50,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:34" (3/4) ... [2025-03-17 04:25:50,910 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:25:50,913 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:25:50,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 04:25:50,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 04:25:50,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:25:50,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:25:50,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:25:50,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:25:50,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:25:50,971 INFO L158 Benchmark]: Toolchain (without parser) took 17468.90ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 47.4MB in the end (delta: 45.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2025-03-17 04:25:50,971 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:50,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.11ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:50,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.37ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:50,973 INFO L158 Benchmark]: Boogie Preprocessor took 24.23ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:25:50,973 INFO L158 Benchmark]: IcfgBuilder took 725.85ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 63.7MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:50,974 INFO L158 Benchmark]: TraceAbstraction took 16465.74ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 53.5MB in the end (delta: 9.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2025-03-17 04:25:50,974 INFO L158 Benchmark]: Witness Printer took 63.23ms. Allocated memory is still 117.4MB. Free memory was 53.5MB in the beginning and 47.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:25:50,976 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.25ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.11ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.37ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.23ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 725.85ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 63.7MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16465.74ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 53.5MB in the end (delta: 9.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Witness Printer took 63.23ms. Allocated memory is still 117.4MB. Free memory was 53.5MB in the beginning and 47.4MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 63 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 281 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 268 IncrementalHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 128 mSDtfsCounter, 268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 21, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1361 SizeOfPredicates, 28 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1185/1248 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Location Invariant Derived location invariant: ((((var_1_11 >= 1) && (var_1_11 <= 1)) && (var_1_11 == var_1_10)) || (((var_1_11 >= 1) && (var_1_11 <= 1)) && (var_1_11 == var_1_10))) RESULT: Ultimate proved your program to be correct! [2025-03-17 04:25:51,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE