./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2465c1c8b10741a8eace09a346c15600fd07ab293068a1095f6cc78a6f3ca27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:06:08,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:06:08,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:06:08,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:06:08,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:06:09,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:06:09,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:06:09,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:06:09,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:06:09,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:06:09,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:06:09,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:06:09,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:06:09,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:06:09,014 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:06:09,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:06:09,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:06:09,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:06:09,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:06:09,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:06:09,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:06:09,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:06:09,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:06:09,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:06:09,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:06:09,017 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2465c1c8b10741a8eace09a346c15600fd07ab293068a1095f6cc78a6f3ca27 [2025-02-06 01:06:09,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:06:09,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:06:09,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:06:09,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:06:09,242 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:06:09,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i [2025-02-06 01:06:10,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d6f19d72/fa0a902dab3b4020a8ee1243f9f27f62/FLAGf1233a11c [2025-02-06 01:06:10,753 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:06:10,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i [2025-02-06 01:06:10,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d6f19d72/fa0a902dab3b4020a8ee1243f9f27f62/FLAGf1233a11c [2025-02-06 01:06:10,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d6f19d72/fa0a902dab3b4020a8ee1243f9f27f62 [2025-02-06 01:06:10,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:06:10,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:06:10,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:06:10,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:06:10,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:06:10,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:06:10" (1/1) ... [2025-02-06 01:06:10,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:10, skipping insertion in model container [2025-02-06 01:06:10,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:06:10" (1/1) ... [2025-02-06 01:06:10,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:06:10,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i[915,928] [2025-02-06 01:06:11,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:06:11,046 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:06:11,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i[915,928] [2025-02-06 01:06:11,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:06:11,086 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:06:11,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11 WrapperNode [2025-02-06 01:06:11,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:06:11,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:06:11,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:06:11,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:06:11,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,135 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2025-02-06 01:06:11,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:06:11,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:06:11,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:06:11,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:06:11,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:06:11,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:06:11,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:06:11,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:06:11,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:06:11,212 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (1/1) ... [2025-02-06 01:06:11,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:06:11,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:06:11,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:06:11,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:06:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:06:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:06:11,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:06:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:06:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:06:11,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:06:11,338 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:06:11,339 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:06:11,744 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~ite22#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-02-06 01:06:11,779 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-06 01:06:11,780 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:06:11,803 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:06:11,805 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:06:11,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:06:11 BoogieIcfgContainer [2025-02-06 01:06:11,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:06:11,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:06:11,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:06:11,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:06:11,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:06:10" (1/3) ... [2025-02-06 01:06:11,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743b642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:06:11, skipping insertion in model container [2025-02-06 01:06:11,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:11" (2/3) ... [2025-02-06 01:06:11,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743b642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:06:11, skipping insertion in model container [2025-02-06 01:06:11,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:06:11" (3/3) ... [2025-02-06 01:06:11,844 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-9.i [2025-02-06 01:06:11,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:06:11,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-9.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:06:11,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:06:11,923 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;@f37903d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:06:11,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:06:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:06:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 01:06:11,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:11,936 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:11,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:11,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 529490361, now seen corresponding path program 1 times [2025-02-06 01:06:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:06:11,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655207931] [2025-02-06 01:06:11,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:06:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 01:06:12,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 01:06:12,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:12,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 01:06:12,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:06:12,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655207931] [2025-02-06 01:06:12,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655207931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:06:12,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840506773] [2025-02-06 01:06:12,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:12,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:06:12,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:06:12,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:06:12,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:06:12,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 01:06:12,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 01:06:12,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:12,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:12,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:06:12,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:06:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 01:06:12,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:06:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840506773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:12,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:06:12,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:06:12,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793643647] [2025-02-06 01:06:12,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:12,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:06:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:06:12,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:06:12,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:06:12,385 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:06:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:12,413 INFO L93 Difference]: Finished difference Result 207 states and 357 transitions. [2025-02-06 01:06:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:06:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-02-06 01:06:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:12,421 INFO L225 Difference]: With dead ends: 207 [2025-02-06 01:06:12,423 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 01:06:12,426 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-02-06 01:06:12,428 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:12,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:06:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 01:06:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 01:06:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:06:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2025-02-06 01:06:12,467 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 158 transitions. Word has length 171 [2025-02-06 01:06:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:12,468 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 158 transitions. [2025-02-06 01:06:12,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:06:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 158 transitions. [2025-02-06 01:06:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 01:06:12,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:12,470 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:12,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:06:12,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:06:12,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:12,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1878834965, now seen corresponding path program 1 times [2025-02-06 01:06:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:06:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451102682] [2025-02-06 01:06:12,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:06:12,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 01:06:12,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 01:06:12,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:12,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:06:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:06:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451102682] [2025-02-06 01:06:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451102682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:12,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:06:12,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:06:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084626846] [2025-02-06 01:06:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:12,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:06:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:06:12,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:06:12,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:06:12,884 INFO L87 Difference]: Start difference. First operand 103 states and 158 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:12,950 INFO L93 Difference]: Finished difference Result 247 states and 376 transitions. [2025-02-06 01:06:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:06:12,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-02-06 01:06:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:12,952 INFO L225 Difference]: With dead ends: 247 [2025-02-06 01:06:12,952 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 01:06:12,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:06:12,953 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 75 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:12,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 304 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:06:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 01:06:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2025-02-06 01:06:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 114 states have internal predecessors, (157), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 01:06:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2025-02-06 01:06:12,966 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 171 [2025-02-06 01:06:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2025-02-06 01:06:12,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2025-02-06 01:06:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 01:06:12,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:12,968 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:12,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:06:12,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash -93838855, now seen corresponding path program 1 times [2025-02-06 01:06:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:06:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966858060] [2025-02-06 01:06:12,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:06:12,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 01:06:13,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 01:06:13,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:13,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:06:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:06:13,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966858060] [2025-02-06 01:06:13,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966858060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:13,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:06:13,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:06:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079116567] [2025-02-06 01:06:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:13,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:06:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:06:13,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:06:13,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:06:13,198 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:13,360 INFO L93 Difference]: Finished difference Result 420 states and 626 transitions. [2025-02-06 01:06:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:06:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-02-06 01:06:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:13,365 INFO L225 Difference]: With dead ends: 420 [2025-02-06 01:06:13,365 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 01:06:13,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:06:13,369 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 121 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:13,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 443 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:06:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 01:06:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2025-02-06 01:06:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.335820895522388) internal successors, (179), 135 states have internal predecessors, (179), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 01:06:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 287 transitions. [2025-02-06 01:06:13,401 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 287 transitions. Word has length 172 [2025-02-06 01:06:13,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:13,401 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 287 transitions. [2025-02-06 01:06:13,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 287 transitions. [2025-02-06 01:06:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 01:06:13,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:13,404 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:13,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:06:13,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:13,408 INFO L85 PathProgramCache]: Analyzing trace with hash 920871158, now seen corresponding path program 1 times [2025-02-06 01:06:13,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:06:13,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25969359] [2025-02-06 01:06:13,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:13,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:06:13,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 01:06:13,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 01:06:13,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:13,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:06:13,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:06:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25969359] [2025-02-06 01:06:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25969359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:13,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:06:13,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:06:13,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63068794] [2025-02-06 01:06:13,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:06:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:06:13,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:06:13,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:06:13,565 INFO L87 Difference]: Start difference. First operand 192 states and 287 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:13,617 INFO L93 Difference]: Finished difference Result 474 states and 707 transitions. [2025-02-06 01:06:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:06:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-02-06 01:06:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:13,622 INFO L225 Difference]: With dead ends: 474 [2025-02-06 01:06:13,624 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 01:06:13,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:06:13,625 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 104 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:13,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 355 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:06:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 01:06:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2025-02-06 01:06:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 243 states have (on average 1.3497942386831276) internal successors, (328), 245 states have internal predecessors, (328), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 01:06:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 492 transitions. [2025-02-06 01:06:13,679 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 492 transitions. Word has length 173 [2025-02-06 01:06:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:13,680 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 492 transitions. [2025-02-06 01:06:13,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 492 transitions. [2025-02-06 01:06:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 01:06:13,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:13,682 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:13,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:06:13,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:13,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2042472456, now seen corresponding path program 1 times [2025-02-06 01:06:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:06:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665094223] [2025-02-06 01:06:13,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:06:13,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 01:06:13,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 01:06:13,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:13,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:06:13,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:06:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665094223] [2025-02-06 01:06:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665094223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:13,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:06:13,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:06:13,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320488602] [2025-02-06 01:06:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:13,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:06:13,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:06:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:06:13,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:06:13,802 INFO L87 Difference]: Start difference. First operand 331 states and 492 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:13,862 INFO L93 Difference]: Finished difference Result 474 states and 703 transitions. [2025-02-06 01:06:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:06:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-02-06 01:06:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:13,866 INFO L225 Difference]: With dead ends: 474 [2025-02-06 01:06:13,867 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 01:06:13,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:06:13,869 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:13,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 445 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:06:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 01:06:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2025-02-06 01:06:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 243 states have (on average 1.3415637860082306) internal successors, (326), 245 states have internal predecessors, (326), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 01:06:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 490 transitions. [2025-02-06 01:06:13,910 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 490 transitions. Word has length 174 [2025-02-06 01:06:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:13,911 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 490 transitions. [2025-02-06 01:06:13,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 490 transitions. [2025-02-06 01:06:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 01:06:13,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:13,914 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:13,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:06:13,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:13,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash 442927183, now seen corresponding path program 1 times [2025-02-06 01:06:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:06:13,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088260372] [2025-02-06 01:06:13,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:06:13,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 01:06:14,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 01:06:14,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:14,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:06:14,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774241701] [2025-02-06 01:06:14,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:14,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:06:14,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:06:14,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:06:14,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:06:14,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 01:06:14,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 01:06:14,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:14,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:06:14,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:06:14,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 01:06:14,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 01:06:14,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:14,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:06:14,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:06:14,445 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:06:14,445 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:06:14,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:06:14,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:06:14,651 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 01:06:14,758 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:06:14,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:06:14 BoogieIcfgContainer [2025-02-06 01:06:14,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:06:14,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:06:14,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:06:14,764 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:06:14,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:06:11" (3/4) ... [2025-02-06 01:06:14,767 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:06:14,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:06:14,768 INFO L158 Benchmark]: Toolchain (without parser) took 3951.85ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 114.7MB in the beginning and 206.7MB in the end (delta: -92.0MB). Peak memory consumption was 193.7MB. Max. memory is 16.1GB. [2025-02-06 01:06:14,768 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:06:14,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.95ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 98.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:06:14,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.92ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 92.1MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:06:14,769 INFO L158 Benchmark]: Boogie Preprocessor took 72.97ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 84.5MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:06:14,770 INFO L158 Benchmark]: IcfgBuilder took 595.75ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 44.6MB in the end (delta: 40.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 01:06:14,770 INFO L158 Benchmark]: TraceAbstraction took 2932.65ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.1MB in the beginning and 206.7MB in the end (delta: -94.6MB). Peak memory consumption was 186.8MB. Max. memory is 16.1GB. [2025-02-06 01:06:14,770 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 427.8MB. Free memory was 206.7MB in the beginning and 206.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:06:14,771 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.41ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.95ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 98.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.92ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 92.1MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.97ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 84.5MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 595.75ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 44.6MB in the end (delta: 40.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2932.65ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.1MB in the beginning and 206.7MB in the end (delta: -94.6MB). Peak memory consumption was 186.8MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 427.8MB. Free memory was 206.7MB in the beginning and 206.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 154. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] double var_1_4 = 99999999999.6; [L24] unsigned char var_1_5 = 1; [L25] signed long int var_1_6 = -5; [L26] signed char var_1_10 = 64; [L27] signed char var_1_11 = 16; [L28] signed char var_1_12 = 4; [L29] signed char var_1_13 = 64; [L30] unsigned short int var_1_14 = 64; [L31] unsigned char var_1_16 = 8; [L32] unsigned char var_1_17 = 200; [L33] unsigned char var_1_18 = 1; [L34] signed long int var_1_19 = 10; [L35] signed long int var_1_20 = -256; [L36] signed char var_1_21 = 25; [L37] signed char var_1_23 = 1; [L38] signed char var_1_24 = 5; [L39] unsigned char var_1_25 = 0; [L40] double var_1_26 = 8.125; [L41] double var_1_27 = 0.875; [L42] double var_1_28 = 15.6; [L43] double var_1_29 = 2.5; [L44] unsigned long int var_1_30 = 25; [L45] signed long int var_1_31 = 50; [L46] signed short int var_1_32 = -8; [L47] unsigned char var_1_33 = 100; [L48] signed long int last_1_var_1_6 = -5; [L49] signed long int last_1_var_1_20 = -256; [L50] signed char last_1_var_1_21 = 25; VAL [isInitial=0, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L203] isInitial = 1 [L204] FCALL initially() [L205] COND TRUE 1 [L206] CALL updateLastVariables() [L194] last_1_var_1_6 = var_1_6 [L195] last_1_var_1_20 = var_1_20 [L196] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L206] RET updateLastVariables() [L207] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L153] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L155] var_1_5 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L156] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L157] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L157] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L158] var_1_11 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L159] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L161] var_1_12 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L162] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L164] var_1_13 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L167] var_1_17 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_17 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L168] RET assume_abort_if_not(var_1_17 >= 190) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L170] var_1_18 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L171] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L173] var_1_23 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L176] var_1_24 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L177] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L182] var_1_27 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L183] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L184] var_1_28 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L185] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L186] var_1_29 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L187] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L188] var_1_31 = __VERIFIER_nondet_long() [L189] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L189] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] CALL assume_abort_if_not(var_1_31 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] RET assume_abort_if_not(var_1_31 != 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L207] RET updateVariables() [L208] CALL step() [L54] COND TRUE \read(var_1_5) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L55] COND TRUE (last_1_var_1_6 < 1) || var_1_25 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L56] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L65] COND FALSE !((- var_1_26) >= (var_1_26 / var_1_4)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L70] var_1_32 = var_1_23 [L71] var_1_33 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=64, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L72] COND FALSE !(! var_1_5) [L87] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L89] COND FALSE !(var_1_1 == 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L92] COND FALSE !(var_1_14 < var_1_1) [L95] var_1_6 = var_1_1 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L98] unsigned short int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=8, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L99] COND FALSE !(! var_1_5) [L104] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L106] var_1_19 = var_1_16 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L107] COND FALSE !(((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) [L114] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L116] COND TRUE \read(var_1_5) [L117] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L125] COND TRUE \read(var_1_5) [L126] var_1_20 = -10000000 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L142] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L143] EXPR last_1_var_1_21 & var_1_10 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L143] COND TRUE ((last_1_var_1_21 & var_1_10) >= var_1_12) && stepLocal_1 [L144] var_1_21 = (var_1_18 + (var_1_23 - var_1_24)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L208] RET step() [L209] CALL, EXPR property() [L199] EXPR ((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14)))) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L199] EXPR (((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L199-L200] return (((((((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1))) && (var_1_5 ? (((last_1_var_1_6 < 1) || var_1_25) ? (var_1_25 ? (var_1_26 == ((double) ((var_1_27 - var_1_28) + var_1_29))) : 1) : (var_1_26 == ((double) var_1_28))) : (var_1_26 == ((double) var_1_28)))) && ((((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) ? ((var_1_16 > var_1_16) ? (var_1_30 == ((unsigned long int) var_1_18)) : (var_1_30 == ((unsigned long int) var_1_17))) : (var_1_30 == ((unsigned long int) var_1_33)))) && (var_1_32 == ((signed short int) var_1_23))) && (var_1_33 == ((unsigned char) var_1_18)) ; [L209] RET, EXPR property() [L209] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=36, var_1_14=36, var_1_16=33, var_1_17=-65, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 1701 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 1007 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 94 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1380 NumberOfCodeBlocks, 1380 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1026 ConstructedInterpolants, 0 QuantifiedInterpolants, 1432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 7750/7800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 01:06:14,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2465c1c8b10741a8eace09a346c15600fd07ab293068a1095f6cc78a6f3ca27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:06:16,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:06:16,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:06:16,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:06:16,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:06:16,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:06:16,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:06:16,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:06:16,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:06:16,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:06:16,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:06:16,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:06:16,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:06:16,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:06:16,797 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:06:16,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:06:16,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:06:16,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:06:16,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:06:16,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:06:16,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:06:16,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:06:16,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:06:16,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:06:16,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:06:16,800 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2465c1c8b10741a8eace09a346c15600fd07ab293068a1095f6cc78a6f3ca27 [2025-02-06 01:06:17,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:06:17,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:06:17,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:06:17,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:06:17,049 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:06:17,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i [2025-02-06 01:06:18,235 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97cdfdca/2960602c3e79481eb01396e1c741785c/FLAGeab88c99e [2025-02-06 01:06:18,437 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:06:18,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i [2025-02-06 01:06:18,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97cdfdca/2960602c3e79481eb01396e1c741785c/FLAGeab88c99e [2025-02-06 01:06:18,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97cdfdca/2960602c3e79481eb01396e1c741785c [2025-02-06 01:06:18,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:06:18,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:06:18,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:06:18,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:06:18,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:06:18,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:06:18" (1/1) ... [2025-02-06 01:06:18,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f1aceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:18, skipping insertion in model container [2025-02-06 01:06:18,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:06:18" (1/1) ... [2025-02-06 01:06:18,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:06:18,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i[915,928] [2025-02-06 01:06:19,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:06:19,077 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:06:19,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-9.i[915,928] [2025-02-06 01:06:19,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:06:19,144 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:06:19,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19 WrapperNode [2025-02-06 01:06:19,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:06:19,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:06:19,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:06:19,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:06:19,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,183 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-02-06 01:06:19,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:06:19,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:06:19,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:06:19,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:06:19,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,208 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:06:19,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:06:19,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:06:19,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:06:19,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:06:19,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (1/1) ... [2025-02-06 01:06:19,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:06:19,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:06:19,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:06:19,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:06:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:06:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:06:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:06:19,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:06:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:06:19,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:06:19,345 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:06:19,347 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:06:34,444 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 01:06:34,444 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:06:34,451 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:06:34,452 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:06:34,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:06:34 BoogieIcfgContainer [2025-02-06 01:06:34,452 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:06:34,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:06:34,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:06:34,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:06:34,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:06:18" (1/3) ... [2025-02-06 01:06:34,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d0058b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:06:34, skipping insertion in model container [2025-02-06 01:06:34,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:06:19" (2/3) ... [2025-02-06 01:06:34,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d0058b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:06:34, skipping insertion in model container [2025-02-06 01:06:34,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:06:34" (3/3) ... [2025-02-06 01:06:34,460 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-9.i [2025-02-06 01:06:34,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:06:34,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-9.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:06:34,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:06:34,520 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;@3683f24e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:06:34,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:06:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:06:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 01:06:34,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:34,533 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:34,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:34,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash 661637997, now seen corresponding path program 1 times [2025-02-06 01:06:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:06:34,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064736280] [2025-02-06 01:06:34,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:34,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:06:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:06:34,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:06:34,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 01:06:34,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 01:06:35,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 01:06:35,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:35,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:35,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:06:35,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:06:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-02-06 01:06:35,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:06:35,570 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:06:35,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064736280] [2025-02-06 01:06:35,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064736280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:35,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:06:35,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:06:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100418115] [2025-02-06 01:06:35,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:35,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:06:35,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:06:35,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:06:35,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:06:35,590 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:06:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:35,608 INFO L93 Difference]: Finished difference Result 163 states and 289 transitions. [2025-02-06 01:06:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:06:35,610 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2025-02-06 01:06:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:35,615 INFO L225 Difference]: With dead ends: 163 [2025-02-06 01:06:35,615 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 01:06:35,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:06:35,619 INFO L435 NwaCegarLoop]: 124 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, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:35,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:06:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 01:06:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 01:06:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:06:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-02-06 01:06:35,650 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 166 [2025-02-06 01:06:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:35,650 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-02-06 01:06:35,651 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:06:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-02-06 01:06:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 01:06:35,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:35,653 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:35,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 01:06:35,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:06:35,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:35,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:35,858 INFO L85 PathProgramCache]: Analyzing trace with hash 209486993, now seen corresponding path program 1 times [2025-02-06 01:06:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:06:35,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302881244] [2025-02-06 01:06:35,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:35,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:06:35,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:06:35,861 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:06:35,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 01:06:35,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 01:06:36,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 01:06:36,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:36,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:36,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:06:36,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:06:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:06:37,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:06:37,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:06:37,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302881244] [2025-02-06 01:06:37,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302881244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:37,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:06:37,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:06:37,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001284803] [2025-02-06 01:06:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:37,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:06:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:06:37,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:06:37,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:06:37,009 INFO L87 Difference]: Start difference. First operand 81 states and 124 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:41,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:06:45,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:06:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:45,642 INFO L93 Difference]: Finished difference Result 190 states and 288 transitions. [2025-02-06 01:06:45,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:06:45,643 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2025-02-06 01:06:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:45,645 INFO L225 Difference]: With dead ends: 190 [2025-02-06 01:06:45,645 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 01:06:45,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:06:45,646 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:45,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 245 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-02-06 01:06:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 01:06:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-02-06 01:06:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 79 states have internal predecessors, (104), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 01:06:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2025-02-06 01:06:45,657 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 166 [2025-02-06 01:06:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:45,657 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2025-02-06 01:06:45,657 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2025-02-06 01:06:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 01:06:45,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:45,659 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:06:45,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 01:06:45,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:06:45,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:45,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:45,864 INFO L85 PathProgramCache]: Analyzing trace with hash -538990522, now seen corresponding path program 1 times [2025-02-06 01:06:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:06:45,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529136964] [2025-02-06 01:06:45,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:45,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:06:45,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:06:45,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:06:45,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 01:06:45,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 01:06:46,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 01:06:46,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:46,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:46,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 01:06:46,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:06:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:06:50,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:06:50,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:06:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529136964] [2025-02-06 01:06:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529136964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:50,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:06:50,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:06:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478473098] [2025-02-06 01:06:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:50,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:06:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:06:50,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:06:50,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:06:50,569 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:06:55,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:06:59,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:07:03,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:07:07,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:07:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:07:07,906 INFO L93 Difference]: Finished difference Result 315 states and 467 transitions. [2025-02-06 01:07:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:07:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2025-02-06 01:07:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:07:08,004 INFO L225 Difference]: With dead ends: 315 [2025-02-06 01:07:08,005 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 01:07:08,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 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-02-06 01:07:08,006 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 84 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 53 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:07:08,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 355 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 17.2s Time] [2025-02-06 01:07:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 01:07:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 157. [2025-02-06 01:07:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 100 states have internal predecessors, (126), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 01:07:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2025-02-06 01:07:08,049 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 167 [2025-02-06 01:07:08,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:07:08,049 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2025-02-06 01:07:08,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:07:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2025-02-06 01:07:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 01:07:08,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:07:08,051 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:07:08,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-02-06 01:07:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:07:08,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:07:08,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:07:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash -678609105, now seen corresponding path program 1 times [2025-02-06 01:07:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:07:08,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794247022] [2025-02-06 01:07:08,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:07:08,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:07:08,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:07:08,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:07:08,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 01:07:08,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 01:07:09,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 01:07:09,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:07:09,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:07:09,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:07:09,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:07:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:07:13,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:07:13,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:07:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794247022] [2025-02-06 01:07:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794247022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:07:13,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:07:13,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:07:13,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655198345] [2025-02-06 01:07:13,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:07:13,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:07:13,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:07:13,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:07:13,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:07:13,009 INFO L87 Difference]: Start difference. First operand 157 states and 234 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:07:17,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:07:21,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:07:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:07:21,341 INFO L93 Difference]: Finished difference Result 369 states and 548 transitions. [2025-02-06 01:07:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:07:21,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-02-06 01:07:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:07:21,439 INFO L225 Difference]: With dead ends: 369 [2025-02-06 01:07:21,440 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 01:07:21,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:07:21,442 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 41 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:07:21,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 265 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-06 01:07:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 01:07:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-02-06 01:07:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 173 states have (on average 1.283236994219653) internal successors, (222), 175 states have internal predecessors, (222), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 01:07:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2025-02-06 01:07:21,488 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 168 [2025-02-06 01:07:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:07:21,489 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2025-02-06 01:07:21,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:07:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2025-02-06 01:07:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 01:07:21,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:07:21,492 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:07:21,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 01:07:21,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:07:21,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:07:21,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:07:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -889762392, now seen corresponding path program 1 times [2025-02-06 01:07:21,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:07:21,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460437680] [2025-02-06 01:07:21,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:07:21,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:07:21,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:07:21,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:07:21,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 01:07:21,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 01:07:22,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 01:07:22,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:07:22,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:07:22,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:07:22,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:07:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:07:22,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:07:22,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:07:22,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460437680] [2025-02-06 01:07:22,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460437680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:07:22,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:07:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:07:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303634996] [2025-02-06 01:07:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:07:22,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:07:22,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:07:22,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:07:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:07:22,651 INFO L87 Difference]: Start difference. First operand 261 states and 386 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:07:26,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:07:30,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:07:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:07:30,987 INFO L93 Difference]: Finished difference Result 369 states and 544 transitions. [2025-02-06 01:07:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:07:31,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-02-06 01:07:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:07:31,085 INFO L225 Difference]: With dead ends: 369 [2025-02-06 01:07:31,085 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 01:07:31,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:07:31,086 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 117 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:07:31,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 355 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-06 01:07:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 01:07:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-02-06 01:07:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 175 states have internal predecessors, (220), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 01:07:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 384 transitions. [2025-02-06 01:07:31,125 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 384 transitions. Word has length 169 [2025-02-06 01:07:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:07:31,126 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 384 transitions. [2025-02-06 01:07:31,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:07:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 384 transitions. [2025-02-06 01:07:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 01:07:31,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:07:31,129 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:07:31,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 01:07:31,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:07:31,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:07:31,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:07:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash 911082225, now seen corresponding path program 1 times [2025-02-06 01:07:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:07:31,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876779751] [2025-02-06 01:07:31,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:07:31,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:07:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:07:31,334 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:07:31,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 01:07:31,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 01:07:32,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 01:07:32,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:07:32,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:07:32,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 01:07:32,527 INFO L279 TraceCheckSpWp]: Computing forward predicates...