./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:17:52,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:17:52,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:17:52,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:17:52,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:17:52,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:17:52,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:17:52,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:17:52,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:17:52,595 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:17:52,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:17:52,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:17:52,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:17:52,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:17:52,596 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:17:52,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:17:52,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:17:52,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:17:52,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:17:52,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:17:52,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:17:52,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:17:52,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:17:52,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:17:52,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:17:52,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:17:52,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:17:52,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:17:52,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:17:52,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:17:52,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:17:52,599 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd [2025-03-17 00:17:52,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:17:52,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:17:52,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:17:52,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:17:52,914 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:17:52,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-03-17 00:17:54,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47581feef/f406bf3eb387411c81e9294c030ccd42/FLAGff784fc1c [2025-03-17 00:17:54,417 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:17:54,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-03-17 00:17:54,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47581feef/f406bf3eb387411c81e9294c030ccd42/FLAGff784fc1c [2025-03-17 00:17:54,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47581feef/f406bf3eb387411c81e9294c030ccd42 [2025-03-17 00:17:54,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:17:54,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:17:54,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:17:54,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:17:54,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:17:54,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:54,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6ac0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54, skipping insertion in model container [2025-03-17 00:17:54,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:54,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:17:54,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i[915,928] [2025-03-17 00:17:54,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:17:54,890 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:17:54,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i[915,928] [2025-03-17 00:17:54,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:17:54,960 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:17:54,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54 WrapperNode [2025-03-17 00:17:54,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:17:54,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:17:54,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:17:54,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:17:54,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:54,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,014 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-03-17 00:17:55,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:17:55,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:17:55,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:17:55,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:17:55,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,047 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:17:55,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,054 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:17:55,063 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:17:55,065 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:17:55,065 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:17:55,066 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (1/1) ... [2025-03-17 00:17:55,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:17:55,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:17:55,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:17:55,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:17:55,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:17:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:17:55,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:17:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:17:55,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:17:55,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:17:55,205 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:17:55,206 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:17:55,630 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-17 00:17:55,675 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-17 00:17:55,676 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:17:55,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:17:55,695 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 00:17:55,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:17:55 BoogieIcfgContainer [2025-03-17 00:17:55,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:17:55,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:17:55,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:17:55,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:17:55,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:17:54" (1/3) ... [2025-03-17 00:17:55,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcfa5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:17:55, skipping insertion in model container [2025-03-17 00:17:55,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:54" (2/3) ... [2025-03-17 00:17:55,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcfa5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:17:55, skipping insertion in model container [2025-03-17 00:17:55,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:17:55" (3/3) ... [2025-03-17 00:17:55,703 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-03-17 00:17:55,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:17:55,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:17:55,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:17:55,770 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;@27c3f63f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:17:55,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:17:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 00:17:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 00:17:55,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:55,789 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:17:55,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1674586224, now seen corresponding path program 1 times [2025-03-17 00:17:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:17:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676460718] [2025-03-17 00:17:55,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:55,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:17:55,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 00:17:55,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 00:17:55,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:55,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 00:17:56,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:17:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676460718] [2025-03-17 00:17:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676460718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:17:56,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553733293] [2025-03-17 00:17:56,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:56,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:17:56,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:17:56,118 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:17:56,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:17:56,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 00:17:56,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 00:17:56,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:56,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:56,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:17:56,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:17:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 00:17:56,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:17:56,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553733293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:17:56,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:17:56,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:17:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453054924] [2025-03-17 00:17:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:17:56,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:17:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:17:56,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:17:56,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:17:56,453 INFO L87 Difference]: Start difference. First operand has 106 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:17:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:56,500 INFO L93 Difference]: Finished difference Result 209 states and 357 transitions. [2025-03-17 00:17:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:17:56,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-03-17 00:17:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:56,511 INFO L225 Difference]: With dead ends: 209 [2025-03-17 00:17:56,511 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 00:17:56,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:17:56,520 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:56,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:17:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 00:17:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 00:17:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 00:17:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 160 transitions. [2025-03-17 00:17:56,577 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 160 transitions. Word has length 199 [2025-03-17 00:17:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:56,578 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 160 transitions. [2025-03-17 00:17:56,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:17:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 160 transitions. [2025-03-17 00:17:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 00:17:56,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:56,583 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:17:56,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:17:56,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:17:56,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:56,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1128756497, now seen corresponding path program 1 times [2025-03-17 00:17:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:17:56,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760148039] [2025-03-17 00:17:56,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:17:56,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 00:17:56,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 00:17:56,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:56,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:17:57,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:17:57,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760148039] [2025-03-17 00:17:57,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760148039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:17:57,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:17:57,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:17:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211393016] [2025-03-17 00:17:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:17:57,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:17:57,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:17:57,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:17:57,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:17:57,109 INFO L87 Difference]: Start difference. First operand 104 states and 160 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:57,227 INFO L93 Difference]: Finished difference Result 301 states and 463 transitions. [2025-03-17 00:17:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:17:57,228 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-03-17 00:17:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:57,236 INFO L225 Difference]: With dead ends: 301 [2025-03-17 00:17:57,236 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 00:17:57,237 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-03-17 00:17:57,238 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 139 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:57,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 403 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:17:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 00:17:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2025-03-17 00:17:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 131 states have internal predecessors, (176), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 00:17:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 300 transitions. [2025-03-17 00:17:57,282 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 300 transitions. Word has length 199 [2025-03-17 00:17:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:57,283 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 300 transitions. [2025-03-17 00:17:57,283 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 300 transitions. [2025-03-17 00:17:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-17 00:17:57,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:57,285 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:17:57,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:17:57,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:57,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash -212003418, now seen corresponding path program 1 times [2025-03-17 00:17:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:17:57,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327825917] [2025-03-17 00:17:57,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:17:57,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 00:17:57,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 00:17:57,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:57,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:17:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:17:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327825917] [2025-03-17 00:17:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327825917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:17:57,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:17:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:17:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453814398] [2025-03-17 00:17:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:17:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:17:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:17:57,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:17:57,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:17:57,685 INFO L87 Difference]: Start difference. First operand 196 states and 300 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:58,028 INFO L93 Difference]: Finished difference Result 639 states and 971 transitions. [2025-03-17 00:17:58,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:17:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-03-17 00:17:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:58,034 INFO L225 Difference]: With dead ends: 639 [2025-03-17 00:17:58,034 INFO L226 Difference]: Without dead ends: 444 [2025-03-17 00:17:58,035 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-03-17 00:17:58,035 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 162 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:58,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 453 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:17:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-17 00:17:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 426. [2025-03-17 00:17:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 297 states have (on average 1.3468013468013469) internal successors, (400), 297 states have internal predecessors, (400), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-17 00:17:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 648 transitions. [2025-03-17 00:17:58,125 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 648 transitions. Word has length 200 [2025-03-17 00:17:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:58,126 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 648 transitions. [2025-03-17 00:17:58,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 648 transitions. [2025-03-17 00:17:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 00:17:58,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:58,133 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:17:58,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:17:58,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:58,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 154859886, now seen corresponding path program 1 times [2025-03-17 00:17:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:17:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655640532] [2025-03-17 00:17:58,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:17:58,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 00:17:58,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 00:17:58,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:58,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:17:58,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:17:58,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655640532] [2025-03-17 00:17:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655640532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:17:58,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:17:58,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:17:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978236919] [2025-03-17 00:17:58,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:17:58,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:17:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:17:58,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:17:58,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:17:58,423 INFO L87 Difference]: Start difference. First operand 426 states and 648 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:58,536 INFO L93 Difference]: Finished difference Result 1075 states and 1640 transitions. [2025-03-17 00:17:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:17:58,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-03-17 00:17:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:58,542 INFO L225 Difference]: With dead ends: 1075 [2025-03-17 00:17:58,545 INFO L226 Difference]: Without dead ends: 650 [2025-03-17 00:17:58,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:17:58,549 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 89 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:58,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 310 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:17:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-17 00:17:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2025-03-17 00:17:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 455 states have (on average 1.3428571428571427) internal successors, (611), 455 states have internal predecessors, (611), 186 states have call successors, (186), 6 states have call predecessors, (186), 6 states have return successors, (186), 186 states have call predecessors, (186), 186 states have call successors, (186) [2025-03-17 00:17:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 983 transitions. [2025-03-17 00:17:58,633 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 983 transitions. Word has length 201 [2025-03-17 00:17:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:58,635 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 983 transitions. [2025-03-17 00:17:58,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 983 transitions. [2025-03-17 00:17:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:17:58,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:58,639 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:17:58,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:17:58,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:58,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash -287034054, now seen corresponding path program 1 times [2025-03-17 00:17:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:17:58,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697042783] [2025-03-17 00:17:58,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:58,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:17:58,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:17:58,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:17:58,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:58,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:17:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:17:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697042783] [2025-03-17 00:17:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697042783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:17:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:17:58,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:17:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290073325] [2025-03-17 00:17:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:17:58,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:17:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:17:58,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:17:58,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:17:58,872 INFO L87 Difference]: Start difference. First operand 648 states and 983 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:59,005 INFO L93 Difference]: Finished difference Result 650 states and 984 transitions. [2025-03-17 00:17:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:17:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-17 00:17:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:59,008 INFO L225 Difference]: With dead ends: 650 [2025-03-17 00:17:59,008 INFO L226 Difference]: Without dead ends: 225 [2025-03-17 00:17:59,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:17:59,009 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:59,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 140 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:17:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-17 00:17:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-17 00:17:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.31875) internal successors, (211), 160 states have internal predecessors, (211), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 00:17:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 335 transitions. [2025-03-17 00:17:59,027 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 335 transitions. Word has length 202 [2025-03-17 00:17:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:59,027 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 335 transitions. [2025-03-17 00:17:59,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 335 transitions. [2025-03-17 00:17:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:17:59,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:59,029 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:17:59,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:17:59,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash 97236110, now seen corresponding path program 1 times [2025-03-17 00:17:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:17:59,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564870437] [2025-03-17 00:17:59,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:17:59,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:17:59,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:17:59,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:59,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:17:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:17:59,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564870437] [2025-03-17 00:17:59,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564870437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:17:59,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:17:59,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:17:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696457408] [2025-03-17 00:17:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:17:59,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:17:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:17:59,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:17:59,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:17:59,145 INFO L87 Difference]: Start difference. First operand 225 states and 335 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:17:59,240 INFO L93 Difference]: Finished difference Result 665 states and 992 transitions. [2025-03-17 00:17:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:17:59,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-17 00:17:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:17:59,243 INFO L225 Difference]: With dead ends: 665 [2025-03-17 00:17:59,243 INFO L226 Difference]: Without dead ends: 441 [2025-03-17 00:17:59,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:17:59,247 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:17:59,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 400 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:17:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-17 00:17:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 231. [2025-03-17 00:17:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 166 states have (on average 1.3072289156626506) internal successors, (217), 166 states have internal predecessors, (217), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 00:17:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 341 transitions. [2025-03-17 00:17:59,296 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 341 transitions. Word has length 202 [2025-03-17 00:17:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:17:59,299 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 341 transitions. [2025-03-17 00:17:59,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:17:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 341 transitions. [2025-03-17 00:17:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:17:59,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:17:59,300 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:17:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:17:59,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:17:59,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:17:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1699715249, now seen corresponding path program 1 times [2025-03-17 00:17:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:17:59,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564799917] [2025-03-17 00:17:59,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:17:59,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:17:59,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:17:59,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:59,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 00:17:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:17:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564799917] [2025-03-17 00:17:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564799917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:17:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434106072] [2025-03-17 00:17:59,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:17:59,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:17:59,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:17:59,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:17:59,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:17:59,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:17:59,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:17:59,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:17:59,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:17:59,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 00:17:59,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:18:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-03-17 00:18:00,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:18:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 00:18:01,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434106072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:18:01,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:18:01,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2025-03-17 00:18:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531275257] [2025-03-17 00:18:01,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:18:01,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 00:18:01,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:18:01,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 00:18:01,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:18:01,124 INFO L87 Difference]: Start difference. First operand 231 states and 341 transitions. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-03-17 00:18:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:18:03,355 INFO L93 Difference]: Finished difference Result 809 states and 1169 transitions. [2025-03-17 00:18:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-17 00:18:03,355 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 202 [2025-03-17 00:18:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:18:03,358 INFO L225 Difference]: With dead ends: 809 [2025-03-17 00:18:03,359 INFO L226 Difference]: Without dead ends: 579 [2025-03-17 00:18:03,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2025-03-17 00:18:03,360 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1115 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:18:03,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1909 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 00:18:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-17 00:18:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 233. [2025-03-17 00:18:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 166 states have internal predecessors, (214), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 00:18:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 338 transitions. [2025-03-17 00:18:03,395 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 338 transitions. Word has length 202 [2025-03-17 00:18:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:18:03,396 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 338 transitions. [2025-03-17 00:18:03,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-03-17 00:18:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 338 transitions. [2025-03-17 00:18:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 00:18:03,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:18:03,398 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:03,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:18:03,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 00:18:03,603 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:18:03,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:18:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash -860938265, now seen corresponding path program 1 times [2025-03-17 00:18:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:18:03,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079244328] [2025-03-17 00:18:03,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:18:03,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 00:18:03,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 00:18:03,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:18:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 00:18:03,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:18:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079244328] [2025-03-17 00:18:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079244328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:18:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216731484] [2025-03-17 00:18:03,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:03,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:18:03,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:18:03,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:18:03,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:18:04,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 00:18:04,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 00:18:04,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:04,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:18:04,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 00:18:04,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:18:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 654 proven. 18 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2025-03-17 00:18:04,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:18:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 00:18:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216731484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:18:04,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:18:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-03-17 00:18:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282347185] [2025-03-17 00:18:04,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:18:04,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 00:18:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:18:04,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 00:18:04,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:18:04,678 INFO L87 Difference]: Start difference. First operand 233 states and 338 transitions. Second operand has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2025-03-17 00:18:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:18:05,623 INFO L93 Difference]: Finished difference Result 927 states and 1329 transitions. [2025-03-17 00:18:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 00:18:05,624 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 203 [2025-03-17 00:18:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:18:05,629 INFO L225 Difference]: With dead ends: 927 [2025-03-17 00:18:05,630 INFO L226 Difference]: Without dead ends: 695 [2025-03-17 00:18:05,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2025-03-17 00:18:05,631 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 515 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:18:05,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 778 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:18:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-17 00:18:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 671. [2025-03-17 00:18:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 484 states have (on average 1.28099173553719) internal successors, (620), 486 states have internal predecessors, (620), 172 states have call successors, (172), 14 states have call predecessors, (172), 14 states have return successors, (172), 170 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-17 00:18:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 964 transitions. [2025-03-17 00:18:05,753 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 964 transitions. Word has length 203 [2025-03-17 00:18:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:18:05,754 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 964 transitions. [2025-03-17 00:18:05,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2025-03-17 00:18:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 964 transitions. [2025-03-17 00:18:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 00:18:05,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:18:05,758 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:05,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:18:05,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:18:05,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:18:05,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:18:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 990178476, now seen corresponding path program 1 times [2025-03-17 00:18:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:18:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252221192] [2025-03-17 00:18:05,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:18:05,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 00:18:06,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 00:18:06,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:06,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:18:06,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481788551] [2025-03-17 00:18:06,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:06,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:18:06,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:18:06,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:18:06,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:18:06,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 00:18:06,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 00:18:06,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:06,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:18:06,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 00:18:06,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 00:18:06,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 00:18:06,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:06,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:18:06,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 00:18:06,360 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 00:18:06,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 00:18:06,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 00:18:06,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:18:06,567 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:06,715 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 00:18:06,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:18:06 BoogieIcfgContainer [2025-03-17 00:18:06,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 00:18:06,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 00:18:06,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 00:18:06,720 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 00:18:06,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:17:55" (3/4) ... [2025-03-17 00:18:06,722 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 00:18:06,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 00:18:06,725 INFO L158 Benchmark]: Toolchain (without parser) took 12043.65ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 134.0MB in the beginning and 72.4MB in the end (delta: 61.6MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. [2025-03-17 00:18:06,725 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:18:06,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.00ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 118.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 00:18:06,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.62ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 115.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:18:06,726 INFO L158 Benchmark]: Boogie Preprocessor took 46.86ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 111.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 00:18:06,726 INFO L158 Benchmark]: IcfgBuilder took 632.58ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 81.6MB in the end (delta: 29.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 00:18:06,727 INFO L158 Benchmark]: TraceAbstraction took 11021.87ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 80.8MB in the beginning and 72.4MB in the end (delta: 8.4MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2025-03-17 00:18:06,727 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 243.3MB. Free memory was 72.4MB in the beginning and 72.4MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:18:06,728 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.00ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 118.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.62ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 115.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.86ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 111.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 632.58ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 81.6MB in the end (delta: 29.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11021.87ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 80.8MB in the beginning and 72.4MB in the end (delta: 8.4MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 243.3MB. Free memory was 72.4MB in the beginning and 72.4MB in the end (delta: 39.1kB). 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 shiftLeft at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryArithmeticFLOAToperation at line 93, overapproximation of someUnaryFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] signed short int var_1_25 = 5; [L41] unsigned short int var_1_26 = 500; [L42] unsigned char var_1_27 = 1; [L43] signed short int var_1_28 = -32; [L44] unsigned short int var_1_29 = 54921; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 0; [L48] double var_1_33 = 10000000000000.8; [L49] float var_1_34 = 0.125; [L50] float var_1_35 = 8.5; [L51] float var_1_36 = 7.5; [L52] float var_1_37 = 3.2; [L53] unsigned char last_1_var_1_1 = 0; [L54] unsigned long int last_1_var_1_9 = 10; [L55] signed short int last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_16 = 1; [L57] signed char last_1_var_1_20 = 1; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_14 = var_1_14 [L175] last_1_var_1_16 = var_1_16 [L176] last_1_var_1_20 = var_1_20 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L122] var_1_8 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L125] var_1_11 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L126] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L127] var_1_12 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L128] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L129] var_1_13 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L131] var_1_15 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L132] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L133] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L134] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L134] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L135] var_1_17 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L136] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L137] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L137] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L138] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L138] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L139] var_1_18 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L140] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L141] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L141] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L142] var_1_19 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L143] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L144] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L145] var_1_21 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L146] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L147] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=5, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L148] var_1_25 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L149] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L150] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=1, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L151] var_1_27 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L153] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L153] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-32, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L154] var_1_28 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L155] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L156] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=54921, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L158] var_1_29 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L159] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L160] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L161] var_1_31 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L162] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L163] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_35=17/2, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L164] var_1_35 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 4611686.018427382800e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L165] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 4611686.018427382800e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_36=15/2, var_1_37=16/5, var_1_8=1, var_1_9=10] [L166] var_1_36 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_37=16/5, var_1_8=1, var_1_9=10] [L168] var_1_37 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_37 >= -461168.6018427382800e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L169] RET assume_abort_if_not((var_1_37 >= -461168.6018427382800e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L187] RET updateVariables() [L188] CALL step() [L61] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L62] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L67] COND TRUE ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))) >= ((((-16) > (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))) ? (-16) : (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) [L68] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=50000000000004/5, var_1_34=1/8, var_1_8=1, var_1_9=10] [L70] var_1_32 = 1 [L71] var_1_33 = 5.25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR var_1_26 >> var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR ((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR var_1_26 >> var_1_25 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] EXPR ((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=1/8, var_1_8=1, var_1_9=10] [L72] COND FALSE !(((((var_1_29) < ((var_1_26 >> var_1_25))) ? (var_1_29) : ((var_1_26 >> var_1_25)))) <= var_1_28) [L77] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L79] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L80] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L81] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L86] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L87] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L87] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L88] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L90] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L91] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L92] COND TRUE (! var_1_1) || stepLocal_4 [L93] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L101] var_1_20 = var_1_21 [L102] var_1_22 = var_1_12 [L103] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L104] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L107] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L107] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L108] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=4, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L113] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L114] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=4, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L115] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=4, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L116] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=4, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=4, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L179] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=4, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L179-L180] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=4, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=3, var_1_12=4, var_1_13=0, var_1_14=4, var_1_15=10, var_1_16=4, var_1_17=11, var_1_18=0, var_1_19=4, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=4, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=500, var_1_27=0, var_1_28=-1, var_1_29=32767, var_1_30=1, var_1_31=0, var_1_32=1, var_1_33=21/4, var_1_34=2, var_1_35=2, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 195 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 9, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2404 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2324 mSDsluCounter, 4547 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2947 mSDsCounter, 1126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2732 IncrementalHoareTripleChecker+Invalid, 3858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1126 mSolverCounterUnsat, 1600 mSDtfsCounter, 2732 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1102 GetRequests, 1008 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=671occurred in iteration=8, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 602 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2622 NumberOfCodeBlocks, 2622 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2604 ConstructedInterpolants, 0 QuantifiedInterpolants, 6374 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1440 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 23931/24180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 00:18:06,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:18:08,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:18:09,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 00:18:09,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:18:09,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:18:09,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:18:09,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:18:09,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:18:09,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:18:09,080 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:18:09,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:18:09,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:18:09,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:18:09,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:18:09,080 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:18:09,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:18:09,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:18:09,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:18:09,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:18:09,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:18:09,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:18:09,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:18:09,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:18:09,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 00:18:09,083 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 00:18:09,083 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 00:18:09,083 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:18:09,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:18:09,083 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:18:09,083 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:18:09,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:18:09,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:18:09,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:18:09,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:18:09,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:18:09,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:18:09,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:18:09,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:18:09,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:18:09,085 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 00:18:09,085 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 00:18:09,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:18:09,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:18:09,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:18:09,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:18:09,086 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 450871023bc04af6c52574b6b5134ab77c34540023c7d8e038f27ba262fd77fd [2025-03-17 00:18:09,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:18:09,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:18:09,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:18:09,411 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:18:09,412 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:18:09,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-03-17 00:18:09,994 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b54da938/54c463f6a814425ab66b398ba4f257aa/FLAG9c3ddba6a [2025-03-17 00:18:11,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:18:11,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-03-17 00:18:11,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b54da938/54c463f6a814425ab66b398ba4f257aa/FLAG9c3ddba6a [2025-03-17 00:18:11,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b54da938/54c463f6a814425ab66b398ba4f257aa [2025-03-17 00:18:11,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:18:11,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:18:11,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:18:11,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:18:11,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:18:11,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:18:11" (1/1) ... [2025-03-17 00:18:11,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50acf003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:11, skipping insertion in model container [2025-03-17 00:18:11,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:18:11" (1/1) ... [2025-03-17 00:18:11,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:18:11,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i[915,928] [2025-03-17 00:18:11,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:18:11,965 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:18:11,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-53.i[915,928] [2025-03-17 00:18:11,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:18:12,011 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:18:12,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12 WrapperNode [2025-03-17 00:18:12,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:18:12,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:18:12,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:18:12,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:18:12,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,053 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-03-17 00:18:12,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:18:12,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:18:12,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:18:12,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:18:12,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,085 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:18:12,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:18:12,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:18:12,115 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:18:12,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:18:12,116 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (1/1) ... [2025-03-17 00:18:12,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:18:12,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:18:12,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:18:12,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:18:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:18:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 00:18:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:18:12,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:18:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:18:12,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:18:12,266 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:18:12,268 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:18:13,384 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 00:18:13,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:18:13,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:18:13,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:18:13,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:18:13 BoogieIcfgContainer [2025-03-17 00:18:13,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:18:13,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:18:13,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:18:13,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:18:13,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:18:11" (1/3) ... [2025-03-17 00:18:13,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8e5384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:18:13, skipping insertion in model container [2025-03-17 00:18:13,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:12" (2/3) ... [2025-03-17 00:18:13,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8e5384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:18:13, skipping insertion in model container [2025-03-17 00:18:13,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:18:13" (3/3) ... [2025-03-17 00:18:13,404 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i [2025-03-17 00:18:13,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:18:13,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-53.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:18:13,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:18:13,479 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;@52e79afe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:18:13,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:18:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 00:18:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 00:18:13,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:18:13,496 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:13,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:18:13,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:18:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash -219444038, now seen corresponding path program 1 times [2025-03-17 00:18:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:18:13,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409295893] [2025-03-17 00:18:13,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:13,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:13,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:18:13,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:18:13,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 00:18:13,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 00:18:13,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 00:18:13,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:13,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:18:13,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:18:13,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:18:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-03-17 00:18:13,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:18:13,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:18:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409295893] [2025-03-17 00:18:13,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409295893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:18:13,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:18:13,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:18:13,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575959661] [2025-03-17 00:18:13,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:18:13,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:18:13,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:18:13,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:18:13,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:18:13,981 INFO L87 Difference]: Start difference. First operand has 81 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:18:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:18:14,011 INFO L93 Difference]: Finished difference Result 159 states and 283 transitions. [2025-03-17 00:18:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:18:14,015 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 191 [2025-03-17 00:18:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:18:14,022 INFO L225 Difference]: With dead ends: 159 [2025-03-17 00:18:14,022 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 00:18:14,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:18:14,029 INFO L435 NwaCegarLoop]: 123 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, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:18:14,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:18:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 00:18:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 00:18:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 00:18:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2025-03-17 00:18:14,081 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 191 [2025-03-17 00:18:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:18:14,081 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2025-03-17 00:18:14,083 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 00:18:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2025-03-17 00:18:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 00:18:14,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:18:14,087 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:14,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 00:18:14,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:14,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:18:14,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:18:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1287773753, now seen corresponding path program 1 times [2025-03-17 00:18:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:18:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424703326] [2025-03-17 00:18:14,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:14,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:14,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:18:14,295 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:18:14,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 00:18:14,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 00:18:14,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 00:18:14,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:14,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:18:14,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:18:14,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:18:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:18:15,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:18:15,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:18:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424703326] [2025-03-17 00:18:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424703326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:18:15,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:18:15,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:18:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524947900] [2025-03-17 00:18:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:18:15,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:18:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:18:15,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:18:15,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:18:15,184 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:18:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:18:15,534 INFO L93 Difference]: Finished difference Result 233 states and 363 transitions. [2025-03-17 00:18:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:18:15,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2025-03-17 00:18:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:18:15,538 INFO L225 Difference]: With dead ends: 233 [2025-03-17 00:18:15,538 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 00:18:15,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:18:15,540 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 22 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:18:15,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:18:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 00:18:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2025-03-17 00:18:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 00:18:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2025-03-17 00:18:15,576 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 191 [2025-03-17 00:18:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:18:15,577 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2025-03-17 00:18:15,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:18:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2025-03-17 00:18:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 00:18:15,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:18:15,584 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 00:18:15,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:15,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:18:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:18:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash 285998477, now seen corresponding path program 1 times [2025-03-17 00:18:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:18:15,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308898591] [2025-03-17 00:18:15,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:15,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:18:15,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:18:15,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 00:18:15,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 00:18:16,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 00:18:16,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:16,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:18:16,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:18:16,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:18:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:18:17,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:18:17,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:18:17,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308898591] [2025-03-17 00:18:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308898591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:18:17,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:18:17,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:18:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279316548] [2025-03-17 00:18:17,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:18:17,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:18:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:18:17,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:18:17,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:18:17,352 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:18:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:18:18,213 INFO L93 Difference]: Finished difference Result 382 states and 592 transitions. [2025-03-17 00:18:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:18:18,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 00:18:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:18:18,230 INFO L225 Difference]: With dead ends: 382 [2025-03-17 00:18:18,232 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 00:18:18,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:18:18,234 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 67 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:18:18,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 403 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 00:18:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 00:18:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2025-03-17 00:18:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 117 states have (on average 1.264957264957265) internal successors, (148), 117 states have internal predecessors, (148), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 00:18:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 334 transitions. [2025-03-17 00:18:18,272 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 334 transitions. Word has length 192 [2025-03-17 00:18:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:18:18,274 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 334 transitions. [2025-03-17 00:18:18,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:18:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 334 transitions. [2025-03-17 00:18:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 00:18:18,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:18:18,278 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:18,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:18:18,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:18,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:18:18,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:18:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash -307872631, now seen corresponding path program 1 times [2025-03-17 00:18:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:18:18,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109615801] [2025-03-17 00:18:18,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:18,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:18,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:18:18,482 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:18:18,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 00:18:18,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 00:18:18,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 00:18:18,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:18,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:18:18,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:18:18,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:18:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 00:18:18,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:18:18,879 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:18:18,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109615801] [2025-03-17 00:18:18,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109615801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:18:18,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:18:18,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:18:18,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63059835] [2025-03-17 00:18:18,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:18:18,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:18:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:18:18,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:18:18,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:18:18,882 INFO L87 Difference]: Start difference. First operand 214 states and 334 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:18:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:18:19,262 INFO L93 Difference]: Finished difference Result 450 states and 700 transitions. [2025-03-17 00:18:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:18:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 00:18:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:18:19,271 INFO L225 Difference]: With dead ends: 450 [2025-03-17 00:18:19,271 INFO L226 Difference]: Without dead ends: 298 [2025-03-17 00:18:19,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:18:19,273 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 116 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:18:19,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 342 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:18:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-17 00:18:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2025-03-17 00:18:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 119 states have internal predecessors, (150), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 00:18:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 336 transitions. [2025-03-17 00:18:19,305 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 336 transitions. Word has length 192 [2025-03-17 00:18:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:18:19,305 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 336 transitions. [2025-03-17 00:18:19,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 00:18:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 336 transitions. [2025-03-17 00:18:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 00:18:19,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:18:19,308 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:19,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 00:18:19,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:19,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:18:19,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:18:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash -279243480, now seen corresponding path program 1 times [2025-03-17 00:18:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:18:19,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811445912] [2025-03-17 00:18:19,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:19,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:19,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:18:19,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:18:19,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 00:18:19,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 00:18:19,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 00:18:19,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:19,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:18:19,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 00:18:19,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:18:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-03-17 00:18:20,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:18:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 00:18:20,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:18:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811445912] [2025-03-17 00:18:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811445912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:18:20,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:18:20,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-17 00:18:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578482039] [2025-03-17 00:18:20,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 00:18:20,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:18:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:18:20,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:18:20,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:18:20,591 INFO L87 Difference]: Start difference. First operand 216 states and 336 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-17 00:18:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:18:23,420 INFO L93 Difference]: Finished difference Result 481 states and 727 transitions. [2025-03-17 00:18:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 00:18:23,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 192 [2025-03-17 00:18:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:18:23,426 INFO L225 Difference]: With dead ends: 481 [2025-03-17 00:18:23,426 INFO L226 Difference]: Without dead ends: 327 [2025-03-17 00:18:23,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2025-03-17 00:18:23,431 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 330 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:18:23,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 780 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 00:18:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-17 00:18:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 226. [2025-03-17 00:18:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 126 states have internal predecessors, (156), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 00:18:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 342 transitions. [2025-03-17 00:18:23,480 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 342 transitions. Word has length 192 [2025-03-17 00:18:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:18:23,480 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 342 transitions. [2025-03-17 00:18:23,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-17 00:18:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 342 transitions. [2025-03-17 00:18:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 00:18:23,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:18:23,481 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:18:23,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 00:18:23,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:23,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:18:23,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:18:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -955008743, now seen corresponding path program 1 times [2025-03-17 00:18:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:18:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745803392] [2025-03-17 00:18:23,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:18:23,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:18:23,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:18:23,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:18:23,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 00:18:23,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 00:18:23,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 00:18:23,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:18:23,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:18:23,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 00:18:23,941 INFO L279 TraceCheckSpWp]: Computing forward predicates...