./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.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_variablewrapping_normal_file-44.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 aec522a001bf0e9fb0f40f6360c658e1c731a2587b5c1a4673bd9d4da5f9ca0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:54:50,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:54:50,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:54:50,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:54:50,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:54:50,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:54:50,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:54:50,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:54:50,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:54:50,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:54:50,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:54:50,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:54:50,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:54:50,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:54:50,145 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:54:50,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:54:50,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:54:50,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:54:50,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:54:50,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:54:50,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:54:50,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:54:50,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:54:50,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:54:50,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:54:50,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:54:50,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:54:50,147 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 -> aec522a001bf0e9fb0f40f6360c658e1c731a2587b5c1a4673bd9d4da5f9ca0b [2025-03-04 00:54:50,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:54:50,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:54:50,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:54:50,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:54:50,364 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:54:50,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i [2025-03-04 00:54:51,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05548f6bf/81d9399e4e0443728bdbc583d9944e9e/FLAG5f38520e2 [2025-03-04 00:54:51,738 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:54:51,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i [2025-03-04 00:54:51,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05548f6bf/81d9399e4e0443728bdbc583d9944e9e/FLAG5f38520e2 [2025-03-04 00:54:52,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05548f6bf/81d9399e4e0443728bdbc583d9944e9e [2025-03-04 00:54:52,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:54:52,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:54:52,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:54:52,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:54:52,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:54:52,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498df761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52, skipping insertion in model container [2025-03-04 00:54:52,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:54:52,160 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_variablewrapping_normal_file-44.i[913,926] [2025-03-04 00:54:52,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:54:52,204 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:54:52,214 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_variablewrapping_normal_file-44.i[913,926] [2025-03-04 00:54:52,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:54:52,251 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:54:52,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52 WrapperNode [2025-03-04 00:54:52,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:54:52,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:54:52,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:54:52,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:54:52,258 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:54:52" (1/1) ... [2025-03-04 00:54:52,264 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:54:52" (1/1) ... [2025-03-04 00:54:52,296 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-04 00:54:52,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:54:52,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:54:52,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:54:52,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:54:52,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,323 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:54:52,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:54:52,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:54:52,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:54:52,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:54:52,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (1/1) ... [2025-03-04 00:54:52,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:54:52,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:54:52,374 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:54:52,378 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:54:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:54:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:54:52,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:54:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:54:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:54:52,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:54:52,446 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:54:52,448 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:54:52,630 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 00:54:52,633 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:54:52,640 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:54:52,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:54:52,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:52 BoogieIcfgContainer [2025-03-04 00:54:52,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:54:52,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:54:52,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:54:52,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:54:52,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:54:52" (1/3) ... [2025-03-04 00:54:52,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dffd688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:52, skipping insertion in model container [2025-03-04 00:54:52,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:52" (2/3) ... [2025-03-04 00:54:52,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dffd688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:52, skipping insertion in model container [2025-03-04 00:54:52,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:52" (3/3) ... [2025-03-04 00:54:52,648 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-44.i [2025-03-04 00:54:52,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:54:52,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-44.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:54:52,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:54:52,702 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;@65c1d6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:54:52,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:54:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:54:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:54:52,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:52,712 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:52,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:52,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1029683354, now seen corresponding path program 1 times [2025-03-04 00:54:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:54:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224834339] [2025-03-04 00:54:52,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:54:52,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:54:52,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:54:52,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:52,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 00:54:52,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:54:52,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224834339] [2025-03-04 00:54:52,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224834339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:54:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741532186] [2025-03-04 00:54:52,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:52,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:54:52,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:54:52,938 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:54:52,940 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:54:53,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:54:53,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:54:53,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:53,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:53,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:54:53,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:54:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 00:54:53,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:54:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741532186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:54:53,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:54:53,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:54:53,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814372087] [2025-03-04 00:54:53,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:54:53,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:54:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:54:53,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:54:53,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:54:53,119 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 00:54:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:54:53,134 INFO L93 Difference]: Finished difference Result 110 states and 188 transitions. [2025-03-04 00:54:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:54:53,136 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-03-04 00:54:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:54:53,140 INFO L225 Difference]: With dead ends: 110 [2025-03-04 00:54:53,140 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 00:54:53,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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:54:53,145 INFO L435 NwaCegarLoop]: 81 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, 81 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:54:53,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:54:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 00:54:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 00:54:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:54:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-04 00:54:53,172 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 130 [2025-03-04 00:54:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:54:53,172 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-04 00:54:53,173 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 00:54:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-04 00:54:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:54:53,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:53,176 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:53,183 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:54:53,376 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:54:53,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:53,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1054092379, now seen corresponding path program 1 times [2025-03-04 00:54:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:54:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926375653] [2025-03-04 00:54:53,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:54:53,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:54:53,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:54:53,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:53,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:54:53,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483098198] [2025-03-04 00:54:53,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:53,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:54:53,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:54:53,514 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:54:53,527 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:54:53,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:54:53,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:54:53,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:53,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:54:53,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:54:53,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:54:53,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:54:53,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:53,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:54:53,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:54:53,711 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:54:53,712 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:54:53,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:54:53,913 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:54:53,916 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:54:53,982 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:54:53,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:54:53 BoogieIcfgContainer [2025-03-04 00:54:53,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:54:53,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:54:53,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:54:53,987 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:54:53,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:52" (3/4) ... [2025-03-04 00:54:53,989 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:54:53,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:54:53,991 INFO L158 Benchmark]: Toolchain (without parser) took 1931.87ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 93.7MB in the end (delta: 28.3MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-03-04 00:54:53,991 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:54:53,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.12ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:54:53,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.81ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 106.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:54:53,993 INFO L158 Benchmark]: Boogie Preprocessor took 40.74ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:54:53,993 INFO L158 Benchmark]: IcfgBuilder took 297.61ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 86.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:54:53,994 INFO L158 Benchmark]: TraceAbstraction took 1343.69ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 93.7MB in the end (delta: -7.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:54:53,994 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 93.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:54:53,995 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.22ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.12ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 109.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.81ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 106.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.74ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 297.61ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 86.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1343.69ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 93.7MB in the end (delta: -7.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 93.7MB in the end (delta: 33.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 97, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] signed char var_1_3 = -25; [L24] signed char var_1_4 = -64; [L25] signed char var_1_5 = -1; [L26] signed char var_1_6 = 50; [L27] unsigned char var_1_7 = 1; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 10.5; [L32] unsigned char var_1_15 = 0; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 50.75; [L36] float var_1_19 = 32.6; VAL [isInitial=0, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=-25, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L66] var_1_3 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L67] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L68] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L68] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=-64, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L69] var_1_4 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L70] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L71] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=1, var_1_8=0] [L72] var_1_5 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L73] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L74] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=50, var_1_7=1, var_1_8=0] [L75] var_1_6 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L77] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L78] var_1_7 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L79] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L80] CALL assume_abort_if_not(var_1_7 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L80] RET assume_abort_if_not(var_1_7 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=0] [L81] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L81] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L83] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=21/2, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L86] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L87] var_1_15 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L88] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L89] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L91] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L92] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L94] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L95] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L95] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_19=163/5, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L96] var_1_19 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L97] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L110] RET updateVariables() [L111] CALL step() [L40] signed long int stepLocal_1 = ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) / var_1_7; [L41] signed long int stepLocal_0 = var_1_5 - var_1_6; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=32, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L42] COND FALSE !(var_1_4 > stepLocal_0) [L47] var_1_1 = var_1_3 VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=203/4, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L49] var_1_18 = var_1_19 VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L50] COND TRUE (var_1_12 - ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) >= var_1_18 [L51] var_1_11 = (((var_1_6 < var_1_1) && var_1_15) || (var_1_16 || var_1_17)) VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L53] signed long int stepLocal_3 = var_1_1; [L54] signed long int stepLocal_2 = var_1_1 * (var_1_1 * var_1_6); VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L55] COND FALSE !(\read(var_1_11)) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_4 > (var_1_5 - var_1_6)) ? (((((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))) / var_1_7) <= var_1_6) ? (var_1_1 == ((signed long int) var_1_7)) : 1) : (var_1_1 == ((signed long int) var_1_3))) && (var_1_11 ? ((var_1_1 > var_1_1) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (((var_1_1 % var_1_7) < (var_1_1 * (var_1_1 * var_1_6))) ? (var_1_8 == ((unsigned char) var_1_10)) : 1)) : 1)) && (((var_1_12 - ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) >= var_1_18) ? (var_1_11 == ((unsigned char) (((var_1_6 < var_1_1) && var_1_15) || (var_1_16 || var_1_17)))) : 1)) && (var_1_18 == ((float) var_1_19)) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=2, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 81 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, 81 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1640/1680 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:54:54,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_variablewrapping_normal_file-44.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 aec522a001bf0e9fb0f40f6360c658e1c731a2587b5c1a4673bd9d4da5f9ca0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:54:55,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:54:55,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:54:55,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:54:55,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:54:55,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:54:55,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:54:55,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:54:55,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:54:55,890 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:54:55,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:54:55,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:54:55,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:54:55,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:54:55,892 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:54:55,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:54:55,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:54:55,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:54:55,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:54:55,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:54:55,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:54:55,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:54:55,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:54:55,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:54:55,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:54:55,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:54:55,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:54:55,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:54:55,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:54:55,896 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 -> aec522a001bf0e9fb0f40f6360c658e1c731a2587b5c1a4673bd9d4da5f9ca0b [2025-03-04 00:54:56,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:54:56,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:54:56,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:54:56,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:54:56,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:54:56,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i [2025-03-04 00:54:57,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516d23d4a/5739b52fbb2b44d3ad1c672758988986/FLAG2a029d39a [2025-03-04 00:54:57,486 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:54:57,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-44.i [2025-03-04 00:54:57,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516d23d4a/5739b52fbb2b44d3ad1c672758988986/FLAG2a029d39a [2025-03-04 00:54:57,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516d23d4a/5739b52fbb2b44d3ad1c672758988986 [2025-03-04 00:54:57,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:54:57,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:54:57,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:54:57,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:54:57,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:54:57,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23995f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57, skipping insertion in model container [2025-03-04 00:54:57,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:54:57,645 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_variablewrapping_normal_file-44.i[913,926] [2025-03-04 00:54:57,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:54:57,703 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:54:57,711 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_variablewrapping_normal_file-44.i[913,926] [2025-03-04 00:54:57,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:54:57,737 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:54:57,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57 WrapperNode [2025-03-04 00:54:57,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:54:57,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:54:57,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:54:57,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:54:57,743 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:54:57" (1/1) ... [2025-03-04 00:54:57,749 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:54:57" (1/1) ... [2025-03-04 00:54:57,768 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-04 00:54:57,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:54:57,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:54:57,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:54:57,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:54:57,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,792 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:54:57,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:54:57,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:54:57,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:54:57,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:54:57,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (1/1) ... [2025-03-04 00:54:57,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:54:57,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:54:57,845 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:54:57,851 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:54:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:54:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:54:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:54:57,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:54:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:54:57,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:54:57,923 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:54:57,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:54:59,599 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 00:54:59,599 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:54:59,606 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:54:59,607 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:54:59,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:59 BoogieIcfgContainer [2025-03-04 00:54:59,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:54:59,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:54:59,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:54:59,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:54:59,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:54:57" (1/3) ... [2025-03-04 00:54:59,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39aebd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:59, skipping insertion in model container [2025-03-04 00:54:59,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:54:57" (2/3) ... [2025-03-04 00:54:59,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39aebd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:59, skipping insertion in model container [2025-03-04 00:54:59,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:59" (3/3) ... [2025-03-04 00:54:59,616 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-44.i [2025-03-04 00:54:59,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:54:59,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-44.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:54:59,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:54:59,673 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;@7bf361c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:54:59,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:54:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:54:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:54:59,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:59,683 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:59,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:59,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:59,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1029683354, now seen corresponding path program 1 times [2025-03-04 00:54:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:54:59,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50493692] [2025-03-04 00:54:59,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:59,695 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:54:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:54:59,699 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:54:59,701 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:54:59,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:54:59,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:54:59,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:59,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:59,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:54:59,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:54:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-04 00:54:59,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:54:59,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:54:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50493692] [2025-03-04 00:54:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50493692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:54:59,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:54:59,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:54:59,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566250180] [2025-03-04 00:54:59,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:54:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:54:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:54:59,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:54:59,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:54:59,998 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 00:55:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:00,013 INFO L93 Difference]: Finished difference Result 110 states and 188 transitions. [2025-03-04 00:55:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:55:00,014 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 130 [2025-03-04 00:55:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:00,018 INFO L225 Difference]: With dead ends: 110 [2025-03-04 00:55:00,018 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 00:55:00,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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:55:00,023 INFO L435 NwaCegarLoop]: 81 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, 81 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:55:00,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:55:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 00:55:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 00:55:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:55:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-04 00:55:00,055 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 130 [2025-03-04 00:55:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:00,055 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-04 00:55:00,055 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 00:55:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-04 00:55:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 00:55:00,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:00,057 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:00,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:55:00,258 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:55:00,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:00,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1054092379, now seen corresponding path program 1 times [2025-03-04 00:55:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:55:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971174943] [2025-03-04 00:55:00,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:00,260 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:55:00,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:55:00,262 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:55:00,263 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:55:00,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 00:55:00,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 00:55:00,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:00,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 00:55:00,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:28,678 WARN L286 SmtUtils]: Spent 26.31s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)