./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-14.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 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:14:33,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:14:33,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:14:33,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:14:33,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:14:33,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:14:33,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:14:33,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:14:33,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:14:33,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:14:33,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:14:33,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:14:33,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:14:33,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:14:33,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:14:33,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:14:33,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:14:33,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:14:33,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:14:33,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:14:33,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:14:33,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:14:33,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:14:33,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:14:33,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:14:33,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:14:33,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:14:33,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:14:33,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:14:33,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:14:33,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:14:33,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:14:33,095 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 -> 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc [2025-03-08 15:14:33,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:14:33,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:14:33,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:14:33,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:14:33,309 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:14:33,310 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-14.i [2025-03-08 15:14:34,427 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dbf4708/2c2bfdca920842cb99206e9df962e35f/FLAG704067bb6 [2025-03-08 15:14:34,672 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:14:34,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2025-03-08 15:14:34,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dbf4708/2c2bfdca920842cb99206e9df962e35f/FLAG704067bb6 [2025-03-08 15:14:34,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dbf4708/2c2bfdca920842cb99206e9df962e35f [2025-03-08 15:14:34,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:14:34,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:14:34,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:14:34,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:14:34,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:14:34,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e98a554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34, skipping insertion in model container [2025-03-08 15:14:34,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:14:34,824 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-14.i[915,928] [2025-03-08 15:14:34,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:14:34,861 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:14:34,870 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-14.i[915,928] [2025-03-08 15:14:34,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:14:34,894 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:14:34,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34 WrapperNode [2025-03-08 15:14:34,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:14:34,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:14:34,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:14:34,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:14:34,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,922 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2025-03-08 15:14:34,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:14:34,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:14:34,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:14:34,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:14:34,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,944 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-08 15:14:34,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:14:34,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:14:34,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:14:34,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:14:34,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (1/1) ... [2025-03-08 15:14:34,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:14:34,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:14:34,983 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-08 15:14:34,990 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-08 15:14:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:14:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:14:35,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:14:35,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:14:35,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:14:35,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:14:35,057 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:14:35,058 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:14:35,188 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:14:35,188 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:14:35,195 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:14:35,195 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:14:35,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:35 BoogieIcfgContainer [2025-03-08 15:14:35,195 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:14:35,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:14:35,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:14:35,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:14:35,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:14:34" (1/3) ... [2025-03-08 15:14:35,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ff9fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:14:35, skipping insertion in model container [2025-03-08 15:14:35,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:34" (2/3) ... [2025-03-08 15:14:35,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ff9fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:14:35, skipping insertion in model container [2025-03-08 15:14:35,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:35" (3/3) ... [2025-03-08 15:14:35,204 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-14.i [2025-03-08 15:14:35,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:14:35,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-14.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:14:35,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:14:35,280 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;@5e82054f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:14:35,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:14:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 15:14:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 15:14:35,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:14:35,291 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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-08 15:14:35,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:14:35,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:14:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1194608137, now seen corresponding path program 1 times [2025-03-08 15:14:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:14:35,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794391736] [2025-03-08 15:14:35,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:14:35,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:14:35,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 15:14:35,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 15:14:35,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:14:35,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:14:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 15:14:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:14:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794391736] [2025-03-08 15:14:35,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794391736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:14:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519554426] [2025-03-08 15:14:35,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:14:35,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:14:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:14:35,450 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-08 15:14:35,451 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-08 15:14:35,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 15:14:35,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 15:14:35,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:14:35,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:14:35,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:14:35,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:14:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 15:14:35,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:14:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519554426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:14:35,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:14:35,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:14:35,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996197334] [2025-03-08 15:14:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:14:35,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:14:35,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:14:35,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:14:35,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:14:35,589 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 15:14:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:14:35,603 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-03-08 15:14:35,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:14:35,605 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-03-08 15:14:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:14:35,609 INFO L225 Difference]: With dead ends: 56 [2025-03-08 15:14:35,609 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 15:14:35,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 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-08 15:14:35,612 INFO L435 NwaCegarLoop]: 35 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, 35 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-08 15:14:35,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:14:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 15:14:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 15:14:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 15:14:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-08 15:14:35,636 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2025-03-08 15:14:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:14:35,636 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-08 15:14:35,637 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 15:14:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-08 15:14:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 15:14:35,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:14:35,638 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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-08 15:14:35,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:14:35,839 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-08 15:14:35,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:14:35,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:14:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1466818438, now seen corresponding path program 1 times [2025-03-08 15:14:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:14:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092634092] [2025-03-08 15:14:35,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:14:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:14:35,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 15:14:35,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 15:14:35,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:14:35,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:14:35,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:14:35,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 15:14:35,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 15:14:35,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:14:35,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:14:35,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:14:35,962 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:14:35,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:14:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:14:35,968 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 15:14:35,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:14:35,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:14:35 BoogieIcfgContainer [2025-03-08 15:14:35,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:14:35,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:14:35,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:14:35,998 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:14:35,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:35" (3/4) ... [2025-03-08 15:14:36,000 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:14:36,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:14:36,001 INFO L158 Benchmark]: Toolchain (without parser) took 1302.38ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 58.2MB in the end (delta: 64.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 15:14:36,002 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:14:36,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.80ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 111.1MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:14:36,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.15ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:14:36,003 INFO L158 Benchmark]: Boogie Preprocessor took 27.25ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:14:36,003 INFO L158 Benchmark]: IcfgBuilder took 244.46ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 96.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:14:36,003 INFO L158 Benchmark]: TraceAbstraction took 800.51ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 58.7MB in the end (delta: 37.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 15:14:36,004 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 167.8MB. Free memory was 58.7MB in the beginning and 58.2MB in the end (delta: 462.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:14:36,006 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.13ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.80ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 111.1MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.15ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.25ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 244.46ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 96.1MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 800.51ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 58.7MB in the end (delta: 37.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 167.8MB. Free memory was 58.7MB in the beginning and 58.2MB in the end (delta: 462.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.75; [L23] double var_1_5 = 2.05; [L24] double var_1_6 = 9.375; [L25] double var_1_7 = 64.4; [L26] double var_1_8 = 10000.25; [L27] signed short int var_1_9 = -2; [L28] signed short int var_1_10 = 0; [L29] unsigned short int var_1_11 = 4; [L30] unsigned short int var_1_12 = 128; VAL [isInitial=0, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_5=41/20, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L63] isInitial = 1 [L64] FCALL initially() [L65] COND TRUE 1 [L66] FCALL updateLastVariables() [L67] CALL updateVariables() [L43] var_1_5 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L44] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L45] var_1_6 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L46] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L47] var_1_7 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L48] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L49] var_1_10 = __VERIFIER_nondet_short() [L50] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L50] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L51] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L51] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L52] var_1_12 = __VERIFIER_nondet_ushort() [L53] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L53] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L54] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L54] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L67] RET updateVariables() [L68] CALL step() [L34] var_1_8 = var_1_5 [L35] var_1_9 = var_1_10 [L36] var_1_11 = var_1_12 [L37] signed short int stepLocal_0 = var_1_9; VAL [isInitial=1, stepLocal_0=50, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_1=67/4, var_1_5=65539, var_1_8=65539, var_1_9=50] [L38] COND TRUE stepLocal_0 <= (var_1_11 + ((((50) > (var_1_9)) ? (50) : (var_1_9)))) [L39] var_1_1 = ((var_1_5 + var_1_6) + var_1_7) VAL [isInitial=1, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=50] [L68] RET step() [L69] CALL, EXPR property() [L59-L60] return ((((var_1_9 <= (var_1_11 + ((((50) > (var_1_9)) ? (50) : (var_1_9))))) ? (var_1_1 == ((double) ((var_1_5 + var_1_6) + var_1_7))) : 1) && (var_1_8 == ((double) var_1_5))) && (var_1_9 == ((signed short int) var_1_10))) && (var_1_11 == ((unsigned short int) var_1_12)) ; VAL [\result=0, isInitial=1, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=50] [L69] RET, EXPR property() [L69] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=50] [L19] reach_error() VAL [isInitial=1, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 47 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 7, 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, 35 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, 35 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 136 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 156/168 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-08 15:14:36,020 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-14.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 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:14:37,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:14:37,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:14:37,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:14:37,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:14:37,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:14:37,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:14:37,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:14:37,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:14:37,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:14:37,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:14:37,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:14:37,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:14:37,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:14:37,987 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:14:37,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:14:37,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:14:37,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:14:37,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:14:37,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:14:37,990 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 -> 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc [2025-03-08 15:14:38,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:14:38,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:14:38,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:14:38,294 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:14:38,295 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:14:38,295 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-14.i [2025-03-08 15:14:39,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf2c49bc/c0d4c165736649dab5837edfa51c6e73/FLAG6cdbb270c [2025-03-08 15:14:39,658 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:14:39,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2025-03-08 15:14:39,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf2c49bc/c0d4c165736649dab5837edfa51c6e73/FLAG6cdbb270c [2025-03-08 15:14:39,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf2c49bc/c0d4c165736649dab5837edfa51c6e73 [2025-03-08 15:14:39,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:14:39,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:14:39,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:14:39,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:14:39,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:14:39,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c2f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39, skipping insertion in model container [2025-03-08 15:14:39,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:14:39,813 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-14.i[915,928] [2025-03-08 15:14:39,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:14:39,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:14:39,863 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-14.i[915,928] [2025-03-08 15:14:39,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:14:39,892 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:14:39,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39 WrapperNode [2025-03-08 15:14:39,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:14:39,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:14:39,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:14:39,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:14:39,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,927 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2025-03-08 15:14:39,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:14:39,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:14:39,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:14:39,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:14:39,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,949 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-08 15:14:39,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:14:39,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:14:39,968 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:14:39,968 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:14:39,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (1/1) ... [2025-03-08 15:14:39,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:14:39,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:14:39,995 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-08 15:14:39,999 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-08 15:14:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:14:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:14:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:14:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:14:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:14:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:14:40,074 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:14:40,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:14:41,476 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:14:41,476 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:14:41,482 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:14:41,484 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:14:41,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:41 BoogieIcfgContainer [2025-03-08 15:14:41,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:14:41,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:14:41,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:14:41,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:14:41,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:14:39" (1/3) ... [2025-03-08 15:14:41,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402932c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:14:41, skipping insertion in model container [2025-03-08 15:14:41,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:39" (2/3) ... [2025-03-08 15:14:41,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402932c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:14:41, skipping insertion in model container [2025-03-08 15:14:41,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:41" (3/3) ... [2025-03-08 15:14:41,491 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-14.i [2025-03-08 15:14:41,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:14:41,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-14.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:14:41,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:14:41,562 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;@1f33d24f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:14:41,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:14:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 15:14:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 15:14:41,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:14:41,574 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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-08 15:14:41,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:14:41,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:14:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1194608137, now seen corresponding path program 1 times [2025-03-08 15:14:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:14:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742790097] [2025-03-08 15:14:41,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:14:41,588 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-08 15:14:41,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:14:41,591 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-08 15:14:41,593 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-08 15:14:41,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 15:14:41,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 15:14:41,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:14:41,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:14:41,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:14:41,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:14:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 15:14:41,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:14:41,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:14:41,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742790097] [2025-03-08 15:14:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742790097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:14:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:14:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:14:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64690570] [2025-03-08 15:14:41,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:14:41,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:14:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:14:41,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:14:41,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:14:41,878 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 15:14:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:14:41,890 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2025-03-08 15:14:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:14:41,891 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-03-08 15:14:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:14:41,895 INFO L225 Difference]: With dead ends: 56 [2025-03-08 15:14:41,895 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 15:14:41,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 49 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-08 15:14:41,898 INFO L435 NwaCegarLoop]: 35 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, 35 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-08 15:14:41,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:14:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 15:14:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 15:14:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 15:14:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-08 15:14:41,922 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 50 [2025-03-08 15:14:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:14:41,922 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-08 15:14:41,922 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 15:14:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-08 15:14:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 15:14:41,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:14:41,925 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 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-08 15:14:41,933 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-08 15:14:42,126 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-08 15:14:42,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:14:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:14:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1466818438, now seen corresponding path program 1 times [2025-03-08 15:14:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:14:42,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747759366] [2025-03-08 15:14:42,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:14:42,128 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-08 15:14:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:14:42,130 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-08 15:14:42,131 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-08 15:14:42,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 15:14:42,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 15:14:42,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:14:42,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:14:42,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 15:14:42,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:15:29,217 WARN L286 SmtUtils]: Spent 14.55s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 15:15:35,946 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:15:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 15:15:53,403 INFO L312 TraceCheckSpWp]: Computing backward predicates...