./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.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 03a3293d0395dd319c112da86cc4750b5f2f2545de650ed48e25d08335450b80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:34:24,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:34:24,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:34:24,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:34:24,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:34:24,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:34:24,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:34:24,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:34:24,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:34:24,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:34:24,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:34:24,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:34:24,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:34:24,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:34:24,346 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:34:24,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:34:24,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:34:24,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:34:24,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:34:24,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:34:24,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:34:24,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:34:24,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:34:24,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:34:24,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:34:24,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:34:24,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:34:24,348 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 -> 03a3293d0395dd319c112da86cc4750b5f2f2545de650ed48e25d08335450b80 [2025-03-03 18:34:24,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:34:24,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:34:24,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:34:24,583 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:34:24,583 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:34:24,584 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-18.i [2025-03-03 18:34:25,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e88e6292/cf1228fce56f44c1b290758828350853/FLAG3095aa4fd [2025-03-03 18:34:26,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:34:26,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.i [2025-03-03 18:34:26,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e88e6292/cf1228fce56f44c1b290758828350853/FLAG3095aa4fd [2025-03-03 18:34:26,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e88e6292/cf1228fce56f44c1b290758828350853 [2025-03-03 18:34:26,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:34:26,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:34:26,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:34:26,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:34:26,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:34:26,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e0c202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26, skipping insertion in model container [2025-03-03 18:34:26,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:34:26,153 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-18.i[919,932] [2025-03-03 18:34:26,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:34:26,217 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:34:26,224 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-18.i[919,932] [2025-03-03 18:34:26,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:34:26,253 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:34:26,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26 WrapperNode [2025-03-03 18:34:26,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:34:26,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:34:26,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:34:26,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:34:26,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,298 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-03-03 18:34:26,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:34:26,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:34:26,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:34:26,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:34:26,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,323 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:34:26,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:34:26,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:34:26,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:34:26,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:34:26,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (1/1) ... [2025-03-03 18:34:26,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:34:26,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:34:26,368 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-03 18:34:26,373 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-03 18:34:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:34:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:34:26,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:34:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:34:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:34:26,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:34:26,445 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:34:26,447 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:34:26,632 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:34:26,632 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:34:26,638 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:34:26,638 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:34:26,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:34:26 BoogieIcfgContainer [2025-03-03 18:34:26,639 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:34:26,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:34:26,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:34:26,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:34:26,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:34:26" (1/3) ... [2025-03-03 18:34:26,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cff2e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:34:26, skipping insertion in model container [2025-03-03 18:34:26,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:26" (2/3) ... [2025-03-03 18:34:26,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cff2e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:34:26, skipping insertion in model container [2025-03-03 18:34:26,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:34:26" (3/3) ... [2025-03-03 18:34:26,645 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-18.i [2025-03-03 18:34:26,655 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:34:26,656 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-18.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:34:26,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:34:26,704 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;@5e2d5cb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:34:26,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:34:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:34:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:34:26,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:34:26,714 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:34:26,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:34:26,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:34:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash -658584126, now seen corresponding path program 1 times [2025-03-03 18:34:26,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:34:26,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373669942] [2025-03-03 18:34:26,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:34:26,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:34:26,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:34:26,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:34:26,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:34:26,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:34:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 18:34:26,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:34:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373669942] [2025-03-03 18:34:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373669942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:34:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579629289] [2025-03-03 18:34:26,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:34:26,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:34:26,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:34:26,936 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-03 18:34:26,938 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-03 18:34:27,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:34:27,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:34:27,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:34:27,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:34:27,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:34:27,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:34:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 18:34:27,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:34:27,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579629289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:34:27,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:34:27,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:34:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980994654] [2025-03-03 18:34:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:34:27,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:34:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:34:27,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:34:27,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:34:27,121 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:34:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:34:27,139 INFO L93 Difference]: Finished difference Result 102 states and 172 transitions. [2025-03-03 18:34:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:34:27,142 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-03 18:34:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:34:27,147 INFO L225 Difference]: With dead ends: 102 [2025-03-03 18:34:27,147 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 18:34:27,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-03 18:34:27,151 INFO L435 NwaCegarLoop]: 76 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, 76 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-03 18:34:27,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:34:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 18:34:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 18:34:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:34:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2025-03-03 18:34:27,183 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 100 [2025-03-03 18:34:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:34:27,183 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2025-03-03 18:34:27,183 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:34:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2025-03-03 18:34:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:34:27,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:34:27,188 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:34:27,194 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-03 18:34:27,392 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-03 18:34:27,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:34:27,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:34:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash -918809667, now seen corresponding path program 1 times [2025-03-03 18:34:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:34:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646570996] [2025-03-03 18:34:27,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:34:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:34:27,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:34:27,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:34:27,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:34:27,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:34:27,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:34:27,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:34:27,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:34:27,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:34:27,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:34:27,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:34:27,622 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:34:27,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:34:27,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:34:27,626 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 18:34:27,693 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:34:27,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:34:27 BoogieIcfgContainer [2025-03-03 18:34:27,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:34:27,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:34:27,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:34:27,700 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:34:27,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:34:26" (3/4) ... [2025-03-03 18:34:27,702 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:34:27,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:34:27,703 INFO L158 Benchmark]: Toolchain (without parser) took 1677.77ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 113.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-03-03 18:34:27,703 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:34:27,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.86ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 114.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:34:27,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.91ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:34:27,704 INFO L158 Benchmark]: Boogie Preprocessor took 41.56ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:34:27,704 INFO L158 Benchmark]: IcfgBuilder took 298.21ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 92.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:34:27,704 INFO L158 Benchmark]: TraceAbstraction took 1058.45ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 113.4MB in the end (delta: -21.2MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-03-03 18:34:27,704 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 113.3MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:34:27,705 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 226.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.86ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 114.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.91ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.56ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 298.21ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 92.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1058.45ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 113.4MB in the end (delta: -21.2MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 113.3MB in the end (delta: 21.5kB). 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 someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryArithmeticFLOAToperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -1; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 5.5; [L25] float var_1_5 = 255.475; [L26] unsigned char var_1_7 = 0; [L27] signed char var_1_8 = -5; [L28] signed char var_1_9 = 2; [L29] unsigned char var_1_10 = 16; [L30] unsigned char var_1_11 = 16; [L31] float var_1_12 = 10000000.8; [L32] float var_1_13 = 127.7; [L33] float var_1_14 = 199.2; [L34] float var_1_15 = 999999.5; [L35] signed long int var_1_16 = -8; [L36] signed short int var_1_18 = -8; [L37] double var_1_19 = 5.4; [L38] signed char last_1_var_1_1 = -1; [L39] unsigned char last_1_var_1_10 = 16; [L40] signed long int last_1_var_1_16 = -8; VAL [isInitial=0, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L119] last_1_var_1_1 = var_1_1 [L120] last_1_var_1_10 = var_1_10 [L121] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L95] var_1_4 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L97] var_1_5 = __VERIFIER_nondet_float() [L98] 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_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L98] 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_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L101] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L102] var_1_8 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L103] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L104] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L105] var_1_9 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L106] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L107] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L107] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L108] var_1_11 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L109] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L110] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L110] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L111] var_1_13 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L112] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L113] var_1_14 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L114] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L115] var_1_15 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L116] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L132] RET updateVariables() [L133] CALL step() [L44] COND FALSE !(var_1_9 < last_1_var_1_16) [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L51] COND TRUE \read(var_1_7) [L52] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=50000004/5, var_1_16=-127, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L56] COND TRUE ! (last_1_var_1_1 > last_1_var_1_10) [L57] var_1_19 = ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=50000004/5, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-8, var_1_19=10000005, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L63] COND TRUE var_1_5 <= (var_1_19 / var_1_3) [L64] var_1_12 = ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-8, var_1_19=10000005, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L68] COND FALSE !((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) [L75] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-8, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] [L77] COND FALSE !(var_1_1 >= (var_1_16 + var_1_10)) [L88] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-127, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] [L133] RET step() [L134] CALL, EXPR property() [L124-L125] return (((((((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) ? (var_1_7 ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_9))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_9 < last_1_var_1_16) ? (((var_1_4 - var_1_5) > var_1_3) ? (var_1_10 == ((unsigned char) 8)) : 1) : (var_1_10 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_19 / var_1_3)) ? (var_1_12 == ((float) ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) : (var_1_12 == ((float) var_1_14)))) && (var_1_7 ? (var_1_16 == ((signed long int) var_1_8)) : (var_1_16 == ((signed long int) (var_1_11 - ((((var_1_10 - var_1_10) < 0 ) ? -(var_1_10 - var_1_10) : (var_1_10 - var_1_10)))))))) && ((var_1_1 >= (var_1_16 + var_1_10)) ? ((var_1_5 < 999.5f) ? (var_1_7 ? (var_1_18 == ((signed short int) (var_1_16 + var_1_16))) : (var_1_18 == ((signed short int) var_1_8))) : (var_1_18 == ((signed short int) var_1_9))) : (var_1_18 == ((signed short int) var_1_8)))) && ((! (last_1_var_1_1 > last_1_var_1_10)) ? (var_1_19 == ((double) ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))))) : ((last_1_var_1_10 > var_1_9) ? (var_1_19 == ((double) var_1_15)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-127, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-127, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-127, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 15, 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, 76 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, 76 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 812/840 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-03 18:34:27,720 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-18.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 03a3293d0395dd319c112da86cc4750b5f2f2545de650ed48e25d08335450b80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:34:29,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:34:29,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:34:29,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:34:29,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:34:29,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:34:29,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:34:29,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:34:29,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:34:29,717 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:34:29,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:34:29,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:34:29,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:34:29,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:34:29,719 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:34:29,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:34:29,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:34:29,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:34:29,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:34:29,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:34:29,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:34:29,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:34:29,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:34:29,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:34:29,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:34:29,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:34:29,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:34:29,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:34:29,721 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:34:29,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:34:29,722 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:34:29,722 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:34:29,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:34:29,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:34:29,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:34:29,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:34:29,722 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 -> 03a3293d0395dd319c112da86cc4750b5f2f2545de650ed48e25d08335450b80 [2025-03-03 18:34:29,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:34:29,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:34:29,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:34:29,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:34:29,964 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:34:29,964 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-18.i [2025-03-03 18:34:31,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff0d0ca4/5c307ceda5d74feeac404bc5308ebb08/FLAGf9af4fb38 [2025-03-03 18:34:31,432 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:34:31,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.i [2025-03-03 18:34:31,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff0d0ca4/5c307ceda5d74feeac404bc5308ebb08/FLAGf9af4fb38 [2025-03-03 18:34:31,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff0d0ca4/5c307ceda5d74feeac404bc5308ebb08 [2025-03-03 18:34:31,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:34:31,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:34:31,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:34:31,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:34:31,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:34:31,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:34:31" (1/1) ... [2025-03-03 18:34:31,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e8c2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:31, skipping insertion in model container [2025-03-03 18:34:31,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:34:31" (1/1) ... [2025-03-03 18:34:31,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:34:31,923 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-18.i[919,932] [2025-03-03 18:34:31,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:34:31,975 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:34:31,983 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-18.i[919,932] [2025-03-03 18:34:32,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:34:32,016 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:34:32,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32 WrapperNode [2025-03-03 18:34:32,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:34:32,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:34:32,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:34:32,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:34:32,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,054 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-03 18:34:32,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:34:32,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:34:32,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:34:32,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:34:32,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,084 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-03 18:34:32,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:34:32,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:34:32,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:34:32,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:34:32,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (1/1) ... [2025-03-03 18:34:32,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:34:32,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:34:32,137 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-03 18:34:32,144 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-03 18:34:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:34:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:34:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:34:32,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:34:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:34:32,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:34:32,226 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:34:32,227 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:34:54,926 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:34:54,927 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:34:54,933 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:34:54,933 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:34:54,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:34:54 BoogieIcfgContainer [2025-03-03 18:34:54,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:34:54,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:34:54,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:34:54,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:34:54,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:34:31" (1/3) ... [2025-03-03 18:34:54,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8a30a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:34:54, skipping insertion in model container [2025-03-03 18:34:54,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:34:32" (2/3) ... [2025-03-03 18:34:54,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8a30a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:34:54, skipping insertion in model container [2025-03-03 18:34:54,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:34:54" (3/3) ... [2025-03-03 18:34:54,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-18.i [2025-03-03 18:34:54,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:34:54,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-18.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:34:54,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:34:54,992 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;@55cef5a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:34:54,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:34:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:34:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:34:55,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:34:55,002 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:34:55,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:34:55,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:34:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash -658584126, now seen corresponding path program 1 times [2025-03-03 18:34:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:34:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743730092] [2025-03-03 18:34:55,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:34:55,014 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-03 18:34:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:34:55,017 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-03 18:34:55,018 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-03 18:34:55,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:34:56,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:34:56,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:34:56,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:34:56,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:34:56,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:34:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-03 18:34:56,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:34:56,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:34:56,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743730092] [2025-03-03 18:34:56,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743730092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:34:56,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:34:56,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:34:56,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121234187] [2025-03-03 18:34:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:34:56,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:34:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:34:56,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:34:56,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:34:56,199 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:34:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:34:56,212 INFO L93 Difference]: Finished difference Result 102 states and 172 transitions. [2025-03-03 18:34:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:34:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-03 18:34:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:34:56,218 INFO L225 Difference]: With dead ends: 102 [2025-03-03 18:34:56,218 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 18:34:56,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-03 18:34:56,222 INFO L435 NwaCegarLoop]: 76 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, 76 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-03 18:34:56,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:34:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 18:34:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 18:34:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:34:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2025-03-03 18:34:56,250 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 100 [2025-03-03 18:34:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:34:56,250 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2025-03-03 18:34:56,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:34:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2025-03-03 18:34:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 18:34:56,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:34:56,253 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:34:56,288 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-03 18:34:56,454 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-03 18:34:56,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:34:56,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:34:56,455 INFO L85 PathProgramCache]: Analyzing trace with hash -918809667, now seen corresponding path program 1 times [2025-03-03 18:34:56,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:34:56,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483975981] [2025-03-03 18:34:56,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:34:56,456 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-03 18:34:56,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:34:56,459 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-03 18:34:56,460 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-03 18:34:56,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 18:34:57,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 18:34:57,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:34:57,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:34:57,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 18:34:57,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:35:32,263 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)