./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.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 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:50:23,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:50:23,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:50:23,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:50:23,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:50:23,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:50:23,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:50:23,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:50:23,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:50:23,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:50:23,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:50:23,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:50:23,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:50:23,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:50:23,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:50:23,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:50:23,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:50:23,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:50:23,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:50:23,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:50:23,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:50:23,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:50:23,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:50:23,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:50:23,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:50:23,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:50:23,814 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 -> 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf [2025-03-04 00:50:24,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:50:24,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:50:24,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:50:24,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:50:24,031 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:50:24,031 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-10.i [2025-03-04 00:50:25,140 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9e44510/bdf566dfde3d43a3b65bd21c8cc73f7a/FLAG1f1b05fa2 [2025-03-04 00:50:25,404 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:50:25,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i [2025-03-04 00:50:25,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9e44510/bdf566dfde3d43a3b65bd21c8cc73f7a/FLAG1f1b05fa2 [2025-03-04 00:50:25,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9e44510/bdf566dfde3d43a3b65bd21c8cc73f7a [2025-03-04 00:50:25,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:50:25,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:50:25,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:50:25,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:50:25,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:50:25,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ab434f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25, skipping insertion in model container [2025-03-04 00:50:25,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:50:25,830 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-10.i[913,926] [2025-03-04 00:50:25,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:50:25,887 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:50:25,895 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-10.i[913,926] [2025-03-04 00:50:25,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:50:25,933 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:50:25,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25 WrapperNode [2025-03-04 00:50:25,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:50:25,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:50:25,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:50:25,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:50:25,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,966 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-04 00:50:25,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:50:25,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:50:25,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:50:25,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:50:25,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,982 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:50:25,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:25,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:50:25,990 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:50:25,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:50:25,990 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:50:25,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (1/1) ... [2025-03-04 00:50:26,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:50:26,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:50:26,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:50:26,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:50:26,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:50:26,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:50:26,099 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:50:26,100 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:50:26,236 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:50:26,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:50:26,243 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:50:26,245 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:50:26,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:50:26 BoogieIcfgContainer [2025-03-04 00:50:26,245 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:50:26,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:50:26,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:50:26,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:50:26,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:50:25" (1/3) ... [2025-03-04 00:50:26,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1d80d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:50:26, skipping insertion in model container [2025-03-04 00:50:26,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:25" (2/3) ... [2025-03-04 00:50:26,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1d80d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:50:26, skipping insertion in model container [2025-03-04 00:50:26,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:50:26" (3/3) ... [2025-03-04 00:50:26,253 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-10.i [2025-03-04 00:50:26,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:50:26,263 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-10.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:50:26,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:50:26,309 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;@4de4ecb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:50:26,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:50:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 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-04 00:50:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 00:50:26,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:50:26,318 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, 1, 1, 1] [2025-03-04 00:50:26,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:50:26,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:50:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1855616992, now seen corresponding path program 1 times [2025-03-04 00:50:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:50:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199747726] [2025-03-04 00:50:26,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:50:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:50:26,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 00:50:26,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 00:50:26,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:50:26,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:50:26,542 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-04 00:50:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:50:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199747726] [2025-03-04 00:50:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199747726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:50:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30069292] [2025-03-04 00:50:26,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:50:26,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:50:26,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:50:26,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:50:26,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:50:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 00:50:26,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 00:50:26,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:50:26,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:50:26,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:50:26,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:50:26,722 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-04 00:50:26,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:50:26,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30069292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:50:26,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:50:26,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:50:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73198126] [2025-03-04 00:50:26,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:50:26,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:50:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:50:26,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:50:26,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:50:26,746 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 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.5) internal successors, (29), 2 states have internal predecessors, (29), 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-04 00:50:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:50:26,761 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2025-03-04 00:50:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:50:26,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 119 [2025-03-04 00:50:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:50:26,767 INFO L225 Difference]: With dead ends: 100 [2025-03-04 00:50:26,767 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 00:50:26,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:50:26,771 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:50:26,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:50:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 00:50:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 00:50:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-04 00:50:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-04 00:50:26,805 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 119 [2025-03-04 00:50:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:50:26,805 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-04 00:50:26,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-04 00:50:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-04 00:50:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 00:50:26,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:50:26,808 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, 1, 1, 1] [2025-03-04 00:50:26,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:50:27,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:50:27,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:50:27,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:50:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1240760547, now seen corresponding path program 1 times [2025-03-04 00:50:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:50:27,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365092314] [2025-03-04 00:50:27,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:50:27,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:50:27,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 00:50:27,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 00:50:27,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:50:27,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:50:27,171 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:50:27,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 00:50:27,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 00:50:27,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:50:27,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:50:27,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:50:27,292 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:50:27,293 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:50:27,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:50:27,296 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:50:27,365 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:50:27,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:50:27 BoogieIcfgContainer [2025-03-04 00:50:27,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:50:27,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:50:27,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:50:27,368 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:50:27,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:50:26" (3/4) ... [2025-03-04 00:50:27,370 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:50:27,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:50:27,372 INFO L158 Benchmark]: Toolchain (without parser) took 1659.70ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 108.5MB in the end (delta: 24.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2025-03-04 00:50:27,372 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:50:27,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.22ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 119.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:50:27,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.56ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 117.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:50:27,373 INFO L158 Benchmark]: Boogie Preprocessor took 23.08ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:50:27,374 INFO L158 Benchmark]: IcfgBuilder took 254.97ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 98.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:50:27,374 INFO L158 Benchmark]: TraceAbstraction took 1119.99ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 110.0MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:50:27,375 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:50:27,376 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.15ms. Allocated memory is still 226.5MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.22ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 119.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.56ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 117.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.08ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 115.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 254.97ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 98.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1119.99ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 110.0MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.5MB in the end (delta: 1.5MB). 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 106, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someUnaryDOUBLEoperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 8; [L24] double var_1_3 = 9.15; [L25] double var_1_6 = 1000000.875; [L26] double var_1_7 = 49.25; [L27] double var_1_8 = -0.8; [L28] signed char var_1_9 = -10; [L29] unsigned short int var_1_10 = 58996; [L30] unsigned short int var_1_11 = 32; [L31] signed char var_1_12 = 32; [L32] signed char var_1_13 = 16; [L33] signed char var_1_14 = 2; [L34] signed long int var_1_15 = 32; [L35] signed long int var_1_17 = 1000000000; [L36] float var_1_18 = -0.5; [L37] signed char var_1_19 = 2; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] double last_1_var_1_3 = 9.15; VAL [isInitial=0, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=8, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_3 = var_1_3 VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=8, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L73] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L73] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L74] var_1_6 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L75] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L76] var_1_7 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L77] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L78] var_1_8 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L79] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L80] var_1_10 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L81] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L82] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L82] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L83] var_1_11 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L85] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L85] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L86] var_1_12 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L87] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L88] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L88] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L89] var_1_13 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L91] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L91] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L92] var_1_14 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L94] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L94] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L95] var_1_17 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_17 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L96] RET assume_abort_if_not(var_1_17 >= 536870911) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L97] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L97] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L98] var_1_21 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L99] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L100] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L100] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_9=-10] [L114] RET updateVariables() [L115] CALL step() [L44] var_1_1 = var_1_2 [L45] var_1_18 = var_1_8 [L46] var_1_19 = var_1_12 [L47] var_1_20 = var_1_21 [L48] signed char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_3=183/20, stepLocal_1=0, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_18=4294967299, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_8=4294967299, var_1_9=-10] [L49] COND TRUE (- (var_1_10 - var_1_11)) >= stepLocal_1 [L50] var_1_9 = (var_1_12 - ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_18=4294967299, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_8=4294967299, var_1_9=-1] [L54] COND TRUE \read(var_1_20) [L55] var_1_15 = (var_1_12 - var_1_14) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=4294967299, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_8=4294967299, var_1_9=-1] [L59] signed long int stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_3=183/20, stepLocal_0=0, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=4294967299, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_3=183/20, var_1_8=4294967299, var_1_9=-1] [L60] COND TRUE stepLocal_0 < var_1_1 [L61] var_1_3 = -0.5 VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=4294967299, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_8=4294967299, var_1_9=-1] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((((var_1_1 == ((unsigned long int) var_1_2)) && ((var_1_15 < var_1_1) ? (var_1_3 == ((double) -0.5)) : (((- last_1_var_1_3) == (var_1_6 - var_1_7)) ? (var_1_3 == ((double) var_1_8)) : (var_1_3 == ((double) var_1_8))))) && (((- (var_1_10 - var_1_11)) >= var_1_19) ? (var_1_9 == ((signed char) (var_1_12 - ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14)))))) : (var_1_9 == ((signed char) ((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))))))) && (var_1_20 ? (var_1_15 == ((signed long int) (var_1_12 - var_1_14))) : (var_1_15 == ((signed long int) (var_1_13 - ((var_1_17 - 4) + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) && (var_1_18 == ((float) var_1_8))) && (var_1_19 == ((signed char) var_1_12))) && (var_1_20 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=4294967299, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_8=4294967299, var_1_9=-1] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=4294967299, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_8=4294967299, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=4294967299, var_1_19=0, var_1_1=4294967294, var_1_20=-255, var_1_21=-255, var_1_2=4294967294, var_1_8=4294967299, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 72 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, 72 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 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-04 00:50:27,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.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 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:50:29,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:50:29,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:50:29,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:50:29,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:50:29,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:50:29,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:50:29,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:50:29,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:50:29,360 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:50:29,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:50:29,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:50:29,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:50:29,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:50:29,361 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:50:29,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:50:29,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:50:29,363 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:50:29,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:50:29,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:50:29,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:50:29,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:50:29,365 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 -> 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf [2025-03-04 00:50:29,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:50:29,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:50:29,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:50:29,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:50:29,621 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:50:29,623 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-10.i [2025-03-04 00:50:30,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0411baaf/6502b34490d54606aa9f787f3559a564/FLAGb2f61ab98 [2025-03-04 00:50:31,043 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:50:31,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i [2025-03-04 00:50:31,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0411baaf/6502b34490d54606aa9f787f3559a564/FLAGb2f61ab98 [2025-03-04 00:50:31,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0411baaf/6502b34490d54606aa9f787f3559a564 [2025-03-04 00:50:31,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:50:31,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:50:31,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:50:31,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:50:31,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:50:31,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd5967d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31, skipping insertion in model container [2025-03-04 00:50:31,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:50:31,203 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-10.i[913,926] [2025-03-04 00:50:31,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:50:31,265 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:50:31,275 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-10.i[913,926] [2025-03-04 00:50:31,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:50:31,318 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:50:31,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31 WrapperNode [2025-03-04 00:50:31,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:50:31,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:50:31,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:50:31,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:50:31,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,359 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-04 00:50:31,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:50:31,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:50:31,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:50:31,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:50:31,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,381 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:50:31,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:50:31,408 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:50:31,408 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:50:31,408 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:50:31,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (1/1) ... [2025-03-04 00:50:31,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:50:31,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:50:31,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:50:31,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:50:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:50:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:50:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:50:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:50:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:50:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:50:31,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:50:31,545 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:50:32,195 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:50:32,195 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:50:32,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:50:32,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:50:32,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:50:32 BoogieIcfgContainer [2025-03-04 00:50:32,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:50:32,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:50:32,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:50:32,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:50:32,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:50:31" (1/3) ... [2025-03-04 00:50:32,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5434fa5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:50:32, skipping insertion in model container [2025-03-04 00:50:32,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:50:31" (2/3) ... [2025-03-04 00:50:32,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5434fa5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:50:32, skipping insertion in model container [2025-03-04 00:50:32,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:50:32" (3/3) ... [2025-03-04 00:50:32,212 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-10.i [2025-03-04 00:50:32,222 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:50:32,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-10.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:50:32,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:50:32,273 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;@5517892e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:50:32,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:50:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 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-04 00:50:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 00:50:32,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:50:32,285 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, 1, 1, 1] [2025-03-04 00:50:32,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:50:32,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:50:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1855616992, now seen corresponding path program 1 times [2025-03-04 00:50:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:50:32,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474766644] [2025-03-04 00:50:32,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:50:32,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:50:32,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:50:32,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:50:32,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:50:32,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 00:50:32,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 00:50:32,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:50:32,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:50:32,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:50:32,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:50:32,500 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-04 00:50:32,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:50:32,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:50:32,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474766644] [2025-03-04 00:50:32,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474766644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:50:32,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:50:32,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:50:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784631048] [2025-03-04 00:50:32,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:50:32,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:50:32,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:50:32,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:50:32,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:50:32,530 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 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.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:50:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:50:32,546 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2025-03-04 00:50:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:50:32,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-03-04 00:50:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:50:32,552 INFO L225 Difference]: With dead ends: 100 [2025-03-04 00:50:32,552 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 00:50:32,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:50:32,557 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:50:32,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:50:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 00:50:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 00:50:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-04 00:50:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-04 00:50:32,589 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 119 [2025-03-04 00:50:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:50:32,589 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-04 00:50:32,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:50:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-04 00:50:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 00:50:32,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:50:32,591 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, 1, 1, 1] [2025-03-04 00:50:32,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:50:32,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:50:32,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:50:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:50:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1240760547, now seen corresponding path program 1 times [2025-03-04 00:50:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:50:32,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476186786] [2025-03-04 00:50:32,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:50:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:50:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:50:32,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:50:32,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:50:32,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 00:50:32,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 00:50:32,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:50:32,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:50:32,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 00:50:32,977 INFO L279 TraceCheckSpWp]: Computing forward predicates...