./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-80.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_amount25_file-80.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 3b9255af2b89e5121a8e3b923a80f84c6451b8aee72c6e55e4e1516263a2f75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:26:43,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:26:43,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:26:43,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:26:43,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:26:43,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:26:43,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:26:43,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:26:43,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:26:43,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:26:43,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:26:43,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:26:43,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:26:43,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:26:43,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:26:43,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:26:43,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:26:43,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:26:43,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:26:43,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:26:43,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:26:43,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:43,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:26:43,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:26:43,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:26:43,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:26:43,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:26:43,267 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 -> 3b9255af2b89e5121a8e3b923a80f84c6451b8aee72c6e55e4e1516263a2f75b [2025-03-04 00:26:43,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:26:43,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:26:43,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:26:43,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:26:43,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:26:43,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-80.i [2025-03-04 00:26:44,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d9fb170/dcf5733e73444654861e80103b933fe1/FLAG675a5ed1c [2025-03-04 00:26:44,968 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:26:44,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-80.i [2025-03-04 00:26:44,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d9fb170/dcf5733e73444654861e80103b933fe1/FLAG675a5ed1c [2025-03-04 00:26:44,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d9fb170/dcf5733e73444654861e80103b933fe1 [2025-03-04 00:26:44,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:26:44,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:26:45,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:45,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:26:45,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:26:45,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:44" (1/1) ... [2025-03-04 00:26:45,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0a8f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45, skipping insertion in model container [2025-03-04 00:26:45,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:44" (1/1) ... [2025-03-04 00:26:45,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:26:45,129 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_amount25_file-80.i[915,928] [2025-03-04 00:26:45,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:45,186 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:26:45,194 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_amount25_file-80.i[915,928] [2025-03-04 00:26:45,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:45,235 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:26:45,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45 WrapperNode [2025-03-04 00:26:45,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:45,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:45,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:26:45,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:26:45,241 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:26:45" (1/1) ... [2025-03-04 00:26:45,246 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:26:45" (1/1) ... [2025-03-04 00:26:45,264 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-03-04 00:26:45,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:45,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:26:45,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:26:45,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:26:45,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,289 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:26:45,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:26:45,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:26:45,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:26:45,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:26:45,305 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (1/1) ... [2025-03-04 00:26:45,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:45,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:45,339 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:26:45,343 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:26:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:26:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:26:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:26:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:26:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:26:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:26:45,420 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:26:45,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:26:45,582 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:26:45,582 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:26:45,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:26:45,593 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:26:45,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:45 BoogieIcfgContainer [2025-03-04 00:26:45,593 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:26:45,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:26:45,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:26:45,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:26:45,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:26:44" (1/3) ... [2025-03-04 00:26:45,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ef4312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:45, skipping insertion in model container [2025-03-04 00:26:45,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:45" (2/3) ... [2025-03-04 00:26:45,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ef4312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:45, skipping insertion in model container [2025-03-04 00:26:45,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:45" (3/3) ... [2025-03-04 00:26:45,603 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-80.i [2025-03-04 00:26:45,613 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:26:45,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-80.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:26:45,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:26:45,671 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;@8862723, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:26:45,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:26:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 00:26:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 00:26:45,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:45,686 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:45,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:45,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash 422695043, now seen corresponding path program 1 times [2025-03-04 00:26:45,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:26:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575264616] [2025-03-04 00:26:45,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:26:45,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 00:26:45,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 00:26:45,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:45,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-04 00:26:45,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:26:45,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575264616] [2025-03-04 00:26:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575264616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:26:45,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121463183] [2025-03-04 00:26:45,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:45,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:26:45,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:45,947 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:26:45,950 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:26:46,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 00:26:46,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 00:26:46,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:46,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:46,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:26:46,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-04 00:26:46,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:26:46,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121463183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:46,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:26:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:26:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535931203] [2025-03-04 00:26:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:46,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:26:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:26:46,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:26:46,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:46,140 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 00:26:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:46,162 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2025-03-04 00:26:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:26:46,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-03-04 00:26:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:46,169 INFO L225 Difference]: With dead ends: 112 [2025-03-04 00:26:46,170 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 00:26:46,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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:26:46,175 INFO L435 NwaCegarLoop]: 83 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, 83 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:26:46,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:26:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 00:26:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 00:26:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 00:26:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-04 00:26:46,212 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 135 [2025-03-04 00:26:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:46,213 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-04 00:26:46,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 00:26:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-04 00:26:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 00:26:46,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:46,216 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:46,228 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-04 00:26:46,417 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:26:46,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:46,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash -609238335, now seen corresponding path program 1 times [2025-03-04 00:26:46,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:26:46,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459205240] [2025-03-04 00:26:46,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:26:46,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 00:26:46,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 00:26:46,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:46,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:26:46,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120032283] [2025-03-04 00:26:46,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:46,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:26:46,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:46,553 INFO L229 MonitoredProcess]: Starting monitored process 3 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:26:46,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:26:46,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 00:26:46,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 00:26:46,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:46,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:26:46,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:26:46,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 00:26:46,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 00:26:46,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:46,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:26:46,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:26:46,745 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:26:46,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:26:46,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:26:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 00:26:46,950 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:26:47,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:26:47,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:26:47 BoogieIcfgContainer [2025-03-04 00:26:47,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:26:47,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:26:47,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:26:47,053 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:26:47,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:45" (3/4) ... [2025-03-04 00:26:47,055 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:26:47,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:26:47,057 INFO L158 Benchmark]: Toolchain (without parser) took 2057.88ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 151.4MB in the end (delta: 7.9MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2025-03-04 00:26:47,057 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:26:47,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.65ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 146.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:26:47,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.05ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 144.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:26:47,059 INFO L158 Benchmark]: Boogie Preprocessor took 37.45ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 143.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:26:47,059 INFO L158 Benchmark]: IcfgBuilder took 289.23ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 126.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:26:47,059 INFO L158 Benchmark]: TraceAbstraction took 1455.94ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 151.4MB in the end (delta: -25.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2025-03-04 00:26:47,059 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 201.3MB. Free memory was 151.4MB in the beginning and 151.4MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:26:47,061 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.53ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.65ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 146.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.05ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 144.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.45ms. Allocated memory is still 201.3MB. Free memory was 144.7MB in the beginning and 143.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 289.23ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 126.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1455.94ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 151.4MB in the end (delta: -25.2MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 201.3MB. Free memory was 151.4MB in the beginning and 151.4MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 256; [L23] signed long int var_1_2 = -128; [L24] signed long int var_1_3 = 8; [L25] signed long int var_1_4 = 0; [L26] signed long int var_1_5 = 8; [L27] signed long int var_1_6 = 10; [L28] signed long int var_1_7 = 5; [L29] signed long int var_1_8 = 128; [L30] signed short int var_1_9 = 128; [L31] float var_1_10 = 64.4; [L32] float var_1_11 = 10.25; [L33] double var_1_12 = 63.175; [L34] unsigned char var_1_13 = 1; [L35] double var_1_14 = 128.5; [L36] double var_1_15 = 128.8; VAL [isInitial=0, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=-128, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L66] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L67] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L67] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L68] var_1_3 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_3 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L69] RET assume_abort_if_not(var_1_3 >= -1) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L70] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L70] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L71] var_1_4 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L73] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L73] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=8, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L74] var_1_5 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L75] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L76] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L76] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=5, var_1_8=128, var_1_9=128] [L77] var_1_6 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L79] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L79] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=128, var_1_9=128] [L80] var_1_7 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L81] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L82] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L82] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=128, var_1_9=128] [L83] var_1_8 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L84] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L85] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L85] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L86] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L86] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=128] [L87] var_1_9 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_9 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L88] RET assume_abort_if_not(var_1_9 >= -32767) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L89] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L89] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=322/5, var_1_11=41/4, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L90] var_1_11 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L91] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L92] var_1_13 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L93] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L94] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L94] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_14=257/2, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L95] var_1_14 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L96] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_15=644/5, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L97] var_1_15 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L98] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L111] RET updateVariables() [L112] CALL step() [L40] COND TRUE (((((var_1_3 - var_1_4)) > (var_1_2)) ? ((var_1_3 - var_1_4)) : (var_1_2))) <= (((((var_1_5 - var_1_6)) < ((var_1_7 % var_1_8))) ? ((var_1_5 - var_1_6)) : ((var_1_7 % var_1_8)))) [L41] var_1_1 = var_1_9 VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L43] COND FALSE !(var_1_8 > var_1_1) VAL [isInitial=1, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L48] signed long int stepLocal_1 = var_1_5; [L49] signed short int stepLocal_0 = var_1_1; VAL [isInitial=1, stepLocal_0=2, stepLocal_1=0, var_1_10=322/5, var_1_12=2527/40, var_1_13=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L50] COND FALSE !(stepLocal_0 <= var_1_8) [L61] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_1=0, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return ((((((((var_1_3 - var_1_4)) > (var_1_2)) ? ((var_1_3 - var_1_4)) : (var_1_2))) <= (((((var_1_5 - var_1_6)) < ((var_1_7 % var_1_8))) ? ((var_1_5 - var_1_6)) : ((var_1_7 % var_1_8))))) ? (var_1_1 == ((signed short int) var_1_9)) : 1) && ((var_1_8 > var_1_1) ? ((var_1_1 == var_1_4) ? (var_1_10 == ((float) var_1_11)) : 1) : 1)) && ((var_1_1 <= var_1_8) ? ((var_1_5 != -64) ? (var_1_13 ? (var_1_12 == ((double) ((((var_1_14 - var_1_15) < 0 ) ? -(var_1_14 - var_1_15) : (var_1_14 - var_1_15))))) : (var_1_12 == ((double) (var_1_15 - var_1_14)))) : (var_1_12 == ((double) 32.8))) : (var_1_12 == ((double) var_1_11))) ; VAL [\result=0, isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=322/5, var_1_11=2, var_1_12=2, var_1_13=1, var_1_1=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 83 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, 83 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 540 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1806/1848 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:26:47,078 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_amount25_file-80.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 3b9255af2b89e5121a8e3b923a80f84c6451b8aee72c6e55e4e1516263a2f75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:26:48,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:26:49,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:26:49,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:26:49,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:26:49,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:26:49,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:26:49,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:26:49,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:26:49,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:26:49,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:26:49,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:26:49,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:26:49,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:26:49,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:26:49,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:26:49,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:26:49,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:26:49,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:26:49,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:26:49,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:26:49,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:26:49,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:26:49,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:26:49,056 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:26:49,056 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:26:49,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:49,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:26:49,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:26:49,057 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 -> 3b9255af2b89e5121a8e3b923a80f84c6451b8aee72c6e55e4e1516263a2f75b [2025-03-04 00:26:49,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:26:49,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:26:49,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:26:49,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:26:49,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:26:49,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-80.i [2025-03-04 00:26:50,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374eabb49/bffea12cc4a741d2b60876ad08796c6e/FLAG9455a1cd2 [2025-03-04 00:26:50,689 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:26:50,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-80.i [2025-03-04 00:26:50,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374eabb49/bffea12cc4a741d2b60876ad08796c6e/FLAG9455a1cd2 [2025-03-04 00:26:51,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374eabb49/bffea12cc4a741d2b60876ad08796c6e [2025-03-04 00:26:51,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:26:51,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:26:51,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:51,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:26:51,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:26:51,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16936fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51, skipping insertion in model container [2025-03-04 00:26:51,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:26:51,132 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_amount25_file-80.i[915,928] [2025-03-04 00:26:51,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:51,179 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:26:51,189 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_amount25_file-80.i[915,928] [2025-03-04 00:26:51,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:51,220 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:26:51,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51 WrapperNode [2025-03-04 00:26:51,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:51,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:51,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:26:51,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:26:51,227 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:26:51" (1/1) ... [2025-03-04 00:26:51,238 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:26:51" (1/1) ... [2025-03-04 00:26:51,260 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-04 00:26:51,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:51,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:26:51,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:26:51,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:26:51,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,284 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:26:51,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:26:51,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:26:51,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:26:51,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:26:51,305 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (1/1) ... [2025-03-04 00:26:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:51,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:51,340 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:26:51,345 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:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:26:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:26:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:26:51,418 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:26:51,420 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:26:52,777 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:26:52,778 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:26:52,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:26:52,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:26:52,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:52 BoogieIcfgContainer [2025-03-04 00:26:52,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:26:52,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:26:52,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:26:52,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:26:52,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:26:51" (1/3) ... [2025-03-04 00:26:52,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a53f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:52, skipping insertion in model container [2025-03-04 00:26:52,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:51" (2/3) ... [2025-03-04 00:26:52,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a53f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:52, skipping insertion in model container [2025-03-04 00:26:52,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:52" (3/3) ... [2025-03-04 00:26:52,793 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-80.i [2025-03-04 00:26:52,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:26:52,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-80.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:26:52,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:26:52,847 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;@457425db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:26:52,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:26:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 00:26:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 00:26:52,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:52,859 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:52,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:52,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 422695043, now seen corresponding path program 1 times [2025-03-04 00:26:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451596435] [2025-03-04 00:26:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:52,870 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:26:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:52,872 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:26:52,874 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:26:52,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 00:26:53,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 00:26:53,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:53,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:26:53,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 00:26:53,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:26:53,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:26:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451596435] [2025-03-04 00:26:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451596435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:53,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:26:53,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:26:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150513327] [2025-03-04 00:26:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:53,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:26:53,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:26:53,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:26:53,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:53,235 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 00:26:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:53,255 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2025-03-04 00:26:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:26:53,257 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2025-03-04 00:26:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:53,263 INFO L225 Difference]: With dead ends: 112 [2025-03-04 00:26:53,263 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 00:26:53,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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:26:53,268 INFO L435 NwaCegarLoop]: 83 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, 83 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:26:53,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:26:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 00:26:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 00:26:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 00:26:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-04 00:26:53,302 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 135 [2025-03-04 00:26:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:53,303 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-04 00:26:53,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 00:26:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-04 00:26:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 00:26:53,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:53,307 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:53,322 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 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:26:53,508 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:26:53,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:53,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash -609238335, now seen corresponding path program 1 times [2025-03-04 00:26:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:53,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678798778] [2025-03-04 00:26:53,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:53,510 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:26:53,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:53,512 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:26:53,513 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:26:53,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 00:26:53,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 00:26:53,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:53,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:53,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:26:53,806 INFO L279 TraceCheckSpWp]: Computing forward predicates...