./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_floatingpointinfluence_has-floats_file-50.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 3ee6bf6011580eaa6570c3402c462e285b418b31675b2c310f08d8862af6b7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:37:21,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:37:21,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:37:21,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:37:21,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:37:21,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:37:21,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:37:21,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:37:21,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:37:21,579 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:37:21,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:37:21,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:37:21,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:37:21,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:37:21,580 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:37:21,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:37:21,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:37:21,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:37:21,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:37:21,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:37:21,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:37:21,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:37:21,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:37:21,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:37:21,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:37:21,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:37:21,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:37:21,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:37:21,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:37:21,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:37:21,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:37:21,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:37:21,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:37:21,583 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 -> 3ee6bf6011580eaa6570c3402c462e285b418b31675b2c310f08d8862af6b7b0 [2025-03-08 13:37:21,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:37:21,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:37:21,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:37:21,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:37:21,800 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:37:21,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-50.i [2025-03-08 13:37:22,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39686169b/d7b0dddc3f7349f9baa7ddfd3346d7e5/FLAG5b49b6cdc [2025-03-08 13:37:23,169 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:37:23,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-50.i [2025-03-08 13:37:23,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39686169b/d7b0dddc3f7349f9baa7ddfd3346d7e5/FLAG5b49b6cdc [2025-03-08 13:37:23,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39686169b/d7b0dddc3f7349f9baa7ddfd3346d7e5 [2025-03-08 13:37:23,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:37:23,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:37:23,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:37:23,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:37:23,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:37:23,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2157f268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23, skipping insertion in model container [2025-03-08 13:37:23,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:37:23,583 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_floatingpointinfluence_has-floats_file-50.i[917,930] [2025-03-08 13:37:23,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:37:23,618 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:37:23,624 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_floatingpointinfluence_has-floats_file-50.i[917,930] [2025-03-08 13:37:23,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:37:23,662 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:37:23,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23 WrapperNode [2025-03-08 13:37:23,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:37:23,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:37:23,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:37:23,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:37:23,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,698 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-03-08 13:37:23,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:37:23,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:37:23,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:37:23,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:37:23,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,725 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-08 13:37:23,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:37:23,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:37:23,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:37:23,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:37:23,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (1/1) ... [2025-03-08 13:37:23,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:37:23,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:37:23,776 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-08 13:37:23,779 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-08 13:37:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:37:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:37:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:37:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:37:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:37:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:37:23,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:37:23,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:37:24,019 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 13:37:24,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:37:24,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:37:24,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:37:24,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:24 BoogieIcfgContainer [2025-03-08 13:37:24,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:37:24,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:37:24,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:37:24,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:37:24,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:37:23" (1/3) ... [2025-03-08 13:37:24,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d7beaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:37:24, skipping insertion in model container [2025-03-08 13:37:24,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:23" (2/3) ... [2025-03-08 13:37:24,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d7beaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:37:24, skipping insertion in model container [2025-03-08 13:37:24,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:24" (3/3) ... [2025-03-08 13:37:24,033 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-50.i [2025-03-08 13:37:24,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:37:24,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-50.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:37:24,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:37:24,095 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;@60ce200d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:37:24,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:37:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:37:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 13:37:24,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:24,108 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:37:24,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:24,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -107551148, now seen corresponding path program 1 times [2025-03-08 13:37:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:37:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730936500] [2025-03-08 13:37:24,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:37:24,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 13:37:24,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 13:37:24,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:24,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 13:37:24,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:37:24,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730936500] [2025-03-08 13:37:24,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730936500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:37:24,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324890553] [2025-03-08 13:37:24,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:24,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:37:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:37:24,391 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-08 13:37:24,393 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-08 13:37:24,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 13:37:24,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 13:37:24,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:24,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:24,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:37:24,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:37:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 13:37:24,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:37:24,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324890553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:37:24,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:37:24,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:37:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135192518] [2025-03-08 13:37:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:37:24,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:37:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:37:24,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:37:24,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:37:24,605 INFO L87 Difference]: Start difference. First operand has 67 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:37:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:37:24,626 INFO L93 Difference]: Finished difference Result 128 states and 221 transitions. [2025-03-08 13:37:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:37:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2025-03-08 13:37:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:37:24,632 INFO L225 Difference]: With dead ends: 128 [2025-03-08 13:37:24,632 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 13:37:24,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-08 13:37:24,638 INFO L435 NwaCegarLoop]: 95 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, 95 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-08 13:37:24,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:37:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 13:37:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-08 13:37:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:37:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-03-08 13:37:24,666 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 159 [2025-03-08 13:37:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:37:24,667 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-03-08 13:37:24,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:37:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-03-08 13:37:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 13:37:24,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:24,669 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:37:24,676 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-08 13:37:24,874 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-08 13:37:24,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:24,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1881453040, now seen corresponding path program 1 times [2025-03-08 13:37:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:37:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668573039] [2025-03-08 13:37:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:37:24,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 13:37:24,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 13:37:24,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 13:37:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:37:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668573039] [2025-03-08 13:37:25,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668573039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:37:25,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:37:25,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:37:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737069797] [2025-03-08 13:37:25,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:37:25,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:37:25,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:37:25,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:37:25,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:37:25,198 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:37:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:37:25,384 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2025-03-08 13:37:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:37:25,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2025-03-08 13:37:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:37:25,388 INFO L225 Difference]: With dead ends: 197 [2025-03-08 13:37:25,390 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 13:37:25,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:37:25,392 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 62 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:37:25,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 373 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:37:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 13:37:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2025-03-08 13:37:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:37:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2025-03-08 13:37:25,420 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 159 [2025-03-08 13:37:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:37:25,421 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2025-03-08 13:37:25,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:37:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2025-03-08 13:37:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 13:37:25,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:25,422 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:37:25,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:37:25,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:25,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 73998577, now seen corresponding path program 1 times [2025-03-08 13:37:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:37:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975365074] [2025-03-08 13:37:25,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:37:25,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 13:37:25,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 13:37:25,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:25,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:37:25,559 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:37:25,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 13:37:25,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 13:37:25,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:25,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:37:25,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:37:25,660 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:37:25,661 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:37:25,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:37:25,665 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:37:25,742 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:37:25,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:37:25 BoogieIcfgContainer [2025-03-08 13:37:25,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:37:25,746 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:37:25,746 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:37:25,746 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:37:25,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:24" (3/4) ... [2025-03-08 13:37:25,748 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:37:25,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:37:25,749 INFO L158 Benchmark]: Toolchain (without parser) took 2277.43ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 73.6MB in the end (delta: 35.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2025-03-08 13:37:25,750 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:37:25,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.86ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 96.6MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:37:25,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.43ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:37:25,750 INFO L158 Benchmark]: Boogie Preprocessor took 33.09ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:37:25,750 INFO L158 Benchmark]: IcfgBuilder took 288.84ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 75.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:37:25,750 INFO L158 Benchmark]: TraceAbstraction took 1717.62ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 73.6MB in the end (delta: 620.5kB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2025-03-08 13:37:25,750 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 73.6MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:37:25,753 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.86ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 96.6MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.43ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.09ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 288.84ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 75.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1717.62ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 73.6MB in the end (delta: 620.5kB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 73.6MB in the end (delta: 37.0kB). 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 someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 8.875; [L24] double var_1_3 = 63.5; [L25] double var_1_4 = 16.6; [L26] double var_1_5 = 127.8; [L27] unsigned char var_1_9 = 1; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 0; [L30] signed short int var_1_12 = -2; [L31] signed short int var_1_13 = 64; [L32] signed short int var_1_14 = 2; [L33] signed short int var_1_15 = 4; [L34] signed short int var_1_16 = 26204; [L35] signed short int var_1_17 = 5; [L36] signed long int var_1_18 = -5; [L37] signed long int var_1_19 = 100; [L38] signed long int var_1_20 = 0; [L39] signed long int var_1_21 = 128; [L40] signed long int last_1_var_1_18 = -5; VAL [isInitial=0, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=71/8, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_2=71/8, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L128] RET updateLastVariables() [L129] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L76] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L77] var_1_3 = __VERIFIER_nondet_double() [L78] 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_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L78] 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_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L79] var_1_4 = __VERIFIER_nondet_double() [L80] 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_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L80] 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_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L81] var_1_5 = __VERIFIER_nondet_double() [L82] 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_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L82] 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_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L86] var_1_10 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L87] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L88] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L89] var_1_11 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L91] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L92] var_1_13 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_13 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L93] RET assume_abort_if_not(var_1_13 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L94] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L95] var_1_14 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_14 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L96] RET assume_abort_if_not(var_1_14 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L97] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L98] var_1_15 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L99] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L100] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L101] var_1_16 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L102] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L103] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L104] var_1_17 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L105] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L106] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L107] var_1_19 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L108] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L109] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=0] [L110] var_1_20 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=0] [L111] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_20 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=0] [L112] RET assume_abort_if_not(var_1_20 <= 536870911) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=0] [L113] var_1_21 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L114] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L115] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L129] RET updateVariables() [L130] CALL step() [L44] signed long int stepLocal_1 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_1=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L45] COND FALSE !(stepLocal_1 >= 0) [L48] var_1_12 = ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=32766, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L50] signed long int stepLocal_3 = var_1_15 - var_1_19; [L51] signed short int stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=32766, stepLocal_3=32766, var_1_10=1, var_1_11=-256, var_1_12=32766, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L52] COND FALSE !(var_1_12 > stepLocal_3) [L57] var_1_18 = var_1_14 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=32766, var_1_10=1, var_1_11=-256, var_1_12=32766, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L59] signed long int stepLocal_0 = (((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18)); VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=32766, stepLocal_2=32766, var_1_10=1, var_1_11=-256, var_1_12=32766, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L60] COND FALSE !((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) [L71] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=32766, stepLocal_2=32766, var_1_10=1, var_1_11=-256, var_1_12=32766, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L130] RET step() [L131] CALL, EXPR property() [L121-L122] return ((((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) ? ((((((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18))) < var_1_18) ? (var_1_9 ? (var_1_1 == ((unsigned char) var_1_10)) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_11))) && ((last_1_var_1_18 >= 0) ? (var_1_12 == ((signed short int) ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))))) : (var_1_12 == ((signed short int) ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && ((var_1_12 > (var_1_15 - var_1_19)) ? ((var_1_13 < var_1_12) ? (var_1_18 == ((signed long int) ((var_1_17 + (var_1_16 + var_1_20)) - var_1_21))) : 1) : (var_1_18 == ((signed long int) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=32766, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=32766, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=32766, var_1_13=32765, var_1_14=32766, var_1_15=32766, var_1_16=16383, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=536870911, var_1_21=2147483646, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 126 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 468 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 195 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 353 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3850/3900 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-08 13:37:25,768 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_floatingpointinfluence_has-floats_file-50.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 3ee6bf6011580eaa6570c3402c462e285b418b31675b2c310f08d8862af6b7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:37:27,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:37:27,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:37:27,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:37:27,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:37:27,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:37:27,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:37:27,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:37:27,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:37:27,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:37:27,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:37:27,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:37:27,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:37:27,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:37:27,702 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:37:27,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:37:27,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:37:27,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:37:27,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:37:27,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:37:27,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:37:27,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:37:27,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:37:27,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:37:27,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:37:27,704 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 -> 3ee6bf6011580eaa6570c3402c462e285b418b31675b2c310f08d8862af6b7b0 [2025-03-08 13:37:27,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:37:27,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:37:27,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:37:27,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:37:27,920 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:37:27,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-50.i [2025-03-08 13:37:29,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bde3617d/ab4799b5af0048bc8ba641bb5b45a66c/FLAGf6b5f1d46 [2025-03-08 13:37:29,332 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:37:29,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-50.i [2025-03-08 13:37:29,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bde3617d/ab4799b5af0048bc8ba641bb5b45a66c/FLAGf6b5f1d46 [2025-03-08 13:37:29,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bde3617d/ab4799b5af0048bc8ba641bb5b45a66c [2025-03-08 13:37:29,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:37:29,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:37:29,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:37:29,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:37:29,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:37:29,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b82d30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29, skipping insertion in model container [2025-03-08 13:37:29,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:37:29,495 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_floatingpointinfluence_has-floats_file-50.i[917,930] [2025-03-08 13:37:29,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:37:29,562 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:37:29,573 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_floatingpointinfluence_has-floats_file-50.i[917,930] [2025-03-08 13:37:29,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:37:29,617 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:37:29,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29 WrapperNode [2025-03-08 13:37:29,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:37:29,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:37:29,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:37:29,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:37:29,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,663 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-08 13:37:29,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:37:29,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:37:29,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:37:29,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:37:29,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,689 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-08 13:37:29,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:37:29,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:37:29,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:37:29,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:37:29,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (1/1) ... [2025-03-08 13:37:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:37:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:37:29,745 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-08 13:37:29,748 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-08 13:37:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:37:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:37:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:37:29,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:37:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:37:29,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:37:29,846 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:37:29,847 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:37:32,265 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 13:37:32,265 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:37:32,273 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:37:32,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:37:32,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:32 BoogieIcfgContainer [2025-03-08 13:37:32,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:37:32,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:37:32,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:37:32,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:37:32,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:37:29" (1/3) ... [2025-03-08 13:37:32,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367f9581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:37:32, skipping insertion in model container [2025-03-08 13:37:32,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:37:29" (2/3) ... [2025-03-08 13:37:32,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367f9581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:37:32, skipping insertion in model container [2025-03-08 13:37:32,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:37:32" (3/3) ... [2025-03-08 13:37:32,280 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-50.i [2025-03-08 13:37:32,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:37:32,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-50.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:37:32,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:37:32,336 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;@57ef2e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:37:32,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:37:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:37:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 13:37:32,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:32,348 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:37:32,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -107551148, now seen corresponding path program 1 times [2025-03-08 13:37:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:37:32,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021726821] [2025-03-08 13:37:32,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:32,359 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-08 13:37:32,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:37:32,362 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-08 13:37:32,363 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-08 13:37:32,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 13:37:32,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 13:37:32,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:32,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:32,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:37:32,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:37:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2025-03-08 13:37:32,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:37:32,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:37:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021726821] [2025-03-08 13:37:32,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021726821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:37:32,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:37:32,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:37:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574937031] [2025-03-08 13:37:32,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:37:32,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:37:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:37:32,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:37:32,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:37:32,685 INFO L87 Difference]: Start difference. First operand has 67 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:37:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:37:32,702 INFO L93 Difference]: Finished difference Result 128 states and 221 transitions. [2025-03-08 13:37:32,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:37:32,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2025-03-08 13:37:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:37:32,712 INFO L225 Difference]: With dead ends: 128 [2025-03-08 13:37:32,712 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 13:37:32,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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-08 13:37:32,716 INFO L435 NwaCegarLoop]: 95 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, 95 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-08 13:37:32,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:37:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 13:37:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-08 13:37:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 13:37:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-03-08 13:37:32,744 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 159 [2025-03-08 13:37:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:37:32,744 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-03-08 13:37:32,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:37:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-03-08 13:37:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 13:37:32,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:32,747 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:37:32,755 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-08 13:37:32,949 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-08 13:37:32,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:32,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1881453040, now seen corresponding path program 1 times [2025-03-08 13:37:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:37:32,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151451321] [2025-03-08 13:37:32,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:32,951 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-08 13:37:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:37:32,953 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-08 13:37:32,955 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-08 13:37:33,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 13:37:33,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 13:37:33,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:33,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:33,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 13:37:33,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:37:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 13:37:33,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:37:33,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:37:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151451321] [2025-03-08 13:37:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151451321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:37:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:37:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:37:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540380974] [2025-03-08 13:37:33,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:37:33,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:37:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:37:33,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:37:33,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:37:33,655 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:37:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:37:35,773 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2025-03-08 13:37:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:37:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2025-03-08 13:37:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:37:35,790 INFO L225 Difference]: With dead ends: 197 [2025-03-08 13:37:35,790 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 13:37:35,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:37:35,791 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 59 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:37:35,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 373 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 13:37:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 13:37:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2025-03-08 13:37:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 13:37:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2025-03-08 13:37:35,821 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 159 [2025-03-08 13:37:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:37:35,822 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2025-03-08 13:37:35,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 13:37:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2025-03-08 13:37:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 13:37:35,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:37:35,823 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 13:37:35,833 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 (3)] Ended with exit code 0 [2025-03-08 13:37:36,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-08 13:37:36,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:37:36,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:37:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash 73998577, now seen corresponding path program 1 times [2025-03-08 13:37:36,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:37:36,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719866348] [2025-03-08 13:37:36,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:37:36,026 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-08 13:37:36,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:37:36,028 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08 13:37:36,029 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 (4)] Waiting until timeout for monitored process [2025-03-08 13:37:36,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 13:37:36,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 13:37:36,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:37:36,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:37:36,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 13:37:36,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:38:03,352 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)