./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.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 294b7dcc801896cc0c4607275b340e3835112c15aaaacb8b365f279b8e190761 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:35:54,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:35:54,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:35:54,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:35:54,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:35:54,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:35:54,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:35:54,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:35:54,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:35:54,961 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:35:54,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:35:54,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:35:54,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:35:54,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:35:54,963 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:35:54,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:35:54,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:35:54,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:35:54,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:35:54,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:35:54,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:35:54,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:35:54,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:35:54,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:35:54,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:35:54,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:35:54,966 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 -> 294b7dcc801896cc0c4607275b340e3835112c15aaaacb8b365f279b8e190761 [2025-03-03 22:35:55,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:35:55,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:35:55,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:35:55,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:35:55,176 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:35:55,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2025-03-03 22:35:56,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604bef22f/2183ffda458c43e69b36ecd2b2b8de15/FLAG646527800 [2025-03-03 22:35:56,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:35:56,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2025-03-03 22:35:56,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604bef22f/2183ffda458c43e69b36ecd2b2b8de15/FLAG646527800 [2025-03-03 22:35:56,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604bef22f/2183ffda458c43e69b36ecd2b2b8de15 [2025-03-03 22:35:56,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:35:56,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:35:56,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:35:56,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:35:56,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:35:56,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d430d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56, skipping insertion in model container [2025-03-03 22:35:56,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:35:56,639 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_no-floats_file-45.i[916,929] [2025-03-03 22:35:56,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:35:56,692 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:35:56,700 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_no-floats_file-45.i[916,929] [2025-03-03 22:35:56,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:35:56,739 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:35:56,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56 WrapperNode [2025-03-03 22:35:56,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:35:56,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:35:56,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:35:56,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:35:56,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,775 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-03 22:35:56,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:35:56,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:35:56,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:35:56,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:35:56,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,813 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:35:56,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:35:56,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:35:56,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:35:56,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:35:56,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (1/1) ... [2025-03-03 22:35:56,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:35:56,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:35:56,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:35:56,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:35:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:35:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:35:56,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:35:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:35:56,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:35:56,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:35:56,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:35:56,934 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:35:57,125 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:35:57,125 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:35:57,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:35:57,135 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:35:57,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:35:57 BoogieIcfgContainer [2025-03-03 22:35:57,135 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:35:57,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:35:57,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:35:57,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:35:57,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:35:56" (1/3) ... [2025-03-03 22:35:57,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107439db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:35:57, skipping insertion in model container [2025-03-03 22:35:57,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:56" (2/3) ... [2025-03-03 22:35:57,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107439db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:35:57, skipping insertion in model container [2025-03-03 22:35:57,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:35:57" (3/3) ... [2025-03-03 22:35:57,141 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-45.i [2025-03-03 22:35:57,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:35:57,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-45.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:35:57,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:35:57,191 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;@6ca302b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:35:57,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:35:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 22:35:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:35:57,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:57,204 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:57,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:57,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash -124152610, now seen corresponding path program 1 times [2025-03-03 22:35:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:57,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457901565] [2025-03-03 22:35:57,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:57,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:35:57,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:35:57,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:57,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 22:35:57,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457901565] [2025-03-03 22:35:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457901565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:35:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251635540] [2025-03-03 22:35:57,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:35:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:35:57,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:35:57,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:35:57,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:35:57,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:35:57,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:57,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:57,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:35:57,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:35:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 22:35:57,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:35:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251635540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:35:57,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:35:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:35:57,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100574609] [2025-03-03 22:35:57,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:35:57,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:35:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:57,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:35:57,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:35:57,634 INFO L87 Difference]: Start difference. First operand has 66 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:35:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:35:57,654 INFO L93 Difference]: Finished difference Result 126 states and 226 transitions. [2025-03-03 22:35:57,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:35:57,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 172 [2025-03-03 22:35:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:35:57,661 INFO L225 Difference]: With dead ends: 126 [2025-03-03 22:35:57,661 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 22:35:57,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:35:57,665 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-03 22:35:57,665 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-03 22:35:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 22:35:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 22:35:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 22:35:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-03-03 22:35:57,693 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 172 [2025-03-03 22:35:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:35:57,693 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-03-03 22:35:57,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:35:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-03-03 22:35:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 22:35:57,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:35:57,696 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:35:57,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:35:57,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:35:57,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:35:57,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:35:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1711964956, now seen corresponding path program 1 times [2025-03-03 22:35:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:35:57,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951176613] [2025-03-03 22:35:57,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:35:57,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:35:58,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:35:58,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:58,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 93 proven. 69 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2025-03-03 22:35:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:35:58,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951176613] [2025-03-03 22:35:58,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951176613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:35:58,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818195542] [2025-03-03 22:35:58,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:35:58,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:35:58,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:35:58,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:35:58,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:35:58,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:35:58,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:35:58,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:35:58,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:35:58,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:35:58,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:35:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 899 proven. 69 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2025-03-03 22:35:59,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:35:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 93 proven. 72 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-03-03 22:35:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818195542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:35:59,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:35:59,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-03 22:35:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598512875] [2025-03-03 22:35:59,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:35:59,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 22:35:59,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:35:59,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 22:35:59,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 22:35:59,679 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-03 22:36:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:00,644 INFO L93 Difference]: Finished difference Result 284 states and 405 transitions. [2025-03-03 22:36:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 22:36:00,645 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 173 [2025-03-03 22:36:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:00,648 INFO L225 Difference]: With dead ends: 284 [2025-03-03 22:36:00,649 INFO L226 Difference]: Without dead ends: 224 [2025-03-03 22:36:00,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 22:36:00,653 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 183 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:00,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 452 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:36:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-03 22:36:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 72. [2025-03-03 22:36:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 22:36:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2025-03-03 22:36:00,685 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 173 [2025-03-03 22:36:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:00,687 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2025-03-03 22:36:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-03 22:36:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2025-03-03 22:36:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 22:36:00,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:00,691 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:00,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:36:00,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 22:36:00,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:00,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1711041435, now seen corresponding path program 1 times [2025-03-03 22:36:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:00,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592782593] [2025-03-03 22:36:00,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:00,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:36:00,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:36:00,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:00,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 22:36:02,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:02,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592782593] [2025-03-03 22:36:02,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592782593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:02,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:02,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:36:02,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422455761] [2025-03-03 22:36:02,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:02,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:36:02,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:02,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:36:02,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:36:02,698 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 22:36:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:03,078 INFO L93 Difference]: Finished difference Result 102 states and 137 transitions. [2025-03-03 22:36:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:36:03,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 173 [2025-03-03 22:36:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:03,080 INFO L225 Difference]: With dead ends: 102 [2025-03-03 22:36:03,080 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 22:36:03,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:36:03,081 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:03,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 526 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:36:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 22:36:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2025-03-03 22:36:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 22:36:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2025-03-03 22:36:03,093 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 173 [2025-03-03 22:36:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:03,094 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2025-03-03 22:36:03,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 22:36:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2025-03-03 22:36:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 22:36:03,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:03,095 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:03,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:36:03,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:03,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1683335805, now seen corresponding path program 1 times [2025-03-03 22:36:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609010029] [2025-03-03 22:36:03,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:03,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:36:03,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:36:03,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:03,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:36:03,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309033496] [2025-03-03 22:36:03,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:03,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:36:03,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:03,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:36:03,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:36:03,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:36:03,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:36:03,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:03,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:03,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:36:03,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:36:03,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:36:03,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:03,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:03,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:36:03,350 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:36:03,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:36:03,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 22:36:03,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:36:03,555 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 22:36:03,622 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:36:03,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:36:03 BoogieIcfgContainer [2025-03-03 22:36:03,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:36:03,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:36:03,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:36:03,626 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:36:03,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:35:57" (3/4) ... [2025-03-03 22:36:03,628 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:36:03,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:36:03,630 INFO L158 Benchmark]: Toolchain (without parser) took 7112.85ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 109.8MB in the beginning and 170.9MB in the end (delta: -61.2MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. [2025-03-03 22:36:03,630 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:03,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.27ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 96.5MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:36:03,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.31ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:03,631 INFO L158 Benchmark]: Boogie Preprocessor took 54.01ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:03,631 INFO L158 Benchmark]: IcfgBuilder took 301.40ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 72.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:36:03,632 INFO L158 Benchmark]: TraceAbstraction took 6489.10ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 71.3MB in the beginning and 171.0MB in the end (delta: -99.7MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2025-03-03 22:36:03,632 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 343.9MB. Free memory was 171.0MB in the beginning and 170.9MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:03,633 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 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.27ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 96.5MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.31ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.01ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 301.40ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 72.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6489.10ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 71.3MB in the beginning and 171.0MB in the end (delta: -99.7MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 343.9MB. Free memory was 171.0MB in the beginning and 170.9MB in the end (delta: 106.2kB). 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 to_int at line 60, overapproximation of to_int at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 999999; [L23] unsigned short int var_1_2 = 5; [L24] signed long int var_1_4 = -2; [L25] signed long int var_1_6 = 0; [L26] signed long int var_1_7 = 5; [L27] signed long int var_1_8 = 255; [L28] signed long int var_1_9 = 25; [L29] unsigned char var_1_10 = 0; [L30] signed long int var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 0; [L34] unsigned char var_1_15 = 0; [L35] unsigned char var_1_16 = 1; [L36] unsigned char var_1_17 = 1; [L37] unsigned char var_1_18 = 64; [L38] signed char var_1_19 = -10; [L39] unsigned char var_1_20 = 5; [L40] unsigned char last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_2=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_2=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L119] RET updateLastVariables() [L120] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L66] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L66] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L70] var_1_6 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_6 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L72] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L74] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L75] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L75] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L77] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L78] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L78] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L80] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L81] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L81] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L82] var_1_11 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L83] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L84] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L84] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L87] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L88] var_1_14 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L89] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L90] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L91] var_1_15 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L92] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L93] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L93] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L95] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L96] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L96] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L97] var_1_17 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L98] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L99] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L99] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L100] var_1_19 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L101] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L102] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L102] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L103] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L103] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=5, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L104] var_1_20 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L105] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L106] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=31, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=31, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L106] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=2, var_1_1=999999, var_1_20=31, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L120] RET updateVariables() [L121] CALL step() [L44] COND TRUE ((var_1_2 + var_1_4) / var_1_19) != last_1_var_1_18 [L45] var_1_18 = var_1_20 VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=999999, var_1_20=31, var_1_2=0, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L47] COND TRUE (var_1_18 / 32) < (((((var_1_18 + var_1_18)) < (var_1_18)) ? ((var_1_18 + var_1_18)) : (var_1_18))) [L48] var_1_1 = ((var_1_6 - var_1_7) - var_1_8) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=0, var_1_20=31, var_1_2=0, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L52] COND TRUE var_1_18 == var_1_18 VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=0, var_1_20=31, var_1_2=0, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L53] COND FALSE !(\read(var_1_10)) [L56] var_1_12 = (((var_1_8 >= var_1_1) || var_1_15) && ((var_1_13 || var_1_16) && var_1_17)) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=0, var_1_20=31, var_1_2=0, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L59] COND TRUE \read(var_1_12) [L60] var_1_9 = (((((var_1_8) < (var_1_6)) ? (var_1_8) : (var_1_6))) - (var_1_11 - 0.8f)) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=0, var_1_20=31, var_1_2=0, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0] [L121] RET step() [L122] CALL, EXPR property() [L112-L113] return (((((var_1_18 / 32) < (((((var_1_18 + var_1_18)) < (var_1_18)) ? ((var_1_18 + var_1_18)) : (var_1_18)))) ? (var_1_1 == ((signed long int) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((signed long int) (var_1_8 - var_1_7)))) && (var_1_12 ? (var_1_9 == ((signed long int) (((((var_1_8) < (var_1_6)) ? (var_1_8) : (var_1_6))) - (var_1_11 - 0.8f)))) : 1)) && ((var_1_18 == var_1_18) ? (var_1_10 ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) (((var_1_8 >= var_1_1) || var_1_15) && ((var_1_13 || var_1_16) && var_1_17))))) : 1)) && ((((var_1_2 + var_1_4) / var_1_19) != last_1_var_1_18) ? (var_1_18 == ((unsigned char) var_1_20)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=0, var_1_20=31, var_1_2=0, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=19] [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=0, var_1_20=31, var_1_2=0, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=19] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=31, var_1_19=2, var_1_1=0, var_1_20=31, var_1_2=0, var_1_4=131, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=19] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 1073 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 779 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 875 IncrementalHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 294 mSDtfsCounter, 875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 518 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=3, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 173 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1209 NumberOfCodeBlocks, 1209 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1030 ConstructedInterpolants, 0 QuantifiedInterpolants, 3007 SizeOfPredicates, 4 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 9478/9744 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:36:03,657 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_no-floats_file-45.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 294b7dcc801896cc0c4607275b340e3835112c15aaaacb8b365f279b8e190761 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:36:05,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:36:05,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:36:05,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:36:05,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:36:05,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:36:05,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:36:05,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:36:05,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:36:05,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:36:05,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:36:05,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:36:05,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:36:05,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:36:05,483 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:36:05,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:36:05,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:36:05,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:36:05,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:36:05,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:36:05,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:36:05,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:36:05,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:36:05,484 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:36:05,484 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:36:05,484 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:36:05,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:36:05,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:36:05,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:36:05,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:36:05,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:36:05,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:36:05,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:36:05,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:36:05,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:05,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:36:05,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:36:05,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:36:05,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:36:05,486 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:36:05,486 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:36:05,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:36:05,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:36:05,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:36:05,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:36:05,487 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 -> 294b7dcc801896cc0c4607275b340e3835112c15aaaacb8b365f279b8e190761 [2025-03-03 22:36:05,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:36:05,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:36:05,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:36:05,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:36:05,733 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:36:05,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2025-03-03 22:36:06,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27d5d43ab/db4ed7c0aedb4d9a9c827d2e8d712e63/FLAG15297f2ee [2025-03-03 22:36:07,025 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:36:07,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2025-03-03 22:36:07,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27d5d43ab/db4ed7c0aedb4d9a9c827d2e8d712e63/FLAG15297f2ee [2025-03-03 22:36:07,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27d5d43ab/db4ed7c0aedb4d9a9c827d2e8d712e63 [2025-03-03 22:36:07,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:36:07,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:36:07,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:07,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:36:07,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:36:07,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da4404c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07, skipping insertion in model container [2025-03-03 22:36:07,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:36:07,550 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_no-floats_file-45.i[916,929] [2025-03-03 22:36:07,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:07,609 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:36:07,616 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_no-floats_file-45.i[916,929] [2025-03-03 22:36:07,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:07,661 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:36:07,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07 WrapperNode [2025-03-03 22:36:07,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:07,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:07,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:36:07,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:36:07,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,700 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-03-03 22:36:07,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:07,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:36:07,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:36:07,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:36:07,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,719 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:36:07,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:36:07,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:36:07,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:36:07,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:36:07,736 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (1/1) ... [2025-03-03 22:36:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:07,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:07,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:36:07,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:36:07,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:36:07,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:36:07,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:36:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:36:07,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:36:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:36:07,847 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:36:07,849 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:36:13,066 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:36:13,067 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:36:13,073 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:36:13,073 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:36:13,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:13 BoogieIcfgContainer [2025-03-03 22:36:13,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:36:13,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:36:13,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:36:13,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:36:13,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:07" (1/3) ... [2025-03-03 22:36:13,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c02c742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:13, skipping insertion in model container [2025-03-03 22:36:13,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:07" (2/3) ... [2025-03-03 22:36:13,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c02c742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:13, skipping insertion in model container [2025-03-03 22:36:13,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:13" (3/3) ... [2025-03-03 22:36:13,081 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-45.i [2025-03-03 22:36:13,090 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:36:13,091 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-45.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:36:13,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:36:13,136 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;@7e0bf7b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:36:13,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:36:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 22:36:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:36:13,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:13,146 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:13,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:13,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:13,151 INFO L85 PathProgramCache]: Analyzing trace with hash -124152610, now seen corresponding path program 1 times [2025-03-03 22:36:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:13,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414760923] [2025-03-03 22:36:13,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:13,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:13,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:13,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:36:13,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 22:36:13,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:36:13,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:36:13,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:13,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:13,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:36:13,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-03-03 22:36:13,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:13,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:36:13,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414760923] [2025-03-03 22:36:13,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414760923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:13,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:36:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458807466] [2025-03-03 22:36:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:13,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:36:13,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:36:13,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:36:13,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:13,423 INFO L87 Difference]: Start difference. First operand has 66 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:36:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:13,440 INFO L93 Difference]: Finished difference Result 126 states and 226 transitions. [2025-03-03 22:36:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:36:13,442 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 172 [2025-03-03 22:36:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:13,448 INFO L225 Difference]: With dead ends: 126 [2025-03-03 22:36:13,448 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 22:36:13,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:13,452 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-03 22:36:13,452 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-03 22:36:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 22:36:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 22:36:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 22:36:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-03-03 22:36:13,482 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 172 [2025-03-03 22:36:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:13,482 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-03-03 22:36:13,483 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 22:36:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-03-03 22:36:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 22:36:13,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:13,487 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:13,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:36:13,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:13,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:13,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1711964956, now seen corresponding path program 1 times [2025-03-03 22:36:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465846054] [2025-03-03 22:36:13,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:13,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:36:13,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 22:36:13,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:36:13,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:36:13,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:13,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:13,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 22:36:13,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 899 proven. 69 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2025-03-03 22:36:14,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:36:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 93 proven. 72 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-03-03 22:36:15,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:36:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465846054] [2025-03-03 22:36:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465846054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:36:15,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:36:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-03 22:36:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183956620] [2025-03-03 22:36:15,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:36:15,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:36:15,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:36:15,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:36:15,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:36:15,046 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-03 22:36:17,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:36:19,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:36:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:20,129 INFO L93 Difference]: Finished difference Result 211 states and 303 transitions. [2025-03-03 22:36:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 22:36:20,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 173 [2025-03-03 22:36:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:20,132 INFO L225 Difference]: With dead ends: 211 [2025-03-03 22:36:20,132 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 22:36:20,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 22:36:20,135 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 175 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:20,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 275 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 22:36:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 22:36:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 72. [2025-03-03 22:36:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 22:36:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2025-03-03 22:36:20,152 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 173 [2025-03-03 22:36:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:20,153 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2025-03-03 22:36:20,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-03 22:36:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2025-03-03 22:36:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 22:36:20,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:20,155 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:20,162 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-03 22:36:20,356 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-03 22:36:20,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:20,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1711041435, now seen corresponding path program 1 times [2025-03-03 22:36:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304886723] [2025-03-03 22:36:20,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:20,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:20,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:20,360 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-03 22:36:20,361 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-03 22:36:20,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:36:20,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:36:20,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:20,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:20,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:36:20,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:36:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:36:20,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:20,654 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-03-03 22:36:20,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [647827625] [2025-03-03 22:36:20,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 22:36:20,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 22:36:20,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 22:36:20,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 22:36:20,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:36:21,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:36:21,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:21,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:21,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 22:36:21,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:42,252 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:36:50,420 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:36:58,531 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:37:06,619 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:37:20,964 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 22:37:29,070 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)