./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:53:35,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:53:35,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:53:35,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:53:35,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:53:35,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:53:35,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:53:35,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:53:35,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:53:35,879 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:53:35,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:53:35,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:53:35,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:53:35,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:53:35,880 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:53:35,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:53:35,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:53:35,881 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:53:35,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:53:35,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:53:35,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:53:35,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:53:35,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:53:35,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:53:35,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:53:35,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:53:35,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:53:35,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:53:35,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:53:35,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:53:35,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:53:35,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:53:35,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:53:35,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:53:35,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:53:35,883 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-jdk21/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 -> fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f [2025-02-05 22:53:36,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:53:36,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:53:36,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:53:36,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:53:36,142 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:53:36,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2025-02-05 22:53:37,309 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af89dc4a8/c1c61e37fdf84da19d29e2dedfcdf030/FLAGca5c9a4a3 [2025-02-05 22:53:37,577 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:53:37,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2025-02-05 22:53:37,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af89dc4a8/c1c61e37fdf84da19d29e2dedfcdf030/FLAGca5c9a4a3 [2025-02-05 22:53:37,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af89dc4a8/c1c61e37fdf84da19d29e2dedfcdf030 [2025-02-05 22:53:37,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:53:37,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:53:37,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:53:37,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:53:37,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:53:37,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3266f5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37, skipping insertion in model container [2025-02-05 22:53:37,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:53:37,700 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i[919,932] [2025-02-05 22:53:37,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:53:37,746 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:53:37,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i[919,932] [2025-02-05 22:53:37,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:53:37,782 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:53:37,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37 WrapperNode [2025-02-05 22:53:37,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:53:37,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:53:37,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:53:37,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:53:37,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,813 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-02-05 22:53:37,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:53:37,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:53:37,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:53:37,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:53:37,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,838 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-02-05 22:53:37,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:53:37,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:53:37,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:53:37,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:53:37,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (1/1) ... [2025-02-05 22:53:37,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:53:37,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:37,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:53:37,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:53:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:53:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:53:37,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:53:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:53:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:53:37,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:53:37,957 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:53:37,958 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:53:38,247 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:53:38,247 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:53:38,254 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:53:38,254 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:53:38,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:38 BoogieIcfgContainer [2025-02-05 22:53:38,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:53:38,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:53:38,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:53:38,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:53:38,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:53:37" (1/3) ... [2025-02-05 22:53:38,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f09c07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:53:38, skipping insertion in model container [2025-02-05 22:53:38,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:37" (2/3) ... [2025-02-05 22:53:38,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f09c07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:53:38, skipping insertion in model container [2025-02-05 22:53:38,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:38" (3/3) ... [2025-02-05 22:53:38,262 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2025-02-05 22:53:38,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:53:38,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:53:38,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:53:38,339 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;@7e78c90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:53:38,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:53:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:53:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 22:53:38,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:38,356 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:38,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:38,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 76325254, now seen corresponding path program 1 times [2025-02-05 22:53:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197065748] [2025-02-05 22:53:38,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:38,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 22:53:38,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 22:53:38,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:38,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 22:53:38,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:38,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197065748] [2025-02-05 22:53:38,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197065748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:53:38,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670892850] [2025-02-05 22:53:38,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:38,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:38,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:38,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:53:38,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:53:38,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 22:53:38,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 22:53:38,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:38,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:38,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:53:38,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 22:53:38,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:53:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670892850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:38,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:53:38,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:53:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848035730] [2025-02-05 22:53:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:38,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:53:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:38,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:53:38,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:53:38,792 INFO L87 Difference]: Start difference. First operand has 83 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:53:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:38,813 INFO L93 Difference]: Finished difference Result 158 states and 272 transitions. [2025-02-05 22:53:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:53:38,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2025-02-05 22:53:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:38,824 INFO L225 Difference]: With dead ends: 158 [2025-02-05 22:53:38,826 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 22:53:38,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-02-05 22:53:38,839 INFO L435 NwaCegarLoop]: 118 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, 118 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-02-05 22:53:38,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:53:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 22:53:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-05 22:53:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:53:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2025-02-05 22:53:38,885 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 155 [2025-02-05 22:53:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2025-02-05 22:53:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:53:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2025-02-05 22:53:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 22:53:38,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:38,891 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:38,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:53:39,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:53:39,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:39,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1296689729, now seen corresponding path program 1 times [2025-02-05 22:53:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:39,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033334928] [2025-02-05 22:53:39,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:39,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 22:53:39,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 22:53:39,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:39,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:53:39,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:39,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033334928] [2025-02-05 22:53:39,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033334928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:39,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:39,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:53:39,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812493318] [2025-02-05 22:53:39,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:39,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:53:39,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:39,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:53:39,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:53:39,311 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:39,361 INFO L93 Difference]: Finished difference Result 195 states and 292 transitions. [2025-02-05 22:53:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:53:39,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2025-02-05 22:53:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:39,363 INFO L225 Difference]: With dead ends: 195 [2025-02-05 22:53:39,365 INFO L226 Difference]: Without dead ends: 120 [2025-02-05 22:53:39,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:53:39,366 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 59 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:39,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 260 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:53:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-05 22:53:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2025-02-05 22:53:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 78 states have internal predecessors, (100), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 22:53:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2025-02-05 22:53:39,383 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 155 [2025-02-05 22:53:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:39,383 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2025-02-05 22:53:39,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2025-02-05 22:53:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 22:53:39,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:39,385 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:39,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:53:39,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:39,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1692027712, now seen corresponding path program 1 times [2025-02-05 22:53:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046060414] [2025-02-05 22:53:39,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:39,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:39,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 22:53:39,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 22:53:39,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:39,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:53:39,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:39,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046060414] [2025-02-05 22:53:39,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046060414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:39,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:39,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:53:39,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64849073] [2025-02-05 22:53:39,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:39,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:53:39,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:39,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:53:39,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:53:39,635 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:39,790 INFO L93 Difference]: Finished difference Result 319 states and 477 transitions. [2025-02-05 22:53:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:53:39,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2025-02-05 22:53:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:39,793 INFO L225 Difference]: With dead ends: 319 [2025-02-05 22:53:39,793 INFO L226 Difference]: Without dead ends: 205 [2025-02-05 22:53:39,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:53:39,795 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 79 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:39,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 326 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:53:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-05 22:53:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 162. [2025-02-05 22:53:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 99 states have internal predecessors, (121), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:53:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 241 transitions. [2025-02-05 22:53:39,817 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 241 transitions. Word has length 156 [2025-02-05 22:53:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:39,818 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 241 transitions. [2025-02-05 22:53:39,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 241 transitions. [2025-02-05 22:53:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 22:53:39,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:39,820 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:39,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:53:39,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:39,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1771885722, now seen corresponding path program 1 times [2025-02-05 22:53:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:39,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905164525] [2025-02-05 22:53:39,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:39,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 22:53:39,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 22:53:39,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:39,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:53:40,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:40,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905164525] [2025-02-05 22:53:40,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905164525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:53:40,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665456423] [2025-02-05 22:53:40,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:40,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:40,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:40,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:53:40,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:53:40,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 22:53:40,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 22:53:40,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:40,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:40,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:53:40,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-02-05 22:53:40,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:53:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:53:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665456423] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:53:40,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:53:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 22:53:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754245824] [2025-02-05 22:53:40,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:53:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:53:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:40,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:53:40,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:53:40,574 INFO L87 Difference]: Start difference. First operand 162 states and 241 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 22:53:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:40,712 INFO L93 Difference]: Finished difference Result 246 states and 360 transitions. [2025-02-05 22:53:40,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:53:40,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 157 [2025-02-05 22:53:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:40,714 INFO L225 Difference]: With dead ends: 246 [2025-02-05 22:53:40,715 INFO L226 Difference]: Without dead ends: 132 [2025-02-05 22:53:40,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:53:40,716 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 59 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:40,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 192 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:53:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-05 22:53:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2025-02-05 22:53:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:53:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2025-02-05 22:53:40,728 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 157 [2025-02-05 22:53:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:40,729 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2025-02-05 22:53:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 22:53:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2025-02-05 22:53:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 22:53:40,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:40,730 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:40,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:53:40,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:40,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:40,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash 312070788, now seen corresponding path program 1 times [2025-02-05 22:53:40,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:40,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024809432] [2025-02-05 22:53:40,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:40,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 22:53:40,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 22:53:40,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:40,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:53:41,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:41,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024809432] [2025-02-05 22:53:41,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024809432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:41,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:41,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:53:41,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690515676] [2025-02-05 22:53:41,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:41,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:53:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:41,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:53:41,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:53:41,227 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:41,384 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2025-02-05 22:53:41,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:53:41,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2025-02-05 22:53:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:41,386 INFO L225 Difference]: With dead ends: 305 [2025-02-05 22:53:41,386 INFO L226 Difference]: Without dead ends: 223 [2025-02-05 22:53:41,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:53:41,387 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 132 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:41,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 250 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:53:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-05 22:53:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184. [2025-02-05 22:53:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 117 states have (on average 1.170940170940171) internal successors, (137), 118 states have internal predecessors, (137), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:53:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 257 transitions. [2025-02-05 22:53:41,432 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 257 transitions. Word has length 158 [2025-02-05 22:53:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:41,432 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 257 transitions. [2025-02-05 22:53:41,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 257 transitions. [2025-02-05 22:53:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 22:53:41,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:41,435 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:41,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:53:41,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:41,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:41,436 INFO L85 PathProgramCache]: Analyzing trace with hash -390001342, now seen corresponding path program 1 times [2025-02-05 22:53:41,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:41,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299901733] [2025-02-05 22:53:41,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:41,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:41,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 22:53:41,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 22:53:41,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:41,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:53:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:41,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299901733] [2025-02-05 22:53:41,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299901733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:41,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:41,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:53:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921956574] [2025-02-05 22:53:41,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:41,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:53:41,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:41,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:53:41,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:53:41,514 INFO L87 Difference]: Start difference. First operand 184 states and 257 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:41,562 INFO L93 Difference]: Finished difference Result 276 states and 382 transitions. [2025-02-05 22:53:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:53:41,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2025-02-05 22:53:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:41,566 INFO L225 Difference]: With dead ends: 276 [2025-02-05 22:53:41,566 INFO L226 Difference]: Without dead ends: 148 [2025-02-05 22:53:41,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:53:41,567 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 93 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:41,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 113 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:53:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-05 22:53:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2025-02-05 22:53:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.108433734939759) internal successors, (92), 83 states have internal predecessors, (92), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:53:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 184 transitions. [2025-02-05 22:53:41,592 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 184 transitions. Word has length 158 [2025-02-05 22:53:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 184 transitions. [2025-02-05 22:53:41,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2025-02-05 22:53:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 22:53:41,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:41,594 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:41,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:53:41,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:41,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash -389077821, now seen corresponding path program 1 times [2025-02-05 22:53:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:41,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105055591] [2025-02-05 22:53:41,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:41,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 22:53:41,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 22:53:41,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:41,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:53:41,655 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:53:41,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 22:53:41,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 22:53:41,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:41,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:53:41,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:53:41,787 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:53:41,788 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:53:41,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:53:41,791 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:41,873 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:53:41,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:53:41 BoogieIcfgContainer [2025-02-05 22:53:41,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:53:41,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:53:41,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:53:41,876 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:53:41,876 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:38" (3/4) ... [2025-02-05 22:53:41,879 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:53:41,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:53:41,880 INFO L158 Benchmark]: Toolchain (without parser) took 4284.18ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 108.5MB in the beginning and 219.0MB in the end (delta: -110.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2025-02-05 22:53:41,880 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:53:41,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.14ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 93.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:53:41,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.37ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:53:41,881 INFO L158 Benchmark]: Boogie Preprocessor took 40.22ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:53:41,881 INFO L158 Benchmark]: IcfgBuilder took 400.35ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 67.2MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:53:41,881 INFO L158 Benchmark]: TraceAbstraction took 3617.86ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 67.2MB in the beginning and 219.1MB in the end (delta: -151.8MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2025-02-05 22:53:41,881 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 285.2MB. Free memory was 219.1MB in the beginning and 219.0MB in the end (delta: 83.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:53:41,884 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.14ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 93.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.37ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.22ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 400.35ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 67.2MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3617.86ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 67.2MB in the beginning and 219.1MB in the end (delta: -151.8MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 285.2MB. Free memory was 219.1MB in the beginning and 219.0MB in the end (delta: 83.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someUnaryDOUBLEoperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed long int var_1_34 = -10; [L44] double var_1_36 = 4.85; [L45] double var_1_38 = 15.75; [L46] signed char var_1_39 = -100; [L47] signed short int var_1_41 = -32; [L48] signed char var_1_42 = 4; [L49] signed char var_1_43 = -8; [L50] signed short int var_1_44 = -25; [L51] signed char last_1_var_1_10 = -5; [L52] signed long int last_1_var_1_21 = 1; [L53] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_21 = var_1_21 [L193] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L151] var_1_3 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L152] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L153] var_1_4 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L154] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L155] var_1_7 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L157] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L157] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L158] var_1_8 = __VERIFIER_nondet_short() [L159] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=256] [L159] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=256] [L160] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=256] [L160] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=256] [L161] var_1_9 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L162] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L163] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L163] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L164] var_1_11 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L165] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L166] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L166] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L167] var_1_13 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L168] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L169] var_1_14 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L170] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L171] var_1_15 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L172] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L173] var_1_16 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L174] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L175] var_1_20 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L176] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L177] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L177] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L178] var_1_22 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L179] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L180] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L180] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L181] var_1_23 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L182] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L183] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L183] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L184] var_1_38 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L186] var_1_43 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L187] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L188] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L188] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L204] RET updateVariables() [L205] CALL step() [L57] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L58] COND TRUE var_1_11 <= last_1_var_1_25 [L59] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L62] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L63] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L64] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=-1, var_1_9=133] [L68] COND TRUE (! var_1_19) || var_1_19 [L69] var_1_44 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L81] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L82] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L89] var_1_34 = ((((128) < (((((var_1_8) > ((-5 + var_1_9))) ? (var_1_8) : ((-5 + var_1_9)))))) ? (128) : (((((var_1_8) > ((-5 + var_1_9))) ? (var_1_8) : ((-5 + var_1_9))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L90] COND TRUE var_1_9 <= var_1_9 [L91] var_1_42 = ((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L93] COND FALSE !(\read(var_1_19)) [L96] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L98] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L99] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L102] COND FALSE !(var_1_8 >= 25) [L113] var_1_26 = var_1_8 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L117] COND FALSE !(\read(var_1_19)) [L120] var_1_36 = ((((var_1_15) > (var_1_38)) ? (var_1_15) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-100, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L122] var_1_39 = var_1_11 [L123] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L124] COND TRUE var_1_19 || stepLocal_0 [L125] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L129] signed long int stepLocal_3 = var_1_22 + var_1_11; [L130] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=16263, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L131] COND FALSE !(\read(var_1_20)) [L144] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=16263, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=133, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L146] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=16263, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=133, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=133, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=133, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000006, var_1_15=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=133, var_1_22=16390, var_1_23=16384, var_1_25=-127, var_1_26=-1, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-5, var_1_7=16383, var_1_8=-1, var_1_9=133] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 1259 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 551 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 708 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 6 MinimizatonAttempts, 101 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1409 NumberOfCodeBlocks, 1409 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1399 ConstructedInterpolants, 0 QuantifiedInterpolants, 2209 SizeOfPredicates, 1 NumberOfNonLiveVariables, 757 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 9001/9108 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-02-05 22:53:41,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:53:44,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:53:44,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:53:44,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:53:44,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:53:44,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:53:44,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:53:44,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:53:44,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:53:44,260 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:53:44,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:53:44,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:53:44,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:53:44,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:53:44,260 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:53:44,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:53:44,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:53:44,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:53:44,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:53:44,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:53:44,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:53:44,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:53:44,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:53:44,263 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-jdk21/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 -> fb001b1eda7dbc98350c0ec0af56acebc2e34bf2aac7fab255c878fcc02f2c5f [2025-02-05 22:53:44,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:53:44,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:53:44,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:53:44,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:53:44,509 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:53:44,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2025-02-05 22:53:45,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8174cc4d2/b52a86d5c41644298790b37e53e10dc2/FLAG7dedb5bc5 [2025-02-05 22:53:45,966 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:53:45,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2025-02-05 22:53:45,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8174cc4d2/b52a86d5c41644298790b37e53e10dc2/FLAG7dedb5bc5 [2025-02-05 22:53:46,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8174cc4d2/b52a86d5c41644298790b37e53e10dc2 [2025-02-05 22:53:46,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:53:46,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:53:46,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:53:46,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:53:46,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:53:46,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3522d2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46, skipping insertion in model container [2025-02-05 22:53:46,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:53:46,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i[919,932] [2025-02-05 22:53:46,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:53:46,546 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:53:46,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i[919,932] [2025-02-05 22:53:46,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:53:46,600 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:53:46,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46 WrapperNode [2025-02-05 22:53:46,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:53:46,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:53:46,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:53:46,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:53:46,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,648 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-02-05 22:53:46,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:53:46,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:53:46,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:53:46,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:53:46,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,683 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-02-05 22:53:46,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:53:46,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:53:46,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:53:46,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:53:46,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (1/1) ... [2025-02-05 22:53:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:53:46,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:46,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:53:46,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:53:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:53:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:53:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:53:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:53:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:53:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:53:46,841 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:53:46,843 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:53:54,908 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:53:54,908 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:53:54,919 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:53:54,920 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:53:54,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:54 BoogieIcfgContainer [2025-02-05 22:53:54,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:53:54,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:53:54,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:53:54,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:53:54,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:53:46" (1/3) ... [2025-02-05 22:53:54,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f298196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:53:54, skipping insertion in model container [2025-02-05 22:53:54,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:46" (2/3) ... [2025-02-05 22:53:54,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f298196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:53:54, skipping insertion in model container [2025-02-05 22:53:54,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:54" (3/3) ... [2025-02-05 22:53:54,926 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i [2025-02-05 22:53:54,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:53:54,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-15.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:53:54,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:53:54,976 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;@3a534518, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:53:54,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:53:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:53:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 22:53:54,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:54,987 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:54,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:54,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash 76325254, now seen corresponding path program 1 times [2025-02-05 22:53:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:53:54,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366141847] [2025-02-05 22:53:54,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:54,999 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-02-05 22:53:54,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:53:55,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 22:53:55,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:53:55,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 22:53:55,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 22:53:55,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:55,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:55,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:53:55,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2025-02-05 22:53:55,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:53:55,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:53:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366141847] [2025-02-05 22:53:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366141847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:55,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:55,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:53:55,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826137985] [2025-02-05 22:53:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:55,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:53:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:53:55,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:53:55,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:53:55,651 INFO L87 Difference]: Start difference. First operand has 83 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:53:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:55,671 INFO L93 Difference]: Finished difference Result 158 states and 272 transitions. [2025-02-05 22:53:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:53:55,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2025-02-05 22:53:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:55,677 INFO L225 Difference]: With dead ends: 158 [2025-02-05 22:53:55,677 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 22:53:55,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-02-05 22:53:55,682 INFO L435 NwaCegarLoop]: 118 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, 118 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-02-05 22:53:55,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:53:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 22:53:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-05 22:53:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:53:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2025-02-05 22:53:55,710 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 155 [2025-02-05 22:53:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:55,711 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2025-02-05 22:53:55,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:53:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2025-02-05 22:53:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 22:53:55,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:55,714 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:53:55,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-05 22:53:55,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 22:53:55,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:55,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1296689729, now seen corresponding path program 1 times [2025-02-05 22:53:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:53:55,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356014353] [2025-02-05 22:53:55,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:55,917 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-02-05 22:53:55,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:53:55,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 22:53:55,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:53:55,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 22:53:56,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 22:53:56,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:56,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:56,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 22:53:56,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:53:57,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:53:57,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:53:57,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356014353] [2025-02-05 22:53:57,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356014353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:57,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:57,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:53:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619551808] [2025-02-05 22:53:57,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:57,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:53:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:53:57,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:53:57,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:53:57,806 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:53:59,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:01,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:54:01,084 INFO L93 Difference]: Finished difference Result 229 states and 349 transitions. [2025-02-05 22:54:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:54:01,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2025-02-05 22:54:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:54:01,106 INFO L225 Difference]: With dead ends: 229 [2025-02-05 22:54:01,106 INFO L226 Difference]: Without dead ends: 154 [2025-02-05 22:54:01,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:54:01,107 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 73 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:54:01,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 328 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 22:54:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-05 22:54:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2025-02-05 22:54:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:54:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2025-02-05 22:54:01,141 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 155 [2025-02-05 22:54:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:54:01,142 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2025-02-05 22:54:01,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:54:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2025-02-05 22:54:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 22:54:01,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:54:01,146 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:54:01,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:54:01,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 22:54:01,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:54:01,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:54:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash 300050215, now seen corresponding path program 1 times [2025-02-05 22:54:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:54:01,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611320756] [2025-02-05 22:54:01,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:01,351 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-02-05 22:54:01,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:54:01,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 22:54:01,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:54:01,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 22:54:01,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 22:54:01,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:01,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:01,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 22:54:01,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:54:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:54:03,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:54:03,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:54:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611320756] [2025-02-05 22:54:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611320756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:54:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:54:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:54:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055759385] [2025-02-05 22:54:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:54:03,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:54:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:54:03,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:54:03,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:54:03,844 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:54:05,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:11,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:14,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:54:16,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:20,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:54:24,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:54:30,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:54:32,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:54:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:54:32,612 INFO L93 Difference]: Finished difference Result 273 states and 415 transitions. [2025-02-05 22:54:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:54:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2025-02-05 22:54:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:54:32,632 INFO L225 Difference]: With dead ends: 273 [2025-02-05 22:54:32,632 INFO L226 Difference]: Without dead ends: 198 [2025-02-05 22:54:32,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:54:32,633 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 115 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:54:32,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 299 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 27.9s Time] [2025-02-05 22:54:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-05 22:54:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 126. [2025-02-05 22:54:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:54:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2025-02-05 22:54:32,674 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 156 [2025-02-05 22:54:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:54:32,676 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2025-02-05 22:54:32,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:54:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2025-02-05 22:54:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 22:54:32,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:54:32,678 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:54:32,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-05 22:54:32,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-05 22:54:32,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:54:32,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:54:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash -697022138, now seen corresponding path program 1 times [2025-02-05 22:54:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:54:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784676641] [2025-02-05 22:54:32,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:32,884 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-02-05 22:54:32,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:54:32,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-05 22:54:32,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (5)] Waiting until timeout for monitored process [2025-02-05 22:54:32,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 22:54:33,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 22:54:33,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:33,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:54:33,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:54:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 504 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-02-05 22:54:35,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:54:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:54:35,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:54:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784676641] [2025-02-05 22:54:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784676641] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:54:35,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:54:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-05 22:54:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697742907] [2025-02-05 22:54:35,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:54:35,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:54:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:54:35,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:54:35,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:54:35,892 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-05 22:54:37,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:39,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:42,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:44,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:46,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:54:46,948 INFO L93 Difference]: Finished difference Result 294 states and 432 transitions. [2025-02-05 22:54:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 22:54:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 156 [2025-02-05 22:54:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:54:46,962 INFO L225 Difference]: With dead ends: 294 [2025-02-05 22:54:46,962 INFO L226 Difference]: Without dead ends: 216 [2025-02-05 22:54:46,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-02-05 22:54:46,963 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 344 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:54:46,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 387 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2025-02-05 22:54:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-05 22:54:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 131. [2025-02-05 22:54:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:54:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 190 transitions. [2025-02-05 22:54:46,993 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 190 transitions. Word has length 156 [2025-02-05 22:54:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:54:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 190 transitions. [2025-02-05 22:54:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-02-05 22:54:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 190 transitions. [2025-02-05 22:54:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 22:54:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:54:46,997 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:54:47,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (5)] Forceful destruction successful, exit code 0 [2025-02-05 22:54:47,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-05 22:54:47,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:54:47,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:54:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1389314715, now seen corresponding path program 1 times [2025-02-05 22:54:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:54:47,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023535356] [2025-02-05 22:54:47,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:47,202 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-02-05 22:54:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:54:47,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-05 22:54:47,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Waiting until timeout for monitored process [2025-02-05 22:54:47,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 22:54:47,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 22:54:47,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:47,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:47,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:54:47,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:54:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-02-05 22:54:47,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:54:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:54:48,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:54:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023535356] [2025-02-05 22:54:48,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023535356] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:54:48,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:54:48,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-02-05 22:54:48,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744880214] [2025-02-05 22:54:48,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:54:48,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:54:48,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:54:48,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:54:48,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:54:48,032 INFO L87 Difference]: Start difference. First operand 131 states and 190 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 22:54:49,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:54:49,965 INFO L93 Difference]: Finished difference Result 223 states and 315 transitions. [2025-02-05 22:54:49,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:54:49,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 157 [2025-02-05 22:54:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:54:49,983 INFO L225 Difference]: With dead ends: 223 [2025-02-05 22:54:49,985 INFO L226 Difference]: Without dead ends: 144 [2025-02-05 22:54:49,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:54:49,988 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 196 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:54:49,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 182 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 22:54:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-05 22:54:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2025-02-05 22:54:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:54:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2025-02-05 22:54:50,022 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 157 [2025-02-05 22:54:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:54:50,023 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2025-02-05 22:54:50,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 22:54:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2025-02-05 22:54:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 22:54:50,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:54:50,028 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:54:50,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Ended with exit code 0 [2025-02-05 22:54:50,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-02-05 22:54:50,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:54:50,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:54:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash 982172034, now seen corresponding path program 1 times [2025-02-05 22:54:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:54:50,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722014640] [2025-02-05 22:54:50,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:50,234 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-02-05 22:54:50,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:54:50,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-02-05 22:54:50,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (7)] Waiting until timeout for monitored process [2025-02-05 22:54:50,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 22:54:50,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 22:54:50,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:50,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:50,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:54:50,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:54:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-02-05 22:54:50,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:54:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:54:51,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:54:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722014640] [2025-02-05 22:54:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722014640] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:54:51,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:54:51,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-02-05 22:54:51,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091911554] [2025-02-05 22:54:51,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:54:51,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:54:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:54:51,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:54:51,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:54:51,322 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 22:54:54,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:54:54,265 INFO L93 Difference]: Finished difference Result 224 states and 296 transitions. [2025-02-05 22:54:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:54:54,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 159 [2025-02-05 22:54:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:54:54,283 INFO L225 Difference]: With dead ends: 224 [2025-02-05 22:54:54,283 INFO L226 Difference]: Without dead ends: 144 [2025-02-05 22:54:54,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:54:54,284 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 183 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:54:54,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 182 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 22:54:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-05 22:54:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2025-02-05 22:54:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 states have internal predecessors, (89), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:54:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2025-02-05 22:54:54,303 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 159 [2025-02-05 22:54:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:54:54,303 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2025-02-05 22:54:54,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 22:54:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2025-02-05 22:54:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 22:54:54,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:54:54,305 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:54:54,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (7)] Ended with exit code 0 [2025-02-05 22:54:54,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-02-05 22:54:54,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:54:54,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:54:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1569984927, now seen corresponding path program 1 times [2025-02-05 22:54:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:54:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668833104] [2025-02-05 22:54:54,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:54,510 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-02-05 22:54:54,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:54:54,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-02-05 22:54:54,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (8)] Waiting until timeout for monitored process [2025-02-05 22:54:54,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 22:54:54,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 22:54:54,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:54,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:54,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 22:54:54,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:13,205 WARN L286 SmtUtils]: Spent 5.35s 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)