./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:33:00,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:33:00,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:33:00,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:33:00,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:33:00,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:33:00,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:33:00,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:33:00,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:33:00,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:33:00,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:33:00,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:33:00,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:33:00,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:33:00,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:33:00,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:33:00,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:33:00,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:33:00,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:33:00,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:33:00,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:33:00,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:00,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:33:00,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:33:00,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:33:00,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:33:00,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:33:00,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:33:00,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:33:00,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:33:00,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:33:00,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:33:00,872 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2025-03-03 19:33:01,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:33:01,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:33:01,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:33:01,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:33:01,093 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:33:01,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-03-03 19:33:02,207 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea302f41/44732361cef046eaa77382f14e3ba33c/FLAG56a5677a4 [2025-03-03 19:33:02,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:33:02,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-03-03 19:33:02,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea302f41/44732361cef046eaa77382f14e3ba33c/FLAG56a5677a4 [2025-03-03 19:33:02,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea302f41/44732361cef046eaa77382f14e3ba33c [2025-03-03 19:33:02,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:33:02,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:33:02,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:02,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:33:02,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:33:02,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02, skipping insertion in model container [2025-03-03 19:33:02,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:33:02,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2025-03-03 19:33:02,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:33:02,690 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:33:02,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2025-03-03 19:33:02,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:33:02,748 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:33:02,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02 WrapperNode [2025-03-03 19:33:02,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:02,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:33:02,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:33:02,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:33:02,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,791 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2025-03-03 19:33:02,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:33:02,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:33:02,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:33:02,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:33:02,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,830 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:33:02,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:33:02,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:33:02,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:33:02,860 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:33:02,861 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (1/1) ... [2025-03-03 19:33:02,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:02,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:33:02,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:33:02,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:33:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:33:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:33:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:33:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:33:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:33:02,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:33:02,962 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:33:02,964 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:33:03,238 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 19:33:03,240 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:33:03,247 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:33:03,248 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:33:03,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:03 BoogieIcfgContainer [2025-03-03 19:33:03,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:33:03,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:33:03,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:33:03,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:33:03,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:33:02" (1/3) ... [2025-03-03 19:33:03,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bbdf07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:33:03, skipping insertion in model container [2025-03-03 19:33:03,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:02" (2/3) ... [2025-03-03 19:33:03,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bbdf07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:33:03, skipping insertion in model container [2025-03-03 19:33:03,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:03" (3/3) ... [2025-03-03 19:33:03,257 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-03-03 19:33:03,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:33:03,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:33:03,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:33:03,329 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;@510be7dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:33:03,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:33:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:33:03,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:33:03,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:03,346 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:03,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:03,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:03,351 INFO L85 PathProgramCache]: Analyzing trace with hash -638509962, now seen corresponding path program 1 times [2025-03-03 19:33:03,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:03,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554322707] [2025-03-03 19:33:03,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:03,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:33:03,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:33:03,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 19:33:03,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:33:03,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554322707] [2025-03-03 19:33:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554322707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:33:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891618387] [2025-03-03 19:33:03,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:03,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:33:03,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:33:03,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:33:03,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:33:03,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:33:03,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:33:03,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:03,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:03,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:33:03,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:33:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 19:33:03,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:33:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891618387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:33:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:33:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105126633] [2025-03-03 19:33:03,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:03,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:33:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:33:03,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:33:03,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:33:03,882 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:33:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:03,898 INFO L93 Difference]: Finished difference Result 142 states and 248 transitions. [2025-03-03 19:33:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:33:03,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2025-03-03 19:33:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:03,904 INFO L225 Difference]: With dead ends: 142 [2025-03-03 19:33:03,904 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 19:33:03,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:33:03,908 INFO L435 NwaCegarLoop]: 108 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, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:03,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:33:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 19:33:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 19:33:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:33:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2025-03-03 19:33:03,940 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 171 [2025-03-03 19:33:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:03,941 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2025-03-03 19:33:03,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:33:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2025-03-03 19:33:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:33:03,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:03,943 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:03,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:33:04,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:33:04,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:04,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash 256520347, now seen corresponding path program 1 times [2025-03-03 19:33:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813198580] [2025-03-03 19:33:04,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:04,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:33:04,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:33:04,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:04,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:33:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:33:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813198580] [2025-03-03 19:33:04,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813198580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:04,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:33:04,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:33:04,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062449067] [2025-03-03 19:33:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:04,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:33:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:33:04,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:33:04,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:33:04,689 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:33:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:04,857 INFO L93 Difference]: Finished difference Result 222 states and 339 transitions. [2025-03-03 19:33:04,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:33:04,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-03 19:33:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:04,861 INFO L225 Difference]: With dead ends: 222 [2025-03-03 19:33:04,862 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 19:33:04,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-03 19:33:04,864 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 81 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:04,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 323 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:33:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 19:33:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137. [2025-03-03 19:33:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 19:33:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2025-03-03 19:33:04,890 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 171 [2025-03-03 19:33:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:04,891 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2025-03-03 19:33:04,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:33:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2025-03-03 19:33:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:33:04,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:04,893 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:04,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:33:04,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash -249038278, now seen corresponding path program 1 times [2025-03-03 19:33:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019529613] [2025-03-03 19:33:04,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:04,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:33:04,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:33:04,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:04,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:33:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:33:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019529613] [2025-03-03 19:33:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019529613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:05,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:33:05,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:33:05,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426506774] [2025-03-03 19:33:05,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:05,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:33:05,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:33:05,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:33:05,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:33:05,186 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:33:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:05,233 INFO L93 Difference]: Finished difference Result 339 states and 522 transitions. [2025-03-03 19:33:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:33:05,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-03 19:33:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:05,240 INFO L225 Difference]: With dead ends: 339 [2025-03-03 19:33:05,240 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 19:33:05,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-03 19:33:05,242 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 55 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:05,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 204 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:33:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 19:33:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2025-03-03 19:33:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 118 states have internal predecessors, (148), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 19:33:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 310 transitions. [2025-03-03 19:33:05,292 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 310 transitions. Word has length 171 [2025-03-03 19:33:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:05,293 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 310 transitions. [2025-03-03 19:33:05,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:33:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 310 transitions. [2025-03-03 19:33:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:33:05,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:05,299 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:05,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:33:05,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -542441285, now seen corresponding path program 1 times [2025-03-03 19:33:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:33:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106042553] [2025-03-03 19:33:05,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:33:05,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:33:05,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:33:05,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:05,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:33:05,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:33:05,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:33:05,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:33:05,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:05,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:33:05,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:33:05,533 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:33:05,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:33:05,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:33:05,537 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 19:33:05,637 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:33:05,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:33:05 BoogieIcfgContainer [2025-03-03 19:33:05,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:33:05,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:33:05,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:33:05,643 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:33:05,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:03" (3/4) ... [2025-03-03 19:33:05,645 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:33:05,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:33:05,646 INFO L158 Benchmark]: Toolchain (without parser) took 3156.88ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 80.6MB in the end (delta: 42.4MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2025-03-03 19:33:05,646 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:33:05,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.35ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 107.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:33:05,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.93ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 102.2MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:33:05,647 INFO L158 Benchmark]: Boogie Preprocessor took 66.83ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 91.3MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:33:05,647 INFO L158 Benchmark]: IcfgBuilder took 389.32ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 64.2MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:33:05,648 INFO L158 Benchmark]: TraceAbstraction took 2391.17ms. Allocated memory is still 167.8MB. Free memory was 63.4MB in the beginning and 80.6MB in the end (delta: -17.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:33:05,648 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 167.8MB. Free memory was 80.6MB in the beginning and 80.6MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:33:05,650 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.38ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.35ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 107.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.93ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 102.2MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.83ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 91.3MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 389.32ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 64.2MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2391.17ms. Allocated memory is still 167.8MB. Free memory was 63.4MB in the beginning and 80.6MB in the end (delta: -17.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 167.8MB. Free memory was 80.6MB in the beginning and 80.6MB in the end (delta: 33.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 someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someUnaryDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someUnaryFLOAToperation at line 70, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] double var_1_30 = 2.75; [L44] double var_1_31 = 0.0; [L45] unsigned char var_1_32 = 8; [L46] unsigned char var_1_33 = 100; [L47] double var_1_34 = 0.19999999999999996; [L48] signed char var_1_35 = -32; [L49] signed char var_1_36 = -1; [L50] signed char var_1_37 = -8; [L51] unsigned char last_1_var_1_15 = 0; VAL [isInitial=0, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L154] isInitial = 1 [L155] FCALL initially() [L156] COND TRUE 1 [L157] CALL updateLastVariables() [L147] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L157] RET updateLastVariables() [L158] CALL updateVariables() [L102] var_1_2 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L103] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L105] var_1_3 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L106] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L108] var_1_7 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L109] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L111] var_1_8 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L112] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L113] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L113] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L114] var_1_9 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L115] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L116] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L116] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L117] var_1_12 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L118] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L119] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L119] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L122] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L122] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L123] var_1_21 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L124] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L125] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L125] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L126] var_1_23 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L127] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L128] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L128] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L129] var_1_25 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L130] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L131] var_1_26 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L132] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L133] var_1_27 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L134] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L135] var_1_28 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L136] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L137] var_1_31 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L138] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L139] var_1_33 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L140] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L141] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L141] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L142] var_1_37 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_37 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L143] RET assume_abort_if_not(var_1_37 >= -127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L144] CALL assume_abort_if_not(var_1_37 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L144] RET assume_abort_if_not(var_1_37 <= 126) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L158] RET updateVariables() [L159] CALL step() [L55] var_1_30 = ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) [L56] var_1_32 = var_1_33 [L57] var_1_34 = var_1_31 [L58] var_1_35 = -1 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L59] COND FALSE !(var_1_31 <= var_1_34) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L64] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L67] COND FALSE !(\read(var_1_10)) [L70] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L72] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L73] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L75] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L82] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L84] COND TRUE var_1_24 != var_1_24 [L85] var_1_29 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L87] signed long int stepLocal_1 = var_1_7 - (var_1_8 - var_1_2); VAL [isInitial=1, last_1_var_1_15=0, stepLocal_1=16511, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L88] COND TRUE stepLocal_1 >= var_1_29 [L89] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L91] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L94] signed long int stepLocal_0 = var_1_2 - var_1_3; VAL [isInitial=1, last_1_var_1_15=0, stepLocal_0=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L95] COND TRUE stepLocal_0 <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L96] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L159] RET step() [L160] CALL, EXPR property() [L150-L151] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L160] RET, EXPR property() [L160] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 635 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 300 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 335 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 680 ConstructedInterpolants, 0 QuantifiedInterpolants, 1554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 5564/5616 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:33:05,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:33:07,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:33:07,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:33:07,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:33:07,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:33:07,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:33:07,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:33:07,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:33:07,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:33:07,636 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:33:07,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:33:07,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:33:07,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:33:07,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:33:07,636 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:33:07,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:33:07,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:33:07,637 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:33:07,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:33:07,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:33:07,639 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:33:07,639 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:33:07,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:33:07,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:33:07,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:33:07,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:33:07,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:07,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:33:07,640 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2025-03-03 19:33:07,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:33:07,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:33:07,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:33:07,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:33:07,915 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:33:07,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-03-03 19:33:09,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e22f071/aec6d44a892d4053954fe098925dd7cd/FLAG2eac5ee12 [2025-03-03 19:33:09,306 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:33:09,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-03-03 19:33:09,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e22f071/aec6d44a892d4053954fe098925dd7cd/FLAG2eac5ee12 [2025-03-03 19:33:09,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e22f071/aec6d44a892d4053954fe098925dd7cd [2025-03-03 19:33:09,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:33:09,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:33:09,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:09,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:33:09,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:33:09,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e265e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09, skipping insertion in model container [2025-03-03 19:33:09,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:33:09,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2025-03-03 19:33:09,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:33:09,499 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:33:09,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2025-03-03 19:33:09,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:33:09,541 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:33:09,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09 WrapperNode [2025-03-03 19:33:09,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:33:09,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:33:09,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:33:09,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:33:09,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,579 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-03-03 19:33:09,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:33:09,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:33:09,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:33:09,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:33:09,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,607 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:33:09,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:33:09,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:33:09,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:33:09,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:33:09,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (1/1) ... [2025-03-03 19:33:09,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:33:09,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:33:09,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:33:09,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:33:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:33:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:33:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:33:09,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:33:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:33:09,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:33:09,746 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:33:09,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:33:23,883 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 19:33:23,883 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:33:23,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:33:23,893 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:33:23,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:23 BoogieIcfgContainer [2025-03-03 19:33:23,894 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:33:23,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:33:23,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:33:23,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:33:23,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:33:09" (1/3) ... [2025-03-03 19:33:23,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcc47af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:33:23, skipping insertion in model container [2025-03-03 19:33:23,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:33:09" (2/3) ... [2025-03-03 19:33:23,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcc47af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:33:23, skipping insertion in model container [2025-03-03 19:33:23,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:33:23" (3/3) ... [2025-03-03 19:33:23,901 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2025-03-03 19:33:23,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:33:23,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:33:23,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:33:23,959 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;@6462d877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:33:23,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:33:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:33:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:33:23,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:23,972 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:23,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:23,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash -638509962, now seen corresponding path program 1 times [2025-03-03 19:33:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:33:23,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078833363] [2025-03-03 19:33:23,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:33:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:33:23,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:33:23,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:33:24,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:33:24,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:33:24,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:24,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:24,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:33:24,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:33:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 19:33:24,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:33:24,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:33:24,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078833363] [2025-03-03 19:33:24,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078833363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:24,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:33:24,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:33:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056261655] [2025-03-03 19:33:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:24,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:33:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:33:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:33:24,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:33:24,918 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:33:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:24,934 INFO L93 Difference]: Finished difference Result 142 states and 248 transitions. [2025-03-03 19:33:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:33:24,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2025-03-03 19:33:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:24,939 INFO L225 Difference]: With dead ends: 142 [2025-03-03 19:33:24,939 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 19:33:24,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:33:24,943 INFO L435 NwaCegarLoop]: 108 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, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:24,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:33:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 19:33:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 19:33:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:33:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2025-03-03 19:33:24,976 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 171 [2025-03-03 19:33:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:24,978 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2025-03-03 19:33:24,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:33:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2025-03-03 19:33:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:33:24,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:24,981 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:25,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 19:33:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:33:25,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 256520347, now seen corresponding path program 1 times [2025-03-03 19:33:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:33:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892288740] [2025-03-03 19:33:25,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:25,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:33:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:33:25,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:33:25,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:33:25,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:33:25,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:33:25,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:33:25,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:33:25,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 19:33:25,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:33:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:33:30,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:33:30,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:33:30,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892288740] [2025-03-03 19:33:30,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892288740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:33:30,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:33:30,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:33:30,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828490157] [2025-03-03 19:33:30,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:33:30,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:33:30,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:33:30,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:33:30,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:33:30,925 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:33:35,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:39,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:43,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:48,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:52,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:56,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:58,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:33:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:33:58,908 INFO L93 Difference]: Finished difference Result 233 states and 353 transitions. [2025-03-03 19:33:59,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:33:59,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-03 19:33:59,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:33:59,073 INFO L225 Difference]: With dead ends: 233 [2025-03-03 19:33:59,073 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 19:33:59,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:33:59,074 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 100 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 59 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:33:59,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 319 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 27.9s Time] [2025-03-03 19:33:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 19:33:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 137. [2025-03-03 19:33:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 19:33:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2025-03-03 19:33:59,098 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 171 [2025-03-03 19:33:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:33:59,099 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2025-03-03 19:33:59,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:33:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2025-03-03 19:33:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:33:59,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:33:59,100 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:33:59,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 19:33:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:33:59,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:33:59,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:33:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash -249038278, now seen corresponding path program 1 times [2025-03-03 19:33:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:33:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515717972] [2025-03-03 19:33:59,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:33:59,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:33:59,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:33:59,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:33:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:33:59,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:34:00,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:34:00,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:00,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:00,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:34:00,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:34:05,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:05,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515717972] [2025-03-03 19:34:05,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515717972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:05,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:05,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:34:05,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659639756] [2025-03-03 19:34:05,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:05,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:05,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:05,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:05,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:05,406 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:34:09,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:34:14,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:34:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:14,522 INFO L93 Difference]: Finished difference Result 405 states and 624 transitions. [2025-03-03 19:34:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:14,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-03 19:34:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:14,674 INFO L225 Difference]: With dead ends: 405 [2025-03-03 19:34:14,674 INFO L226 Difference]: Without dead ends: 271 [2025-03-03 19:34:14,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:14,676 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 25 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:14,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-03-03 19:34:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-03 19:34:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2025-03-03 19:34:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 156 states have internal predecessors, (196), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 19:34:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2025-03-03 19:34:14,712 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 171 [2025-03-03 19:34:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:14,713 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2025-03-03 19:34:14,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:34:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2025-03-03 19:34:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:34:14,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:14,718 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:14,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 19:34:14,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:14,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:14,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash -542441285, now seen corresponding path program 1 times [2025-03-03 19:34:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:14,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773190365] [2025-03-03 19:34:14,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:14,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:14,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:14,922 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:34:14,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 19:34:14,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:34:15,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:34:15,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:15,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:15,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:34:15,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:34:16,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:16,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773190365] [2025-03-03 19:34:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773190365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:34:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448171209] [2025-03-03 19:34:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:16,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:16,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:16,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:16,085 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:34:19,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 19:34:21,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 19:34:25,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 19:34:30,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 19:34:34,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 19:34:38,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 19:34:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:38,921 INFO L93 Difference]: Finished difference Result 783 states and 1200 transitions. [2025-03-03 19:34:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:38,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-03 19:34:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:38,930 INFO L225 Difference]: With dead ends: 783 [2025-03-03 19:34:38,930 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 19:34:38,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:38,932 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 96 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:38,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 285 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 22.8s Time] [2025-03-03 19:34:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 19:34:38,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 273. [2025-03-03 19:34:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 160 states have (on average 1.25) internal successors, (200), 160 states have internal predecessors, (200), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 19:34:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 416 transitions. [2025-03-03 19:34:38,971 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 416 transitions. Word has length 171 [2025-03-03 19:34:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:38,972 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 416 transitions. [2025-03-03 19:34:38,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:34:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 416 transitions. [2025-03-03 19:34:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 19:34:38,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:38,974 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:34:38,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-03 19:34:39,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:39,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash -738954790, now seen corresponding path program 1 times [2025-03-03 19:34:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:39,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039877585] [2025-03-03 19:34:39,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:39,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:39,177 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:34:39,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 19:34:39,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 19:34:39,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 19:34:39,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:39,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:39,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 19:34:39,965 INFO L279 TraceCheckSpWp]: Computing forward predicates...