./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dcce0cb200f0b6b82254c63bdf1faa4faeaaad1e486287e1ff6c761f60d02606 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:18:53,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:18:53,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:18:53,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:18:53,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:18:53,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:18:53,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:18:53,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:18:53,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:18:53,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:18:53,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:18:53,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:18:53,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:18:53,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:18:53,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:18:53,621 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:18:53,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:18:53,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:18:53,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:18:53,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:18:53,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:18:53,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:53,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:18:53,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:18:53,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:18:53,623 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 -> dcce0cb200f0b6b82254c63bdf1faa4faeaaad1e486287e1ff6c761f60d02606 [2025-03-17 05:18:53,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:18:53,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:18:53,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:18:53,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:18:53,875 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:18:53,876 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-99.i [2025-03-17 05:18:55,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04265817/f24fc4435e6e40e998d8fb5be3fa46ea/FLAG1c41feb92 [2025-03-17 05:18:55,334 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:18:55,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i [2025-03-17 05:18:55,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04265817/f24fc4435e6e40e998d8fb5be3fa46ea/FLAG1c41feb92 [2025-03-17 05:18:55,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04265817/f24fc4435e6e40e998d8fb5be3fa46ea [2025-03-17 05:18:55,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:18:55,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:18:55,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:55,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:18:55,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:18:55,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3ad7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55, skipping insertion in model container [2025-03-17 05:18:55,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:18:55,791 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-99.i[913,926] [2025-03-17 05:18:55,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:55,841 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:18:55,849 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-99.i[913,926] [2025-03-17 05:18:55,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:55,876 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:18:55,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55 WrapperNode [2025-03-17 05:18:55,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:55,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:55,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:18:55,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:18:55,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,905 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-17 05:18:55,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:55,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:18:55,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:18:55,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:18:55,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,933 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:18:55,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:18:55,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:18:55,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:18:55,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:18:55,945 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (1/1) ... [2025-03-17 05:18:55,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:55,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:55,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:18:55,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:18:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:18:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:18:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:18:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:18:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:18:56,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:18:56,061 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:18:56,063 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:18:56,300 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:18:56,301 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:18:56,313 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:18:56,313 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:18:56,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:56 BoogieIcfgContainer [2025-03-17 05:18:56,314 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:18:56,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:18:56,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:18:56,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:18:56,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:18:55" (1/3) ... [2025-03-17 05:18:56,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f93dd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:56, skipping insertion in model container [2025-03-17 05:18:56,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:55" (2/3) ... [2025-03-17 05:18:56,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f93dd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:56, skipping insertion in model container [2025-03-17 05:18:56,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:56" (3/3) ... [2025-03-17 05:18:56,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-99.i [2025-03-17 05:18:56,333 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:18:56,335 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-99.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:18:56,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:18:56,398 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;@5765e44c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:18:56,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:18:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:18:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:18:56,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:56,411 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:18:56,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:56,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1621795739, now seen corresponding path program 1 times [2025-03-17 05:18:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202724843] [2025-03-17 05:18:56,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:56,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:18:56,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:18:56,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:56,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:18:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202724843] [2025-03-17 05:18:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202724843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:56,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97231352] [2025-03-17 05:18:56,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:56,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:56,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:56,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:18:56,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:18:56,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:18:56,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:18:56,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:56,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:56,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:18:56,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:18:56,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:18:56,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97231352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:56,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:18:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:18:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025987761] [2025-03-17 05:18:56,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:56,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:18:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:56,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:18:56,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:18:56,845 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:18:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:56,863 INFO L93 Difference]: Finished difference Result 97 states and 167 transitions. [2025-03-17 05:18:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:18:56,866 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2025-03-17 05:18:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:56,871 INFO L225 Difference]: With dead ends: 97 [2025-03-17 05:18:56,871 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 05:18:56,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:18:56,876 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:56,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:18:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 05:18:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 05:18:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:18:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-03-17 05:18:56,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 116 [2025-03-17 05:18:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:56,922 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-17 05:18:56,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:18:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-03-17 05:18:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:18:56,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:56,925 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:18:56,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:18:57,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:18:57,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash -353568614, now seen corresponding path program 1 times [2025-03-17 05:18:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031001993] [2025-03-17 05:18:57,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:57,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:18:57,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:18:57,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:57,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:18:57,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162225781] [2025-03-17 05:18:57,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:57,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:57,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:57,277 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-17 05:18:57,280 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-17 05:18:57,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:18:57,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:18:57,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:57,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:18:57,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:18:57,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:18:57,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:18:57,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:57,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:18:57,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:18:57,499 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:18:57,500 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:18:57,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:18:57,701 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-17 05:18:57,704 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 05:18:57,777 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:18:57,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:18:57 BoogieIcfgContainer [2025-03-17 05:18:57,780 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:18:57,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:18:57,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:18:57,782 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:18:57,783 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:56" (3/4) ... [2025-03-17 05:18:57,785 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:18:57,786 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:18:57,787 INFO L158 Benchmark]: Toolchain (without parser) took 2132.63ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 76.3MB in the end (delta: 33.8MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-03-17 05:18:57,787 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:57,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.85ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 97.6MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:18:57,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.59ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:18:57,789 INFO L158 Benchmark]: Boogie Preprocessor took 36.34ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:57,790 INFO L158 Benchmark]: IcfgBuilder took 370.75ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 77.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:18:57,790 INFO L158 Benchmark]: TraceAbstraction took 1464.40ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 76.3MB in the end (delta: 529.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:57,790 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 76.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:57,792 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.85ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 97.6MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.59ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.34ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 370.75ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 77.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1464.40ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 76.3MB in the end (delta: 529.1kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 76.3MB in the end (delta: 41.6kB). 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 69, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.5; [L23] unsigned char var_1_2 = 16; [L24] float var_1_4 = 1000000000000000.6; [L25] float var_1_5 = 500.5; [L26] float var_1_6 = 99999999999.5; [L27] unsigned char var_1_7 = 1; [L28] float var_1_8 = 127.25; [L29] float var_1_9 = 4.8; [L30] float var_1_10 = 0.4; [L31] signed long int var_1_11 = 0; [L32] signed long int var_1_12 = 256; [L33] signed long int var_1_13 = 25; [L34] signed long int var_1_14 = -5; [L35] signed short int var_1_15 = 2; [L36] signed long int var_1_16 = -50; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L67] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L67] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L68] var_1_4 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L69] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L70] var_1_5 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L71] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L72] var_1_6 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L73] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_8=509/4, var_1_9=24/5] [L75] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_8=509/4, var_1_9=24/5] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L77] var_1_8 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_9=24/5] [L78] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1, var_1_9=24/5] [L79] var_1_9 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L80] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L81] var_1_10 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L82] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L83] var_1_12 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L84] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L85] CALL assume_abort_if_not(var_1_12 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L85] RET assume_abort_if_not(var_1_12 <= 2147483646) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L86] var_1_13 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L88] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L88] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L89] var_1_15 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L90] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L91] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L91] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L92] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L92] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L93] var_1_16 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_16 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L94] RET assume_abort_if_not(var_1_16 >= -1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L95] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L95] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L108] RET updateVariables() [L109] CALL step() [L40] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); VAL [isInitial=1, stepLocal_0=8, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=-255, var_1_7=1] [L41] COND TRUE (((((200) < (128)) ? (200) : (128))) - var_1_2) > stepLocal_0 [L42] var_1_1 = (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6) VAL [isInitial=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_2=-255, var_1_7=1] [L48] COND TRUE (var_1_5 + var_1_6) == var_1_1 [L49] var_1_11 = (((((var_1_2) < (var_1_12)) ? (var_1_2) : (var_1_12))) - var_1_13) VAL [isInitial=1, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_2=-255, var_1_7=1] [L53] signed long int stepLocal_1 = var_1_12 % var_1_15; VAL [isInitial=1, stepLocal_1=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_2=-255, var_1_7=1] [L54] COND TRUE var_1_9 == var_1_4 [L55] var_1_14 = var_1_13 VAL [isInitial=1, stepLocal_1=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_2=-255, var_1_7=1] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return ((((((((200) < (128)) ? (200) : (128))) - var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (var_1_1 == ((float) (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6))) : (var_1_7 ? (var_1_1 == ((float) (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) + var_1_10))) : 1)) && (((var_1_5 + var_1_6) == var_1_1) ? (var_1_11 == ((signed long int) (((((var_1_2) < (var_1_12)) ? (var_1_2) : (var_1_12))) - var_1_13))) : (var_1_11 == ((signed long int) var_1_13)))) && ((var_1_9 == var_1_4) ? (var_1_14 == ((signed long int) var_1_13)) : (((var_1_12 % var_1_15) != var_1_13) ? (var_1_14 == ((signed long int) ((((((var_1_15 + var_1_2) + var_1_16)) > (var_1_13)) ? (((var_1_15 + var_1_2) + var_1_16)) : (var_1_13))))) : (var_1_14 == ((signed long int) var_1_16)))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_2=-255, var_1_7=1] [L19] reach_error() VAL [isInitial=1, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_2=-255, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 94 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 71 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, 71 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:18:57,812 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-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dcce0cb200f0b6b82254c63bdf1faa4faeaaad1e486287e1ff6c761f60d02606 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:19:00,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:19:00,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:19:00,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:19:00,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:19:00,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:19:00,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:19:00,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:19:00,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:19:00,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:19:00,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:19:00,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:19:00,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:19:00,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:19:00,188 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:19:00,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:19:00,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:19:00,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:19:00,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:19:00,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:19:00,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:19:00,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:19:00,191 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 -> dcce0cb200f0b6b82254c63bdf1faa4faeaaad1e486287e1ff6c761f60d02606 [2025-03-17 05:19:00,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:19:00,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:19:00,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:19:00,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:19:00,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:19:00,478 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-99.i [2025-03-17 05:19:01,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ebce5a3/93ec1a5665064bdd92642abd1580f0e4/FLAGdde13f938 [2025-03-17 05:19:01,994 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:19:01,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i [2025-03-17 05:19:02,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ebce5a3/93ec1a5665064bdd92642abd1580f0e4/FLAGdde13f938 [2025-03-17 05:19:02,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ebce5a3/93ec1a5665064bdd92642abd1580f0e4 [2025-03-17 05:19:02,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:19:02,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:19:02,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:19:02,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:19:02,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:19:02,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b31e58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02, skipping insertion in model container [2025-03-17 05:19:02,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:19:02,200 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-99.i[913,926] [2025-03-17 05:19:02,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:19:02,265 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:19:02,277 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-99.i[913,926] [2025-03-17 05:19:02,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:19:02,317 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:19:02,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02 WrapperNode [2025-03-17 05:19:02,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:19:02,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:19:02,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:19:02,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:19:02,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,364 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2025-03-17 05:19:02,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:19:02,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:19:02,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:19:02,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:19:02,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,386 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:19:02,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:19:02,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:19:02,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:19:02,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:19:02,409 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (1/1) ... [2025-03-17 05:19:02,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:19:02,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:19:02,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:19:02,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:19:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:19:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:19:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:19:02,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:19:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:19:02,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:19:02,540 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:19:02,543 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:19:03,643 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:19:03,644 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:19:03,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:19:03,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:19:03,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:19:03 BoogieIcfgContainer [2025-03-17 05:19:03,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:19:03,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:19:03,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:19:03,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:19:03,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:19:02" (1/3) ... [2025-03-17 05:19:03,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab10e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:19:03, skipping insertion in model container [2025-03-17 05:19:03,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:19:02" (2/3) ... [2025-03-17 05:19:03,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab10e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:19:03, skipping insertion in model container [2025-03-17 05:19:03,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:19:03" (3/3) ... [2025-03-17 05:19:03,663 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-99.i [2025-03-17 05:19:03,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:19:03,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-99.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:19:03,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:19:03,732 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;@2633917d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:19:03,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:19:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:19:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:19:03,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:19:03,747 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:19:03,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:19:03,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:19:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1621795739, now seen corresponding path program 1 times [2025-03-17 05:19:03,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:19:03,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134637265] [2025-03-17 05:19:03,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:19:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:19:03,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:19:03,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:19:03,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:19:04,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:19:04,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:04,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:04,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:19:04,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:19:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 05:19:04,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:19:04,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:19:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134637265] [2025-03-17 05:19:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134637265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:19:04,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:19:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:19:04,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040457415] [2025-03-17 05:19:04,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:19:04,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:19:04,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:19:04,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:19:04,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:19:04,187 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:19:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:19:04,220 INFO L93 Difference]: Finished difference Result 97 states and 167 transitions. [2025-03-17 05:19:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:19:04,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2025-03-17 05:19:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:19:04,226 INFO L225 Difference]: With dead ends: 97 [2025-03-17 05:19:04,227 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 05:19:04,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:19:04,232 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:19:04,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:19:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 05:19:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 05:19:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:19:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-03-17 05:19:04,268 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 116 [2025-03-17 05:19:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:19:04,268 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-17 05:19:04,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:19:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-03-17 05:19:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:19:04,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:19:04,272 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:19:04,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:19:04,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:19:04,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:19:04,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:19:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash -353568614, now seen corresponding path program 1 times [2025-03-17 05:19:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:19:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397843541] [2025-03-17 05:19:04,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:04,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:19:04,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:19:04,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:19:04,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:19:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:19:04,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:19:04,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:04,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:04,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:19:04,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:19:37,722 WARN L286 SmtUtils]: Spent 12.69s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 05:20:23,548 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)