./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-49.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 ee450cdb7362593087eaa4f51cf0609baf72f213a54e3b9dfb94348c9a8e8899 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:44,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:44,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:04:44,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:44,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:44,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:44,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:44,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:44,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:44,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:44,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:44,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:44,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:44,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:44,968 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:44,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:44,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:44,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:44,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:04:44,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:44,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:44,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:44,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:04:44,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:04:44,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:44,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:44,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:44,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:44,970 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 -> ee450cdb7362593087eaa4f51cf0609baf72f213a54e3b9dfb94348c9a8e8899 [2025-03-04 00:04:45,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:45,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:45,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:45,212 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:45,212 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:45,213 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-49.i [2025-03-04 00:04:46,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d435686c4/9a99ef53782249f59b9c75897776c0bd/FLAGcd7ea4dc5 [2025-03-04 00:04:46,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:46,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-49.i [2025-03-04 00:04:46,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d435686c4/9a99ef53782249f59b9c75897776c0bd/FLAGcd7ea4dc5 [2025-03-04 00:04:46,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d435686c4/9a99ef53782249f59b9c75897776c0bd [2025-03-04 00:04:46,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:46,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:46,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:46,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:46,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:46,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46, skipping insertion in model container [2025-03-04 00:04:46,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:46,707 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-49.i[915,928] [2025-03-04 00:04:46,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:46,735 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:46,743 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-49.i[915,928] [2025-03-04 00:04:46,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:46,760 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:46,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46 WrapperNode [2025-03-04 00:04:46,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:46,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:46,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:46,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:46,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,791 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2025-03-04 00:04:46,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:46,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:46,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:46,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:46,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,813 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-04 00:04:46,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,816 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:46,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:46,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:46,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:46,826 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (1/1) ... [2025-03-04 00:04:46,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:46,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:46,855 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-04 00:04:46,857 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-04 00:04:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:46,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:04:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:46,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:46,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:46,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:47,083 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:47,086 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:47,096 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:47,097 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:47,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:47 BoogieIcfgContainer [2025-03-04 00:04:47,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:47,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:47,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:47,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:47,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:46" (1/3) ... [2025-03-04 00:04:47,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776da87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:47, skipping insertion in model container [2025-03-04 00:04:47,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:46" (2/3) ... [2025-03-04 00:04:47,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776da87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:47, skipping insertion in model container [2025-03-04 00:04:47,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:47" (3/3) ... [2025-03-04 00:04:47,106 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-49.i [2025-03-04 00:04:47,118 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:47,119 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-49.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:47,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:47,169 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;@189967b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:47,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 00:04:47,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:47,177 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:47,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:47,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash 293131902, now seen corresponding path program 1 times [2025-03-04 00:04:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141345494] [2025-03-04 00:04:47,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:47,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:47,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:47,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:47,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 00:04:47,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:04:47,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141345494] [2025-03-04 00:04:47,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141345494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:04:47,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367970238] [2025-03-04 00:04:47,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:47,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:04:47,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:47,352 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-04 00:04:47,353 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-04 00:04:47,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:47,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:47,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:47,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:47,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:47,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 00:04:47,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367970238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:04:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:04:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049950408] [2025-03-04 00:04:47,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:47,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:04:47,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:47,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:47,464 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:04:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:47,475 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2025-03-04 00:04:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:47,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-03-04 00:04:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:47,481 INFO L225 Difference]: With dead ends: 60 [2025-03-04 00:04:47,481 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:04:47,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-04 00:04:47,485 INFO L435 NwaCegarLoop]: 39 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, 39 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-04 00:04:47,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:04:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:04:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-04 00:04:47,508 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 55 [2025-03-04 00:04:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:47,509 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-04 00:04:47,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:04:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-04 00:04:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 00:04:47,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:47,510 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:47,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:04:47,711 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-04 00:04:47,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:47,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash -923853728, now seen corresponding path program 1 times [2025-03-04 00:04:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:04:47,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122806823] [2025-03-04 00:04:47,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:04:47,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:47,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:47,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:47,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:47,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:04:47,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:47,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:47,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:47,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:04:47,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:04:47,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:04:47,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:04:47,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:04:47,843 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:04:47,880 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:04:47,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:04:47 BoogieIcfgContainer [2025-03-04 00:04:47,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:04:47,884 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:04:47,884 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:04:47,884 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:04:47,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:47" (3/4) ... [2025-03-04 00:04:47,887 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:04:47,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:04:47,889 INFO L158 Benchmark]: Toolchain (without parser) took 1291.68ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 67.0MB in the end (delta: 62.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 00:04:47,889 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:47,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.48ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 118.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:47,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.56ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 117.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:47,891 INFO L158 Benchmark]: Boogie Preprocessor took 32.92ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 116.1MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:47,891 INFO L158 Benchmark]: IcfgBuilder took 272.74ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 103.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:04:47,891 INFO L158 Benchmark]: TraceAbstraction took 783.50ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 67.0MB in the end (delta: 36.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 00:04:47,891 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 167.8MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:04:47,892 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.48ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 118.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.56ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 117.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.92ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 116.1MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 272.74ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 103.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 783.50ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 67.0MB in the end (delta: 36.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 167.8MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.25; [L23] signed long int var_1_2 = 64; [L24] signed long int var_1_3 = -1; [L25] signed long int var_1_4 = -256; [L26] float var_1_5 = 3.5; [L27] float var_1_6 = 32.5; VAL [isInitial=0, var_1_1=1/4, var_1_2=64, var_1_3=-1, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L44] var_1_2 = __VERIFIER_nondet_long() [L45] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-1, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-1, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L45] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-1, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L46] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-1, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-1, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L46] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-1, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L47] var_1_3 = __VERIFIER_nondet_long() [L48] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L48] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L49] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L49] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=-256, var_1_5=7/2, var_1_6=65/2] [L50] var_1_4 = __VERIFIER_nondet_long() [L51] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_5=7/2, var_1_6=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_5=7/2, var_1_6=65/2] [L51] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_5=7/2, var_1_6=65/2] [L52] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_5=7/2, var_1_6=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_5=7/2, var_1_6=65/2] [L52] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_5=7/2, var_1_6=65/2] [L53] var_1_5 = __VERIFIER_nondet_float() [L54] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_6=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_6=65/2] [L54] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_6=65/2] [L55] var_1_6 = __VERIFIER_nondet_float() [L56] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0] [L56] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0] [L69] RET updateVariables() [L70] CALL step() [L31] signed long int stepLocal_1 = var_1_2; [L32] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-100001, stepLocal_1=-100001, var_1_1=1/4, var_1_2=-100001, var_1_3=-100002, var_1_4=0] [L33] COND FALSE !(-100000 <= stepLocal_1) [L40] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=-100001, var_1_1=69, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_6=69] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return (-100000 <= var_1_2) ? ((var_1_2 <= (var_1_3 + var_1_4)) ? (var_1_1 == ((float) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) : (var_1_1 == ((float) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : (var_1_1 == ((float) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_1=69, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_6=69] [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=69, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_6=69] [L19] reach_error() VAL [isInitial=1, var_1_1=69, var_1_2=-100001, var_1_3=-100002, var_1_4=0, var_1_6=69] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 39 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 139 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 210/224 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-04 00:04:47,908 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-49.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 ee450cdb7362593087eaa4f51cf0609baf72f213a54e3b9dfb94348c9a8e8899 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:04:49,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:04:49,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:04:49,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:04:49,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:04:49,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:04:49,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:04:49,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:04:49,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:04:49,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:04:49,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:04:49,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:04:49,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:04:49,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:04:49,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:04:49,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:04:49,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:04:49,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:49,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:04:49,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:04:49,871 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 -> ee450cdb7362593087eaa4f51cf0609baf72f213a54e3b9dfb94348c9a8e8899 [2025-03-04 00:04:50,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:04:50,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:04:50,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:04:50,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:04:50,135 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:04:50,136 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-49.i [2025-03-04 00:04:51,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7334a5869/854b7e52518048be8a20cd4217f854bb/FLAGf64406079 [2025-03-04 00:04:51,467 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:04:51,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-49.i [2025-03-04 00:04:51,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7334a5869/854b7e52518048be8a20cd4217f854bb/FLAGf64406079 [2025-03-04 00:04:51,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7334a5869/854b7e52518048be8a20cd4217f854bb [2025-03-04 00:04:51,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:04:51,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:04:51,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:51,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:04:51,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:04:51,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:51" (1/1) ... [2025-03-04 00:04:51,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b128bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:51, skipping insertion in model container [2025-03-04 00:04:51,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:04:51" (1/1) ... [2025-03-04 00:04:51,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:04:51,955 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-49.i[915,928] [2025-03-04 00:04:51,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:51,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:04:52,002 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-49.i[915,928] [2025-03-04 00:04:52,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:04:52,033 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:04:52,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52 WrapperNode [2025-03-04 00:04:52,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:04:52,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:52,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:04:52,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:04:52,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,063 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 67 [2025-03-04 00:04:52,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:04:52,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:04:52,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:04:52,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:04:52,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,079 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-04 00:04:52,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:04:52,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:04:52,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:04:52,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:04:52,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (1/1) ... [2025-03-04 00:04:52,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:04:52,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:04:52,114 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-04 00:04:52,117 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-04 00:04:52,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:04:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:04:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:04:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:04:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:04:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:04:52,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:04:52,177 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:04:52,319 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:04:52,319 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:04:52,326 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:04:52,327 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:04:52,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:52 BoogieIcfgContainer [2025-03-04 00:04:52,327 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:04:52,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:04:52,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:04:52,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:04:52,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:04:51" (1/3) ... [2025-03-04 00:04:52,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e41066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:52, skipping insertion in model container [2025-03-04 00:04:52,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:04:52" (2/3) ... [2025-03-04 00:04:52,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e41066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:04:52, skipping insertion in model container [2025-03-04 00:04:52,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:52" (3/3) ... [2025-03-04 00:04:52,336 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-49.i [2025-03-04 00:04:52,346 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:04:52,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-49.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:04:52,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:04:52,397 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;@1c98fd28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:04:52,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:04:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 00:04:52,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:52,411 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:52,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash 293131902, now seen corresponding path program 1 times [2025-03-04 00:04:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:52,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380398594] [2025-03-04 00:04:52,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:52,429 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-04 00:04:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:52,432 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-04 00:04:52,435 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-04 00:04:52,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:52,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:52,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:52,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:52,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:04:52,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 00:04:52,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:52,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380398594] [2025-03-04 00:04:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380398594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:52,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:04:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712821776] [2025-03-04 00:04:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:52,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:04:52,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:52,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:04:52,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:04:52,582 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:04:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:52,599 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2025-03-04 00:04:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:04:52,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-03-04 00:04:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:52,605 INFO L225 Difference]: With dead ends: 60 [2025-03-04 00:04:52,605 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:04:52,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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-04 00:04:52,610 INFO L435 NwaCegarLoop]: 39 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, 39 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-04 00:04:52,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:04:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:04:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:04:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-04 00:04:52,641 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 55 [2025-03-04 00:04:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:52,642 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-04 00:04:52,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:04:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-04 00:04:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 00:04:52,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:52,645 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:52,649 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-04 00:04:52,845 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-04 00:04:52,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:52,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash -923853728, now seen corresponding path program 1 times [2025-03-04 00:04:52,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:52,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509401524] [2025-03-04 00:04:52,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:52,847 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-04 00:04:52,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:52,849 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-04 00:04:52,851 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-04 00:04:52,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 00:04:52,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 00:04:52,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:52,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:52,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:04:52,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 00:04:55,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:04:55,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:04:55,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509401524] [2025-03-04 00:04:55,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509401524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:04:55,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:04:55,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:04:55,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658593066] [2025-03-04 00:04:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:04:55,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:04:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:04:55,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:04:55,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:04:55,203 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:04:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:04:55,599 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-04 00:04:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:04:55,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2025-03-04 00:04:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:04:55,601 INFO L225 Difference]: With dead ends: 44 [2025-03-04 00:04:55,601 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 00:04:55,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:04:55,602 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:04:55,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 120 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:04:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 00:04:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2025-03-04 00:04:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:04:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-04 00:04:55,607 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 55 [2025-03-04 00:04:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:04:55,608 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-04 00:04:55,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 00:04:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-04 00:04:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:04:55,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:04:55,609 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:04:55,612 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-04 00:04:55,812 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-04 00:04:55,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:04:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:04:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1454919717, now seen corresponding path program 1 times [2025-03-04 00:04:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:04:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094035633] [2025-03-04 00:04:55,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:04:55,813 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-04 00:04:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:04:55,817 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-04 00:04:55,817 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-04 00:04:55,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:04:55,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:04:55,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:04:55,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:04:55,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:04:55,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:04:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 00:04:56,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:05:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 00:05:01,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:01,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094035633] [2025-03-04 00:05:01,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094035633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:05:01,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:05:01,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 00:05:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106642232] [2025-03-04 00:05:01,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:05:01,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:05:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:01,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:05:01,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:05:01,583 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 00:05:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:02,717 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-04 00:05:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:05:02,719 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 56 [2025-03-04 00:05:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:02,720 INFO L225 Difference]: With dead ends: 49 [2025-03-04 00:05:02,720 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 00:05:02,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:05:02,721 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:02,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 172 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:05:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 00:05:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2025-03-04 00:05:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 00:05:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-03-04 00:05:02,726 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 56 [2025-03-04 00:05:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:02,726 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-04 00:05:02,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 00:05:02,727 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-03-04 00:05:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 00:05:02,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:05:02,728 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:05:02,732 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-04 00:05:02,931 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-04 00:05:02,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:05:02,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:05:02,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1455843238, now seen corresponding path program 1 times [2025-03-04 00:05:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:05:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340236012] [2025-03-04 00:05:02,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:05:02,932 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-04 00:05:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:05:02,958 INFO L229 MonitoredProcess]: Starting monitored process 5 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-04 00:05:02,959 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 (5)] Waiting until timeout for monitored process [2025-03-04 00:05:02,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 00:05:03,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 00:05:03,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:05:03,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:05:03,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:05:03,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:05:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 00:05:04,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:05:04,152 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:05:04,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340236012] [2025-03-04 00:05:04,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340236012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:05:04,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:05:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 00:05:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137975913] [2025-03-04 00:05:04,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:05:04,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:05:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:05:04,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:05:04,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:05:04,154 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:05:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:05:04,754 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-03-04 00:05:04,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:05:04,755 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2025-03-04 00:05:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:05:04,755 INFO L225 Difference]: With dead ends: 44 [2025-03-04 00:05:04,755 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:05:04,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:05:04,756 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:05:04,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 130 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:05:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:05:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:05:04,757 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-04 00:05:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:05:04,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-03-04 00:05:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:05:04,757 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:05:04,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 00:05:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:05:04,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:05:04,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:05:04,763 INFO L540 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 (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:05:04,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-04 00:05:04,963 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:05:04,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:05:05,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:05:05,903 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:05:05,904 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:05:05,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:05:05 BoogieIcfgContainer [2025-03-04 00:05:05,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:05:05,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:05:05,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:05:05,905 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:05:05,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:04:52" (3/4) ... [2025-03-04 00:05:05,908 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:05:05,912 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:05:05,916 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:05:05,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:05:05,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:05:05,917 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:05:05,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:05:05,975 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:05:05,975 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:05:05,976 INFO L158 Benchmark]: Toolchain (without parser) took 14129.13ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 59.2MB in the beginning and 108.9MB in the end (delta: -49.8MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2025-03-04 00:05:05,976 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:05,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.63ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 47.0MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:05,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.69ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:05,978 INFO L158 Benchmark]: Boogie Preprocessor took 25.52ms. Allocated memory is still 83.9MB. Free memory was 45.6MB in the beginning and 44.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:05,978 INFO L158 Benchmark]: IcfgBuilder took 236.77ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 32.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:05:05,979 INFO L158 Benchmark]: TraceAbstraction took 13575.50ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 31.7MB in the beginning and 114.9MB in the end (delta: -83.2MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2025-03-04 00:05:05,979 INFO L158 Benchmark]: Witness Printer took 69.73ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 108.9MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:05:05,980 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.63ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 47.0MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.69ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 45.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.52ms. Allocated memory is still 83.9MB. Free memory was 45.6MB in the beginning and 44.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 236.77ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 32.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13575.50ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 31.7MB in the beginning and 114.9MB in the end (delta: -83.2MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Witness Printer took 69.73ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 108.9MB in the end (delta: 6.0MB). There was no memory consumed. 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: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 461 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 573 IncrementalHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 115 mSDtfsCounter, 573 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, InterpolantAutomatonStates: 44, 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, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 273 ConstructedInterpolants, 3 QuantifiedInterpolants, 3115 SizeOfPredicates, 27 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 554/560 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 RESULT: Ultimate proved your program to be correct! [2025-03-04 00:05:06,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE