./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-82.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 05ebac55e33f27a9aa589759c1825f109f2294026878df3af4b2993e1c293ed5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:00:53,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:00:53,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:00:53,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:00:53,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:00:53,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:00:53,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:00:53,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:00:53,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:00:53,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:00:53,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:00:53,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:00:53,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:00:53,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:00:53,870 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:00:53,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:00:53,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:00:53,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:00:53,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:00:53,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:00:53,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:00:53,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:00:53,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:00:53,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:00:53,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:00:53,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:00:53,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:00:53,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:00:53,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:00:53,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:00:53,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:00:53,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:00:53,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:00:53,873 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 -> 05ebac55e33f27a9aa589759c1825f109f2294026878df3af4b2993e1c293ed5 [2025-03-16 23:00:54,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:00:54,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:00:54,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:00:54,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:00:54,097 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:00:54,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-82.i [2025-03-16 23:00:55,264 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267cf191f/0b9416d41a0a4d1a8dba1647ff5ffcb7/FLAG68c30b2b7 [2025-03-16 23:00:55,523 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:00:55,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-82.i [2025-03-16 23:00:55,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267cf191f/0b9416d41a0a4d1a8dba1647ff5ffcb7/FLAG68c30b2b7 [2025-03-16 23:00:55,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267cf191f/0b9416d41a0a4d1a8dba1647ff5ffcb7 [2025-03-16 23:00:55,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:00:55,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:00:55,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:00:55,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:00:55,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:00:55,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:00:55" (1/1) ... [2025-03-16 23:00:55,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@988d823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:55, skipping insertion in model container [2025-03-16 23:00:55,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:00:55" (1/1) ... [2025-03-16 23:00:55,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:00:55,945 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_codestructure_dependencies_file-82.i[919,932] [2025-03-16 23:00:55,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:00:55,979 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:00:55,986 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_codestructure_dependencies_file-82.i[919,932] [2025-03-16 23:00:56,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:00:56,010 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:00:56,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56 WrapperNode [2025-03-16 23:00:56,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:00:56,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:00:56,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:00:56,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:00:56,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,036 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-16 23:00:56,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:00:56,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:00:56,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:00:56,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:00:56,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,062 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-16 23:00:56,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:00:56,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:00:56,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:00:56,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:00:56,074 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (1/1) ... [2025-03-16 23:00:56,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:00:56,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:00:56,096 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-16 23:00:56,098 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-16 23:00:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:00:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:00:56,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:00:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:00:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:00:56,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:00:56,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:00:56,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:00:56,365 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:00:56,366 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:00:56,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:00:56,377 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:00:56,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:00:56 BoogieIcfgContainer [2025-03-16 23:00:56,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:00:56,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:00:56,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:00:56,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:00:56,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:00:55" (1/3) ... [2025-03-16 23:00:56,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59de05ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:00:56, skipping insertion in model container [2025-03-16 23:00:56,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:00:56" (2/3) ... [2025-03-16 23:00:56,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59de05ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:00:56, skipping insertion in model container [2025-03-16 23:00:56,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:00:56" (3/3) ... [2025-03-16 23:00:56,386 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-82.i [2025-03-16 23:00:56,398 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:00:56,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-82.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:00:56,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:00:56,450 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;@66642b79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:00:56,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:00:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:00:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 23:00:56,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:00:56,466 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:00:56,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:00:56,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:00:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1826971138, now seen corresponding path program 1 times [2025-03-16 23:00:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:00:56,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151449591] [2025-03-16 23:00:56,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:00:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:00:56,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:00:56,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:00:56,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:00:56,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:00:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:00:56,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:00:56,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151449591] [2025-03-16 23:00:56,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151449591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:00:56,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085775524] [2025-03-16 23:00:56,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:00:56,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:00:56,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:00:56,699 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-16 23:00:56,700 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-16 23:00:56,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:00:56,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:00:56,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:00:56,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:00:56,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:00:56,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:00:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:00:56,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:00:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085775524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:00:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:00:56,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:00:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210290281] [2025-03-16 23:00:56,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:00:56,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:00:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:00:56,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:00:56,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:00:56,889 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:00:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:00:56,907 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2025-03-16 23:00:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:00:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2025-03-16 23:00:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:00:56,913 INFO L225 Difference]: With dead ends: 107 [2025-03-16 23:00:56,913 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 23:00:56,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-16 23:00:56,916 INFO L435 NwaCegarLoop]: 80 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, 80 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-16 23:00:56,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:00:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 23:00:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-16 23:00:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:00:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions. [2025-03-16 23:00:56,941 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 123 [2025-03-16 23:00:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:00:56,941 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 80 transitions. [2025-03-16 23:00:56,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:00:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2025-03-16 23:00:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 23:00:56,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:00:56,945 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:00:56,952 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-16 23:00:57,145 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-16 23:00:57,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:00:57,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:00:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash 429859714, now seen corresponding path program 1 times [2025-03-16 23:00:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:00:57,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209127439] [2025-03-16 23:00:57,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:00:57,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:00:57,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:00:57,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:00:57,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:00:57,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:00:57,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:00:57,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:00:57,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:00:57,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:00:57,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:00:57,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:00:57,372 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:00:57,372 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:00:57,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:00:57,376 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-16 23:00:57,447 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:00:57,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:00:57 BoogieIcfgContainer [2025-03-16 23:00:57,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:00:57,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:00:57,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:00:57,450 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:00:57,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:00:56" (3/4) ... [2025-03-16 23:00:57,452 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:00:57,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:00:57,453 INFO L158 Benchmark]: Toolchain (without parser) took 1619.62ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 59.5MB in the end (delta: 45.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-16 23:00:57,453 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:00:57,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.30ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 90.6MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:00:57,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.92ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:00:57,454 INFO L158 Benchmark]: Boogie Preprocessor took 35.50ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:00:57,454 INFO L158 Benchmark]: IcfgBuilder took 305.15ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 68.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:00:57,454 INFO L158 Benchmark]: TraceAbstraction took 1069.24ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 59.6MB in the end (delta: 9.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2025-03-16 23:00:57,454 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 59.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:00:57,455 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.30ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 90.6MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.92ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.50ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 305.15ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 68.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1069.24ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 59.6MB in the end (delta: 9.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 59.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 57, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] double var_1_4 = 5.5; [L24] float var_1_5 = 49.2; [L25] double var_1_7 = 49.5; [L26] double var_1_8 = 999999999999.4; [L27] double var_1_9 = 255.3; [L28] unsigned char var_1_10 = 1; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_13 = 1; [L31] signed long int var_1_14 = -16; [L32] signed long int var_1_15 = 25; [L33] signed long int var_1_16 = -8; [L34] signed long int var_1_17 = 1000000000; [L35] signed long int var_1_18 = 256; [L36] signed long int var_1_19 = 25; [L37] signed long int var_1_20 = 4; [L38] unsigned char var_1_21 = 1; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 50; [L41] double last_1_var_1_7 = 49.5; [L42] signed long int last_1_var_1_14 = -16; [L43] signed long int last_1_var_1_23 = 50; [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_7 = var_1_7 [L121] last_1_var_1_14 = var_1_14 [L122] last_1_var_1_23 = var_1_23 [L132] RET updateLastVariables() [L133] CALL updateVariables() [L86] var_1_4 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L87] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L88] var_1_5 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L89] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L90] var_1_8 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L91] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L92] var_1_9 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L93] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L94] var_1_11 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L95] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L96] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L96] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L100] var_1_15 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_15 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L101] RET assume_abort_if_not(var_1_15 >= -1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L102] CALL assume_abort_if_not(var_1_15 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L102] RET assume_abort_if_not(var_1_15 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L103] var_1_17 = __VERIFIER_nondet_long() [L104] CALL assume_abort_if_not(var_1_17 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L104] RET assume_abort_if_not(var_1_17 >= 536870911) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L105] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L105] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L106] var_1_18 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L107] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L108] CALL assume_abort_if_not(var_1_18 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L108] RET assume_abort_if_not(var_1_18 <= 536870911) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L109] var_1_19 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L110] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L111] CALL assume_abort_if_not(var_1_19 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L111] RET assume_abort_if_not(var_1_19 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L112] var_1_20 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L114] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L114] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L115] var_1_22 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L116] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L117] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L117] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L133] RET updateVariables() [L134] CALL step() [L47] var_1_23 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16, var_1_7=99/2] [L48] COND TRUE var_1_8 <= (((((var_1_5 * 1.25)) > ((last_1_var_1_7 * var_1_9))) ? ((var_1_5 * 1.25)) : ((last_1_var_1_7 * var_1_9)))) [L49] var_1_16 = ((((((last_1_var_1_23) < 0 ) ? -(last_1_var_1_23) : (last_1_var_1_23))) + last_1_var_1_23) + ((var_1_17 - var_1_18) - ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16, var_1_7=99/2] [L55] var_1_7 = (var_1_4 - (var_1_8 + var_1_9)) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_1=54/5, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16] [L56] COND TRUE var_1_23 == var_1_16 [L57] var_1_1 = (var_1_4 - 4.531) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=1, var_1_22=1, var_1_23=-16] [L65] COND FALSE !(((50 / -10) + var_1_23) >= var_1_16) [L72] var_1_21 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L74] var_1_10 = (var_1_11 && (var_1_21 || var_1_13)) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L75] COND FALSE !(var_1_8 <= ((((var_1_4) > ((var_1_1 + var_1_5))) ? (var_1_4) : ((var_1_1 + var_1_5))))) [L82] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L134] RET step() [L135] CALL, EXPR property() [L125-L126] return (((((((var_1_23 == var_1_16) ? (var_1_1 == ((double) (var_1_4 - 4.531))) : (((var_1_4 - var_1_5) > var_1_7) ? (var_1_1 == ((double) var_1_4)) : (var_1_1 == ((double) var_1_4)))) && (var_1_7 == ((double) (var_1_4 - (var_1_8 + var_1_9))))) && (var_1_10 == ((unsigned char) (var_1_11 && (var_1_21 || var_1_13))))) && ((var_1_8 <= ((((var_1_4) > ((var_1_1 + var_1_5))) ? (var_1_4) : ((var_1_1 + var_1_5))))) ? (var_1_10 ? (var_1_14 == ((signed long int) (var_1_15 + (8 + var_1_16)))) : (var_1_14 == ((signed long int) -256))) : (var_1_14 == ((signed long int) var_1_16)))) && ((var_1_8 <= (((((var_1_5 * 1.25)) > ((last_1_var_1_7 * var_1_9))) ? ((var_1_5 * 1.25)) : ((last_1_var_1_7 * var_1_9))))) ? (var_1_16 == ((signed long int) ((((((last_1_var_1_23) < 0 ) ? -(last_1_var_1_23) : (last_1_var_1_23))) + last_1_var_1_23) + ((var_1_17 - var_1_18) - ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))))) : ((var_1_4 <= last_1_var_1_7) ? (var_1_16 == ((signed long int) var_1_17)) : 1))) && ((((50 / -10) + var_1_23) >= var_1_16) ? (var_1_13 ? (var_1_21 == ((unsigned char) (var_1_11 && var_1_22))) : (var_1_21 == ((unsigned char) var_1_11))) : (var_1_21 == ((unsigned char) var_1_11)))) && (var_1_23 == ((signed long int) last_1_var_1_14)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=-1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=0, var_1_19=536871027, var_1_20=536871027, var_1_21=-255, var_1_22=1, var_1_23=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 104 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 20, 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, 80 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, 80 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred 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, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 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-16 23:00:57,470 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_codestructure_dependencies_file-82.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 05ebac55e33f27a9aa589759c1825f109f2294026878df3af4b2993e1c293ed5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:00:59,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:00:59,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:00:59,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:00:59,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:00:59,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:00:59,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:00:59,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:00:59,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:00:59,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:00:59,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:00:59,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:00:59,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:00:59,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:00:59,305 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:00:59,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:00:59,306 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:00:59,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:00:59,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:00:59,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:00:59,308 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:00:59,308 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:00:59,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:00:59,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:00:59,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:00:59,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:00:59,308 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 -> 05ebac55e33f27a9aa589759c1825f109f2294026878df3af4b2993e1c293ed5 [2025-03-16 23:00:59,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:00:59,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:00:59,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:00:59,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:00:59,549 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:00:59,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-82.i [2025-03-16 23:01:00,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159a089c4/adbbdad3a7ae4731bca4541e9168f072/FLAG9fd582c5c [2025-03-16 23:01:00,895 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:01:00,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-82.i [2025-03-16 23:01:00,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159a089c4/adbbdad3a7ae4731bca4541e9168f072/FLAG9fd582c5c [2025-03-16 23:01:01,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159a089c4/adbbdad3a7ae4731bca4541e9168f072 [2025-03-16 23:01:01,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:01:01,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:01:01,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:01:01,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:01:01,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:01:01,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94d66f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01, skipping insertion in model container [2025-03-16 23:01:01,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:01:01,365 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_codestructure_dependencies_file-82.i[919,932] [2025-03-16 23:01:01,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:01:01,412 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:01:01,419 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_codestructure_dependencies_file-82.i[919,932] [2025-03-16 23:01:01,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:01:01,446 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:01:01,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01 WrapperNode [2025-03-16 23:01:01,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:01:01,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:01:01,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:01:01,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:01:01,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,473 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-03-16 23:01:01,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:01:01,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:01:01,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:01:01,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:01:01,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,492 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-16 23:01:01,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:01:01,502 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:01:01,502 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:01:01,502 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:01:01,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (1/1) ... [2025-03-16 23:01:01,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:01:01,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:01:01,528 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-16 23:01:01,531 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-16 23:01:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:01:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:01:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:01:01,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:01:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:01:01,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:01:01,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:01:01,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:01:15,527 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:01:15,529 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:01:15,538 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:01:15,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:01:15,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:01:15 BoogieIcfgContainer [2025-03-16 23:01:15,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:01:15,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:01:15,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:01:15,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:01:15,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:01:01" (1/3) ... [2025-03-16 23:01:15,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e4676b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:01:15, skipping insertion in model container [2025-03-16 23:01:15,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:01" (2/3) ... [2025-03-16 23:01:15,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e4676b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:01:15, skipping insertion in model container [2025-03-16 23:01:15,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:01:15" (3/3) ... [2025-03-16 23:01:15,548 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-82.i [2025-03-16 23:01:15,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:01:15,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-82.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:01:15,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:01:15,612 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;@46f08bb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:01:15,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:01:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:01:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 23:01:15,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:15,621 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:01:15,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:15,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1826971138, now seen corresponding path program 1 times [2025-03-16 23:01:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:01:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324874974] [2025-03-16 23:01:15,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:15,634 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-16 23:01:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:01:15,636 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-16 23:01:15,638 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-16 23:01:15,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:01:16,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:01:16,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:16,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:16,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:01:16,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:01:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 23:01:16,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:01:16,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:01:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324874974] [2025-03-16 23:01:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324874974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:01:16,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:01:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:01:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127050157] [2025-03-16 23:01:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:01:16,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:01:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:01:16,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:01:16,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:01:16,242 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:01:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:01:16,263 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2025-03-16 23:01:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:01:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2025-03-16 23:01:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:01:16,269 INFO L225 Difference]: With dead ends: 107 [2025-03-16 23:01:16,269 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 23:01:16,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-16 23:01:16,274 INFO L435 NwaCegarLoop]: 80 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, 80 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-16 23:01:16,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:01:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 23:01:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-16 23:01:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:01:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions. [2025-03-16 23:01:16,311 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 123 [2025-03-16 23:01:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:01:16,311 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 80 transitions. [2025-03-16 23:01:16,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:01:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2025-03-16 23:01:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 23:01:16,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:16,317 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:01:16,335 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-16 23:01:16,518 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-16 23:01:16,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:16,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:16,519 INFO L85 PathProgramCache]: Analyzing trace with hash 429859714, now seen corresponding path program 1 times [2025-03-16 23:01:16,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:01:16,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379699504] [2025-03-16 23:01:16,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:16,519 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-16 23:01:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:01:16,522 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-16 23:01:16,523 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-16 23:01:16,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 23:01:17,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 23:01:17,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:17,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:17,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-16 23:01:17,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:01:54,247 WARN L286 SmtUtils]: Spent 7.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:01:59,725 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 11 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:02:07,525 WARN L286 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:02:15,664 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:02:21,982 WARN L286 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:02:29,041 WARN L286 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:02:34,295 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)