./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.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 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 21:25:03,656 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 21:25:03,707 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 21:25:03,711 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 21:25:03,711 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 21:25:03,732 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 21:25:03,733 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 21:25:03,733 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 21:25:03,733 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 21:25:03,734 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 21:25:03,734 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 21:25:03,735 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 21:25:03,735 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 21:25:03,735 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 21:25:03,735 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 21:25:03,735 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 21:25:03,735 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 21:25:03,735 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 21:25:03,735 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 21:25:03,736 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 21:25:03,737 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 21:25:03,737 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 21:25:03,737 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 21:25:03,737 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 21:25:03,737 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 21:25:03,737 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 21:25:03,738 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 21:25:03,738 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 -> 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349
[2025-03-03 21:25:03,955 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 21:25:03,961 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 21:25:03,964 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 21:25:03,965 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 21:25:03,965 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 21:25:03,967 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i
[2025-03-03 21:25:05,103 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aabe554d/a5d3c83028f44644a4822b8354d9ef8e/FLAG3fa6cb240
[2025-03-03 21:25:05,327 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 21:25:05,327 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i
[2025-03-03 21:25:05,334 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aabe554d/a5d3c83028f44644a4822b8354d9ef8e/FLAG3fa6cb240
[2025-03-03 21:25:05,667 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aabe554d/a5d3c83028f44644a4822b8354d9ef8e
[2025-03-03 21:25:05,669 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 21:25:05,671 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 21:25:05,672 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 21:25:05,672 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 21:25:05,675 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 21:25:05,676 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:05,676 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05, skipping insertion in model container
[2025-03-03 21:25:05,676 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:05,690 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 21:25:05,792 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_fillercodestructure_filler-pr-co_file-3.i[918,931]
[2025-03-03 21:25:05,865 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 21:25:05,876 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 21:25:05,884 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_fillercodestructure_filler-pr-co_file-3.i[918,931]
[2025-03-03 21:25:05,914 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 21:25:05,928 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 21:25:05,928 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05 WrapperNode
[2025-03-03 21:25:05,929 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 21:25:05,930 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 21:25:05,930 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 21:25:05,930 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 21:25:05,934 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:05,942 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:05,983 INFO  L138                Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271
[2025-03-03 21:25:05,984 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 21:25:05,984 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 21:25:05,985 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 21:25:05,985 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 21:25:05,990 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:05,990 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:05,998 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:06,017 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 21:25:06,019 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:06,020 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:06,031 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:06,036 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:06,037 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:06,041 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:06,046 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 21:25:06,047 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 21:25:06,048 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 21:25:06,048 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 21:25:06,049 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (1/1) ...
[2025-03-03 21:25:06,053 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 21:25:06,061 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:25:06,074 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 21:25:06,077 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 21:25:06,093 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 21:25:06,093 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 21:25:06,093 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 21:25:06,093 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 21:25:06,093 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 21:25:06,093 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 21:25:06,158 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 21:25:06,159 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 21:25:06,545 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L198: havoc property_#t~bitwise27#1;havoc property_#t~short28#1;
[2025-03-03 21:25:06,577 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2025-03-03 21:25:06,577 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 21:25:06,597 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 21:25:06,597 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 21:25:06,597 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:06 BoogieIcfgContainer
[2025-03-03 21:25:06,597 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 21:25:06,600 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 21:25:06,600 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 21:25:06,603 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 21:25:06,603 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:25:05" (1/3) ...
[2025-03-03 21:25:06,604 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7e48ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:25:06, skipping insertion in model container
[2025-03-03 21:25:06,604 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:05" (2/3) ...
[2025-03-03 21:25:06,604 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7e48ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:25:06, skipping insertion in model container
[2025-03-03 21:25:06,604 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:06" (3/3) ...
[2025-03-03 21:25:06,605 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i
[2025-03-03 21:25:06,614 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 21:25:06,615 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 21:25:06,652 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 21:25:06,659 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;@7fd6f025, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 21:25:06,659 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 21:25:06,661 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-03 21:25:06,672 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2025-03-03 21:25:06,672 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:06,672 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:06,673 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:06,676 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:06,676 INFO  L85        PathProgramCache]: Analyzing trace with hash -1884464851, now seen corresponding path program 1 times
[2025-03-03 21:25:06,680 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:06,680 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694254708]
[2025-03-03 21:25:06,681 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:06,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:06,782 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-03 21:25:06,805 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-03 21:25:06,807 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:06,807 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:07,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-03-03 21:25:07,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:07,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694254708]
[2025-03-03 21:25:07,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694254708] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 21:25:07,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756235869]
[2025-03-03 21:25:07,012 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:07,012 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:25:07,012 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:25:07,014 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 21:25:07,016 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 21:25:07,095 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes.
[2025-03-03 21:25:07,182 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements.
[2025-03-03 21:25:07,182 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:07,182 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:07,185 INFO  L256         TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 21:25:07,193 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 21:25:07,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-03-03 21:25:07,223 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 21:25:07,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [756235869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:07,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 21:25:07,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 21:25:07,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690240920]
[2025-03-03 21:25:07,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:07,228 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 21:25:07,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:07,245 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 21:25:07,246 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 21:25:07,248 INFO  L87              Difference]: Start difference. First operand  has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-03 21:25:07,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:07,301 INFO  L93              Difference]: Finished difference Result 238 states and 421 transitions.
[2025-03-03 21:25:07,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 21:25:07,303 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 221
[2025-03-03 21:25:07,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:07,312 INFO  L225             Difference]: With dead ends: 238
[2025-03-03 21:25:07,312 INFO  L226             Difference]: Without dead ends: 119
[2025-03-03 21:25:07,316 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 21:25:07,319 INFO  L435           NwaCegarLoop]: 182 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, 182 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-03 21:25:07,319 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 21:25:07,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-03-03 21:25:07,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2025-03-03 21:25:07,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-03 21:25:07,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 188 transitions.
[2025-03-03 21:25:07,354 INFO  L78                 Accepts]: Start accepts. Automaton has 119 states and 188 transitions. Word has length 221
[2025-03-03 21:25:07,354 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:07,354 INFO  L471      AbstractCegarLoop]: Abstraction has 119 states and 188 transitions.
[2025-03-03 21:25:07,355 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-03 21:25:07,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 119 states and 188 transitions.
[2025-03-03 21:25:07,357 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 224
[2025-03-03 21:25:07,357 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:07,357 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:07,364 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 21:25:07,558 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-03 21:25:07,558 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:07,559 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:07,559 INFO  L85        PathProgramCache]: Analyzing trace with hash -543114778, now seen corresponding path program 1 times
[2025-03-03 21:25:07,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:07,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796680060]
[2025-03-03 21:25:07,559 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:07,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:07,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes.
[2025-03-03 21:25:07,644 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements.
[2025-03-03 21:25:07,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:07,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:07,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:07,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:07,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796680060]
[2025-03-03 21:25:07,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796680060] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:07,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:07,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 21:25:07,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616807523]
[2025-03-03 21:25:07,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:07,967 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 21:25:07,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:07,967 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 21:25:07,968 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:07,968 INFO  L87              Difference]: Start difference. First operand 119 states and 188 transitions. Second operand  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:08,068 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:08,070 INFO  L93              Difference]: Finished difference Result 351 states and 558 transitions.
[2025-03-03 21:25:08,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 21:25:08,071 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223
[2025-03-03 21:25:08,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:08,074 INFO  L225             Difference]: With dead ends: 351
[2025-03-03 21:25:08,075 INFO  L226             Difference]: Without dead ends: 235
[2025-03-03 21:25:08,077 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-03 21:25:08,079 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 110 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:08,079 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 348 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 21:25:08,079 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 235 states.
[2025-03-03 21:25:08,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233.
[2025-03-03 21:25:08,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 233 states, 162 states have (on average 1.4320987654320987) internal successors, (232), 162 states have internal predecessors, (232), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-03-03 21:25:08,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 368 transitions.
[2025-03-03 21:25:08,115 INFO  L78                 Accepts]: Start accepts. Automaton has 233 states and 368 transitions. Word has length 223
[2025-03-03 21:25:08,116 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:08,116 INFO  L471      AbstractCegarLoop]: Abstraction has 233 states and 368 transitions.
[2025-03-03 21:25:08,116 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:08,116 INFO  L276                IsEmpty]: Start isEmpty. Operand 233 states and 368 transitions.
[2025-03-03 21:25:08,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-03-03 21:25:08,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:08,120 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:08,120 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 21:25:08,120 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:08,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:08,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1480371505, now seen corresponding path program 1 times
[2025-03-03 21:25:08,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:08,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617958121]
[2025-03-03 21:25:08,122 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:08,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:08,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-03 21:25:08,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-03 21:25:08,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:08,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:08,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:08,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:08,236 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617958121]
[2025-03-03 21:25:08,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617958121] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:08,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:08,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 21:25:08,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233257158]
[2025-03-03 21:25:08,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:08,237 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 21:25:08,237 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:08,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 21:25:08,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:08,240 INFO  L87              Difference]: Start difference. First operand 233 states and 368 transitions. Second operand  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:08,302 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:08,303 INFO  L93              Difference]: Finished difference Result 573 states and 904 transitions.
[2025-03-03 21:25:08,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 21:25:08,303 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224
[2025-03-03 21:25:08,305 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:08,306 INFO  L225             Difference]: With dead ends: 573
[2025-03-03 21:25:08,309 INFO  L226             Difference]: Without dead ends: 343
[2025-03-03 21:25:08,310 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-03 21:25:08,311 INFO  L435           NwaCegarLoop]: 249 mSDtfsCounter, 78 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:08,311 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 412 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 21:25:08,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 343 states.
[2025-03-03 21:25:08,336 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 285.
[2025-03-03 21:25:08,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 285 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-03-03 21:25:08,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 454 transitions.
[2025-03-03 21:25:08,340 INFO  L78                 Accepts]: Start accepts. Automaton has 285 states and 454 transitions. Word has length 224
[2025-03-03 21:25:08,340 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:08,340 INFO  L471      AbstractCegarLoop]: Abstraction has 285 states and 454 transitions.
[2025-03-03 21:25:08,341 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:08,341 INFO  L276                IsEmpty]: Start isEmpty. Operand 285 states and 454 transitions.
[2025-03-03 21:25:08,342 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-03-03 21:25:08,342 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:08,342 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:08,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 21:25:08,343 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:08,343 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:08,344 INFO  L85        PathProgramCache]: Analyzing trace with hash 747287635, now seen corresponding path program 1 times
[2025-03-03 21:25:08,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:08,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818029732]
[2025-03-03 21:25:08,344 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:08,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:08,366 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-03 21:25:08,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-03 21:25:08,390 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:08,390 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:08,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:08,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:08,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818029732]
[2025-03-03 21:25:08,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818029732] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:08,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:08,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 21:25:08,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337188360]
[2025-03-03 21:25:08,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:08,502 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 21:25:08,502 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:08,502 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 21:25:08,503 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:08,503 INFO  L87              Difference]: Start difference. First operand 285 states and 454 transitions. Second operand  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:08,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:08,618 INFO  L93              Difference]: Finished difference Result 829 states and 1330 transitions.
[2025-03-03 21:25:08,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 21:25:08,618 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224
[2025-03-03 21:25:08,618 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:08,623 INFO  L225             Difference]: With dead ends: 829
[2025-03-03 21:25:08,623 INFO  L226             Difference]: Without dead ends: 547
[2025-03-03 21:25:08,624 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:08,626 INFO  L435           NwaCegarLoop]: 327 mSDtfsCounter, 165 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:08,627 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 477 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 21:25:08,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 547 states.
[2025-03-03 21:25:08,675 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545.
[2025-03-03 21:25:08,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 545 states, 404 states have (on average 1.4653465346534653) internal successors, (592), 404 states have internal predecessors, (592), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136)
[2025-03-03 21:25:08,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 864 transitions.
[2025-03-03 21:25:08,680 INFO  L78                 Accepts]: Start accepts. Automaton has 545 states and 864 transitions. Word has length 224
[2025-03-03 21:25:08,681 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:08,682 INFO  L471      AbstractCegarLoop]: Abstraction has 545 states and 864 transitions.
[2025-03-03 21:25:08,682 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:08,682 INFO  L276                IsEmpty]: Start isEmpty. Operand 545 states and 864 transitions.
[2025-03-03 21:25:08,684 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-03-03 21:25:08,684 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:08,684 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:08,684 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 21:25:08,684 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:08,685 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:08,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 1868530045, now seen corresponding path program 1 times
[2025-03-03 21:25:08,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:08,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110143897]
[2025-03-03 21:25:08,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:08,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:08,699 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-03 21:25:08,739 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-03 21:25:08,739 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:08,739 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:08,975 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:08,975 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:08,976 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110143897]
[2025-03-03 21:25:08,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110143897] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:08,976 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:08,976 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 21:25:08,976 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265729634]
[2025-03-03 21:25:08,976 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:08,976 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 21:25:08,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:08,977 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 21:25:08,977 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 21:25:08,977 INFO  L87              Difference]: Start difference. First operand 545 states and 864 transitions. Second operand  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:09,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:09,291 INFO  L93              Difference]: Finished difference Result 1633 states and 2591 transitions.
[2025-03-03 21:25:09,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 21:25:09,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 225
[2025-03-03 21:25:09,292 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:09,298 INFO  L225             Difference]: With dead ends: 1633
[2025-03-03 21:25:09,298 INFO  L226             Difference]: Without dead ends: 1091
[2025-03-03 21:25:09,300 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-03-03 21:25:09,300 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 124 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:09,300 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 699 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 21:25:09,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1091 states.
[2025-03-03 21:25:09,364 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1083.
[2025-03-03 21:25:09,367 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1083 states, 802 states have (on average 1.458852867830424) internal successors, (1170), 802 states have internal predecessors, (1170), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272)
[2025-03-03 21:25:09,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1714 transitions.
[2025-03-03 21:25:09,378 INFO  L78                 Accepts]: Start accepts. Automaton has 1083 states and 1714 transitions. Word has length 225
[2025-03-03 21:25:09,379 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:09,379 INFO  L471      AbstractCegarLoop]: Abstraction has 1083 states and 1714 transitions.
[2025-03-03 21:25:09,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:09,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 1083 states and 1714 transitions.
[2025-03-03 21:25:09,381 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-03 21:25:09,381 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:09,382 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:09,382 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 21:25:09,382 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:09,382 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:09,383 INFO  L85        PathProgramCache]: Analyzing trace with hash 1226261957, now seen corresponding path program 1 times
[2025-03-03 21:25:09,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:09,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016916189]
[2025-03-03 21:25:09,383 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:09,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:09,403 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-03 21:25:09,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-03 21:25:09,436 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:09,436 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:09,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:09,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:09,611 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016916189]
[2025-03-03 21:25:09,611 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016916189] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:09,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:09,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 21:25:09,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825769031]
[2025-03-03 21:25:09,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:09,612 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 21:25:09,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:09,613 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 21:25:09,613 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:09,613 INFO  L87              Difference]: Start difference. First operand 1083 states and 1714 transitions. Second operand  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:09,763 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:09,764 INFO  L93              Difference]: Finished difference Result 2725 states and 4322 transitions.
[2025-03-03 21:25:09,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 21:25:09,765 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226
[2025-03-03 21:25:09,765 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:09,773 INFO  L225             Difference]: With dead ends: 2725
[2025-03-03 21:25:09,774 INFO  L226             Difference]: Without dead ends: 1645
[2025-03-03 21:25:09,777 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-03 21:25:09,778 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 117 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:09,778 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 349 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 21:25:09,780 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1645 states.
[2025-03-03 21:25:09,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1643.
[2025-03-03 21:25:09,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1643 states, 1222 states have (on average 1.4549918166939444) internal successors, (1778), 1222 states have internal predecessors, (1778), 408 states have call successors, (408), 12 states have call predecessors, (408), 12 states have return successors, (408), 408 states have call predecessors, (408), 408 states have call successors, (408)
[2025-03-03 21:25:09,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2594 transitions.
[2025-03-03 21:25:09,863 INFO  L78                 Accepts]: Start accepts. Automaton has 1643 states and 2594 transitions. Word has length 226
[2025-03-03 21:25:09,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:09,863 INFO  L471      AbstractCegarLoop]: Abstraction has 1643 states and 2594 transitions.
[2025-03-03 21:25:09,863 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:09,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 1643 states and 2594 transitions.
[2025-03-03 21:25:09,867 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-03 21:25:09,868 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:09,869 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:09,869 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 21:25:09,869 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:09,869 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:09,870 INFO  L85        PathProgramCache]: Analyzing trace with hash 1214945830, now seen corresponding path program 1 times
[2025-03-03 21:25:09,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:09,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355898649]
[2025-03-03 21:25:09,870 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:09,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:09,888 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-03 21:25:09,976 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-03 21:25:09,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:09,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:10,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:10,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:10,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355898649]
[2025-03-03 21:25:10,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355898649] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:10,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:10,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 21:25:10,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780709715]
[2025-03-03 21:25:10,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:10,178 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 21:25:10,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:10,179 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 21:25:10,179 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 21:25:10,179 INFO  L87              Difference]: Start difference. First operand 1643 states and 2594 transitions. Second operand  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:10,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:10,490 INFO  L93              Difference]: Finished difference Result 2725 states and 4306 transitions.
[2025-03-03 21:25:10,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 21:25:10,491 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226
[2025-03-03 21:25:10,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:10,500 INFO  L225             Difference]: With dead ends: 2725
[2025-03-03 21:25:10,500 INFO  L226             Difference]: Without dead ends: 1645
[2025-03-03 21:25:10,503 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 21:25:10,504 INFO  L435           NwaCegarLoop]: 287 mSDtfsCounter, 153 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:10,505 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 630 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 21:25:10,506 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1645 states.
[2025-03-03 21:25:10,579 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1643.
[2025-03-03 21:25:10,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1643 states, 1222 states have (on average 1.4517184942716859) internal successors, (1774), 1222 states have internal predecessors, (1774), 408 states have call successors, (408), 12 states have call predecessors, (408), 12 states have return successors, (408), 408 states have call predecessors, (408), 408 states have call successors, (408)
[2025-03-03 21:25:10,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2590 transitions.
[2025-03-03 21:25:10,593 INFO  L78                 Accepts]: Start accepts. Automaton has 1643 states and 2590 transitions. Word has length 226
[2025-03-03 21:25:10,593 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:10,593 INFO  L471      AbstractCegarLoop]: Abstraction has 1643 states and 2590 transitions.
[2025-03-03 21:25:10,593 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:10,594 INFO  L276                IsEmpty]: Start isEmpty. Operand 1643 states and 2590 transitions.
[2025-03-03 21:25:10,596 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-03-03 21:25:10,597 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:10,597 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:10,597 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 21:25:10,597 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:10,598 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:10,598 INFO  L85        PathProgramCache]: Analyzing trace with hash -2001744758, now seen corresponding path program 1 times
[2025-03-03 21:25:10,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:10,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455601986]
[2025-03-03 21:25:10,598 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:10,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:10,613 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-03-03 21:25:10,636 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-03-03 21:25:10,637 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:10,637 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:10,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:10,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:10,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455601986]
[2025-03-03 21:25:10,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455601986] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:10,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:10,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 21:25:10,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719585406]
[2025-03-03 21:25:10,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:10,999 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 21:25:11,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:11,000 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 21:25:11,000 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 21:25:11,000 INFO  L87              Difference]: Start difference. First operand 1643 states and 2590 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:12,320 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:12,321 INFO  L93              Difference]: Finished difference Result 7819 states and 12167 transitions.
[2025-03-03 21:25:12,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 21:25:12,322 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 227
[2025-03-03 21:25:12,322 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:12,353 INFO  L225             Difference]: With dead ends: 7819
[2025-03-03 21:25:12,353 INFO  L226             Difference]: Without dead ends: 6179
[2025-03-03 21:25:12,359 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2025-03-03 21:25:12,360 INFO  L435           NwaCegarLoop]: 190 mSDtfsCounter, 767 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:12,360 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 591 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 21:25:12,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6179 states.
[2025-03-03 21:25:12,834 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5122.
[2025-03-03 21:25:12,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5122 states, 3721 states have (on average 1.416285944638538) internal successors, (5270), 3742 states have internal predecessors, (5270), 1351 states have call successors, (1351), 49 states have call predecessors, (1351), 49 states have return successors, (1351), 1330 states have call predecessors, (1351), 1351 states have call successors, (1351)
[2025-03-03 21:25:12,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 7972 transitions.
[2025-03-03 21:25:12,875 INFO  L78                 Accepts]: Start accepts. Automaton has 5122 states and 7972 transitions. Word has length 227
[2025-03-03 21:25:12,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:12,876 INFO  L471      AbstractCegarLoop]: Abstraction has 5122 states and 7972 transitions.
[2025-03-03 21:25:12,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:12,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 5122 states and 7972 transitions.
[2025-03-03 21:25:12,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-03-03 21:25:12,881 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:12,881 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:12,881 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 21:25:12,881 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:12,881 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:12,882 INFO  L85        PathProgramCache]: Analyzing trace with hash -258934423, now seen corresponding path program 1 times
[2025-03-03 21:25:12,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:12,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126800030]
[2025-03-03 21:25:12,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:12,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:12,898 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-03-03 21:25:12,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-03-03 21:25:12,961 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:12,961 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:13,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-03 21:25:13,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:13,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126800030]
[2025-03-03 21:25:13,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126800030] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 21:25:13,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492903507]
[2025-03-03 21:25:13,151 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:13,151 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:25:13,152 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:25:13,153 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 21:25:13,155 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 21:25:13,217 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-03-03 21:25:13,269 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-03-03 21:25:13,269 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:13,269 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:13,273 INFO  L256         TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-03 21:25:13,281 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 21:25:13,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked.
[2025-03-03 21:25:13,479 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 21:25:13,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-03 21:25:13,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [492903507] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 21:25:13,720 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 21:25:13,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9
[2025-03-03 21:25:13,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597494475]
[2025-03-03 21:25:13,721 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 21:25:13,721 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 21:25:13,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:13,722 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 21:25:13,725 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-03-03 21:25:13,726 INFO  L87              Difference]: Start difference. First operand 5122 states and 7972 transitions. Second operand  has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59)
[2025-03-03 21:25:14,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:14,567 INFO  L93              Difference]: Finished difference Result 11375 states and 17670 transitions.
[2025-03-03 21:25:14,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 21:25:14,569 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 227
[2025-03-03 21:25:14,569 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:14,601 INFO  L225             Difference]: With dead ends: 11375
[2025-03-03 21:25:14,601 INFO  L226             Difference]: Without dead ends: 6067
[2025-03-03 21:25:14,613 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306
[2025-03-03 21:25:14,616 INFO  L435           NwaCegarLoop]: 222 mSDtfsCounter, 399 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:14,617 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 653 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 21:25:14,622 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6067 states.
[2025-03-03 21:25:14,943 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 4801.
[2025-03-03 21:25:14,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4801 states, 3528 states have (on average 1.4229024943310657) internal successors, (5020), 3528 states have internal predecessors, (5020), 1190 states have call successors, (1190), 82 states have call predecessors, (1190), 82 states have return successors, (1190), 1190 states have call predecessors, (1190), 1190 states have call successors, (1190)
[2025-03-03 21:25:14,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 7400 transitions.
[2025-03-03 21:25:14,984 INFO  L78                 Accepts]: Start accepts. Automaton has 4801 states and 7400 transitions. Word has length 227
[2025-03-03 21:25:14,985 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:14,985 INFO  L471      AbstractCegarLoop]: Abstraction has 4801 states and 7400 transitions.
[2025-03-03 21:25:14,986 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59)
[2025-03-03 21:25:14,986 INFO  L276                IsEmpty]: Start isEmpty. Operand 4801 states and 7400 transitions.
[2025-03-03 21:25:14,989 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-03 21:25:14,989 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:14,989 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:14,996 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-03 21:25:15,192 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,SelfDestructingSolverStorable8
[2025-03-03 21:25:15,192 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:15,193 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:15,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 1600365532, now seen corresponding path program 1 times
[2025-03-03 21:25:15,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:15,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613849168]
[2025-03-03 21:25:15,193 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:15,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:15,209 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-03 21:25:15,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-03 21:25:15,226 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:15,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:15,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:15,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:15,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613849168]
[2025-03-03 21:25:15,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613849168] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:15,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:15,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 21:25:15,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182311051]
[2025-03-03 21:25:15,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:15,375 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 21:25:15,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:15,376 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 21:25:15,376 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 21:25:15,376 INFO  L87              Difference]: Start difference. First operand 4801 states and 7400 transitions. Second operand  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:16,360 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:16,361 INFO  L93              Difference]: Finished difference Result 12584 states and 19420 transitions.
[2025-03-03 21:25:16,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 21:25:16,361 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228
[2025-03-03 21:25:16,363 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:16,402 INFO  L225             Difference]: With dead ends: 12584
[2025-03-03 21:25:16,403 INFO  L226             Difference]: Without dead ends: 7408
[2025-03-03 21:25:16,418 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 21:25:16,419 INFO  L435           NwaCegarLoop]: 176 mSDtfsCounter, 745 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:16,419 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 695 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 21:25:16,426 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7408 states.
[2025-03-03 21:25:16,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7245.
[2025-03-03 21:25:16,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7245 states, 5321 states have (on average 1.3991730877654576) internal successors, (7445), 5321 states have internal predecessors, (7445), 1802 states have call successors, (1802), 121 states have call predecessors, (1802), 121 states have return successors, (1802), 1802 states have call predecessors, (1802), 1802 states have call successors, (1802)
[2025-03-03 21:25:16,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7245 states to 7245 states and 11049 transitions.
[2025-03-03 21:25:16,897 INFO  L78                 Accepts]: Start accepts. Automaton has 7245 states and 11049 transitions. Word has length 228
[2025-03-03 21:25:16,898 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:16,898 INFO  L471      AbstractCegarLoop]: Abstraction has 7245 states and 11049 transitions.
[2025-03-03 21:25:16,898 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:16,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 7245 states and 11049 transitions.
[2025-03-03 21:25:16,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-03 21:25:16,901 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:16,901 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:16,901 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 21:25:16,901 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:16,901 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:16,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345628987, now seen corresponding path program 1 times
[2025-03-03 21:25:16,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:16,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513161119]
[2025-03-03 21:25:16,902 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:16,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:16,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-03 21:25:16,931 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-03 21:25:16,931 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:16,931 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:17,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:17,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:17,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513161119]
[2025-03-03 21:25:17,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513161119] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:17,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:17,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 21:25:17,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048659248]
[2025-03-03 21:25:17,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:17,125 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 21:25:17,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:17,126 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 21:25:17,126 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:17,126 INFO  L87              Difference]: Start difference. First operand 7245 states and 11049 transitions. Second operand  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:17,750 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:17,750 INFO  L93              Difference]: Finished difference Result 14492 states and 22099 transitions.
[2025-03-03 21:25:17,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 21:25:17,751 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228
[2025-03-03 21:25:17,751 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:17,791 INFO  L225             Difference]: With dead ends: 14492
[2025-03-03 21:25:17,791 INFO  L226             Difference]: Without dead ends: 7250
[2025-03-03 21:25:17,815 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:17,817 INFO  L435           NwaCegarLoop]: 204 mSDtfsCounter, 111 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:17,818 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 346 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 21:25:17,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7250 states.
[2025-03-03 21:25:18,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7250 to 7245.
[2025-03-03 21:25:18,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7245 states, 5321 states have (on average 1.397481676376621) internal successors, (7436), 5321 states have internal predecessors, (7436), 1802 states have call successors, (1802), 121 states have call predecessors, (1802), 121 states have return successors, (1802), 1802 states have call predecessors, (1802), 1802 states have call successors, (1802)
[2025-03-03 21:25:18,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7245 states to 7245 states and 11040 transitions.
[2025-03-03 21:25:18,303 INFO  L78                 Accepts]: Start accepts. Automaton has 7245 states and 11040 transitions. Word has length 228
[2025-03-03 21:25:18,304 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:18,304 INFO  L471      AbstractCegarLoop]: Abstraction has 7245 states and 11040 transitions.
[2025-03-03 21:25:18,305 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:18,305 INFO  L276                IsEmpty]: Start isEmpty. Operand 7245 states and 11040 transitions.
[2025-03-03 21:25:18,307 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-03 21:25:18,307 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:18,307 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:18,308 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 21:25:18,308 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:18,308 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:18,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 994829050, now seen corresponding path program 1 times
[2025-03-03 21:25:18,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:18,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323428311]
[2025-03-03 21:25:18,308 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:18,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:18,321 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-03 21:25:18,337 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-03 21:25:18,339 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:18,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:18,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:18,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:18,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323428311]
[2025-03-03 21:25:18,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323428311] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:18,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:18,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 21:25:18,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315018249]
[2025-03-03 21:25:18,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:18,846 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 21:25:18,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:18,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 21:25:18,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 21:25:18,847 INFO  L87              Difference]: Start difference. First operand 7245 states and 11040 transitions. Second operand  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:19,386 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:19,386 INFO  L93              Difference]: Finished difference Result 17735 states and 26420 transitions.
[2025-03-03 21:25:19,387 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 21:25:19,387 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228
[2025-03-03 21:25:19,387 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:19,420 INFO  L225             Difference]: With dead ends: 17735
[2025-03-03 21:25:19,421 INFO  L226             Difference]: Without dead ends: 10493
[2025-03-03 21:25:19,436 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 21:25:19,437 INFO  L435           NwaCegarLoop]: 219 mSDtfsCounter, 200 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:19,437 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 770 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 21:25:19,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10493 states.
[2025-03-03 21:25:19,846 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10493 to 8735.
[2025-03-03 21:25:19,855 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8735 states, 6811 states have (on average 1.3958302745558655) internal successors, (9507), 6811 states have internal predecessors, (9507), 1802 states have call successors, (1802), 121 states have call predecessors, (1802), 121 states have return successors, (1802), 1802 states have call predecessors, (1802), 1802 states have call successors, (1802)
[2025-03-03 21:25:19,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 13111 transitions.
[2025-03-03 21:25:19,885 INFO  L78                 Accepts]: Start accepts. Automaton has 8735 states and 13111 transitions. Word has length 228
[2025-03-03 21:25:19,885 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:19,886 INFO  L471      AbstractCegarLoop]: Abstraction has 8735 states and 13111 transitions.
[2025-03-03 21:25:19,886 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:19,886 INFO  L276                IsEmpty]: Start isEmpty. Operand 8735 states and 13111 transitions.
[2025-03-03 21:25:19,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-03 21:25:19,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:19,889 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:19,889 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 21:25:19,890 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:19,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:19,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -1394649015, now seen corresponding path program 1 times
[2025-03-03 21:25:19,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:19,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638218047]
[2025-03-03 21:25:19,890 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:19,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:19,904 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-03 21:25:19,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-03 21:25:19,928 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:19,928 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:20,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:20,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:20,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638218047]
[2025-03-03 21:25:20,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638218047] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:20,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:20,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 21:25:20,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366624465]
[2025-03-03 21:25:20,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:20,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 21:25:20,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:20,443 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 21:25:20,444 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-03 21:25:20,444 INFO  L87              Difference]: Start difference. First operand 8735 states and 13111 transitions. Second operand  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-03-03 21:25:21,303 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:21,303 INFO  L93              Difference]: Finished difference Result 17499 states and 26265 transitions.
[2025-03-03 21:25:21,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 21:25:21,304 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 228
[2025-03-03 21:25:21,304 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:21,338 INFO  L225             Difference]: With dead ends: 17499
[2025-03-03 21:25:21,338 INFO  L226             Difference]: Without dead ends: 8767
[2025-03-03 21:25:21,355 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2025-03-03 21:25:21,357 INFO  L435           NwaCegarLoop]: 172 mSDtfsCounter, 150 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:21,357 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 741 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 21:25:21,364 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8767 states.
[2025-03-03 21:25:21,760 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8767 to 8753.
[2025-03-03 21:25:21,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8753 states, 6829 states have (on average 1.3956655440035144) internal successors, (9531), 6829 states have internal predecessors, (9531), 1802 states have call successors, (1802), 121 states have call predecessors, (1802), 121 states have return successors, (1802), 1802 states have call predecessors, (1802), 1802 states have call successors, (1802)
[2025-03-03 21:25:21,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8753 states to 8753 states and 13135 transitions.
[2025-03-03 21:25:21,801 INFO  L78                 Accepts]: Start accepts. Automaton has 8753 states and 13135 transitions. Word has length 228
[2025-03-03 21:25:21,802 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:21,803 INFO  L471      AbstractCegarLoop]: Abstraction has 8753 states and 13135 transitions.
[2025-03-03 21:25:21,803 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-03-03 21:25:21,803 INFO  L276                IsEmpty]: Start isEmpty. Operand 8753 states and 13135 transitions.
[2025-03-03 21:25:21,805 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-03 21:25:21,805 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:21,805 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:21,806 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 21:25:21,806 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:21,806 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:21,806 INFO  L85        PathProgramCache]: Analyzing trace with hash -1803473240, now seen corresponding path program 1 times
[2025-03-03 21:25:21,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:21,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129356703]
[2025-03-03 21:25:21,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:21,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:21,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-03 21:25:21,869 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-03 21:25:21,869 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:21,869 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:22,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-03 21:25:22,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:22,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129356703]
[2025-03-03 21:25:22,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129356703] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 21:25:22,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450991891]
[2025-03-03 21:25:22,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:22,075 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:25:22,075 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:25:22,077 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 21:25:22,080 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 21:25:22,145 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-03 21:25:22,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-03 21:25:22,213 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:22,213 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:22,217 INFO  L256         TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-03-03 21:25:22,224 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 21:25:22,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked.
[2025-03-03 21:25:22,644 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 21:25:22,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-03 21:25:22,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [450991891] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 21:25:22,951 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 21:25:22,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14
[2025-03-03 21:25:22,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701129124]
[2025-03-03 21:25:22,951 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 21:25:22,952 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 21:25:22,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:22,952 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 21:25:22,953 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182
[2025-03-03 21:25:22,953 INFO  L87              Difference]: Start difference. First operand 8753 states and 13135 transitions. Second operand  has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102)
[2025-03-03 21:25:24,281 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:24,281 INFO  L93              Difference]: Finished difference Result 19891 states and 29618 transitions.
[2025-03-03 21:25:24,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-03-03 21:25:24,282 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 228
[2025-03-03 21:25:24,282 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:24,333 INFO  L225             Difference]: With dead ends: 19891
[2025-03-03 21:25:24,333 INFO  L226             Difference]: Without dead ends: 11141
[2025-03-03 21:25:24,353 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702
[2025-03-03 21:25:24,354 INFO  L435           NwaCegarLoop]: 148 mSDtfsCounter, 838 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:24,354 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 733 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 21:25:24,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11141 states.
[2025-03-03 21:25:24,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11141 to 10887.
[2025-03-03 21:25:24,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10887 states, 8291 states have (on average 1.3566517910987819) internal successors, (11248), 8321 states have internal predecessors, (11248), 2432 states have call successors, (2432), 163 states have call predecessors, (2432), 163 states have return successors, (2432), 2402 states have call predecessors, (2432), 2432 states have call successors, (2432)
[2025-03-03 21:25:24,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 16112 transitions.
[2025-03-03 21:25:24,962 INFO  L78                 Accepts]: Start accepts. Automaton has 10887 states and 16112 transitions. Word has length 228
[2025-03-03 21:25:24,963 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:24,963 INFO  L471      AbstractCegarLoop]: Abstraction has 10887 states and 16112 transitions.
[2025-03-03 21:25:24,963 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102)
[2025-03-03 21:25:24,964 INFO  L276                IsEmpty]: Start isEmpty. Operand 10887 states and 16112 transitions.
[2025-03-03 21:25:24,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-03-03 21:25:24,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:24,966 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:24,974 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-03 21:25:25,171 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:25:25,171 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:25,172 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:25,172 INFO  L85        PathProgramCache]: Analyzing trace with hash 1654468443, now seen corresponding path program 1 times
[2025-03-03 21:25:25,172 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:25,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481748539]
[2025-03-03 21:25:25,172 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:25,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:25,183 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-03-03 21:25:25,232 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-03-03 21:25:25,233 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:25,233 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:26,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-03 21:25:26,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:26,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481748539]
[2025-03-03 21:25:26,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481748539] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 21:25:26,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249729447]
[2025-03-03 21:25:26,400 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:26,400 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:25:26,400 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:25:26,402 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-03 21:25:26,404 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-03 21:25:26,467 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-03-03 21:25:26,523 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-03-03 21:25:26,523 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:26,523 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:26,526 INFO  L256         TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-03-03 21:25:26,529 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 21:25:27,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 1277 proven. 177 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked.
[2025-03-03 21:25:27,639 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 21:25:28,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-03 21:25:28,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [249729447] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 21:25:28,041 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 21:25:28,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 7] total 24
[2025-03-03 21:25:28,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126710406]
[2025-03-03 21:25:28,042 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 21:25:28,043 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-03-03 21:25:28,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:28,044 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-03-03 21:25:28,044 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552
[2025-03-03 21:25:28,044 INFO  L87              Difference]: Start difference. First operand 10887 states and 16112 transitions. Second operand  has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 7 states have call successors, (81), 5 states have call predecessors, (81), 9 states have return successors, (82), 7 states have call predecessors, (82), 7 states have call successors, (82)
[2025-03-03 21:25:31,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:31,374 INFO  L93              Difference]: Finished difference Result 29854 states and 42534 transitions.
[2025-03-03 21:25:31,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. 
[2025-03-03 21:25:31,375 INFO  L78                 Accepts]: Start accepts. Automaton has  has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 7 states have call successors, (81), 5 states have call predecessors, (81), 9 states have return successors, (82), 7 states have call predecessors, (82), 7 states have call successors, (82) Word has length 229
[2025-03-03 21:25:31,375 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:31,452 INFO  L225             Difference]: With dead ends: 29854
[2025-03-03 21:25:31,452 INFO  L226             Difference]: Without dead ends: 22574
[2025-03-03 21:25:31,474 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1380, Invalid=4472, Unknown=0, NotChecked=0, Total=5852
[2025-03-03 21:25:31,475 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 2029 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:31,475 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 1276 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 21:25:31,488 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22574 states.
[2025-03-03 21:25:32,553 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 13202.
[2025-03-03 21:25:32,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13202 states, 10550 states have (on average 1.3222748815165877) internal successors, (13950), 10627 states have internal predecessors, (13950), 2265 states have call successors, (2265), 386 states have call predecessors, (2265), 386 states have return successors, (2265), 2188 states have call predecessors, (2265), 2265 states have call successors, (2265)
[2025-03-03 21:25:32,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13202 states to 13202 states and 18480 transitions.
[2025-03-03 21:25:32,603 INFO  L78                 Accepts]: Start accepts. Automaton has 13202 states and 18480 transitions. Word has length 229
[2025-03-03 21:25:32,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:32,604 INFO  L471      AbstractCegarLoop]: Abstraction has 13202 states and 18480 transitions.
[2025-03-03 21:25:32,604 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 7 states have call successors, (81), 5 states have call predecessors, (81), 9 states have return successors, (82), 7 states have call predecessors, (82), 7 states have call successors, (82)
[2025-03-03 21:25:32,604 INFO  L276                IsEmpty]: Start isEmpty. Operand 13202 states and 18480 transitions.
[2025-03-03 21:25:32,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-03-03 21:25:32,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:32,607 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:32,614 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-03 21:25:32,807 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-03-03 21:25:32,808 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:32,808 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:32,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 1721578104, now seen corresponding path program 1 times
[2025-03-03 21:25:32,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:32,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169803351]
[2025-03-03 21:25:32,809 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:32,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:32,818 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-03-03 21:25:32,835 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-03 21:25:32,835 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:32,835 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:32,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:32,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:32,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169803351]
[2025-03-03 21:25:32,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169803351] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:32,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:32,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 21:25:32,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052084083]
[2025-03-03 21:25:32,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:32,989 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 21:25:32,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:32,989 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 21:25:32,990 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 21:25:32,990 INFO  L87              Difference]: Start difference. First operand 13202 states and 18480 transitions. Second operand  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-03 21:25:34,240 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:34,240 INFO  L93              Difference]: Finished difference Result 26898 states and 37644 transitions.
[2025-03-03 21:25:34,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 21:25:34,240 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 230
[2025-03-03 21:25:34,241 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:34,290 INFO  L225             Difference]: With dead ends: 26898
[2025-03-03 21:25:34,291 INFO  L226             Difference]: Without dead ends: 14726
[2025-03-03 21:25:34,310 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 21:25:34,310 INFO  L435           NwaCegarLoop]: 150 mSDtfsCounter, 504 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:34,310 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 577 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 21:25:34,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14726 states.
[2025-03-03 21:25:35,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14726 to 13647.
[2025-03-03 21:25:35,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13647 states, 10946 states have (on average 1.3225835921797917) internal successors, (14477), 11030 states have internal predecessors, (14477), 2307 states have call successors, (2307), 393 states have call predecessors, (2307), 393 states have return successors, (2307), 2223 states have call predecessors, (2307), 2307 states have call successors, (2307)
[2025-03-03 21:25:35,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13647 states to 13647 states and 19091 transitions.
[2025-03-03 21:25:35,759 INFO  L78                 Accepts]: Start accepts. Automaton has 13647 states and 19091 transitions. Word has length 230
[2025-03-03 21:25:35,760 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:35,760 INFO  L471      AbstractCegarLoop]: Abstraction has 13647 states and 19091 transitions.
[2025-03-03 21:25:35,760 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-03 21:25:35,760 INFO  L276                IsEmpty]: Start isEmpty. Operand 13647 states and 19091 transitions.
[2025-03-03 21:25:35,763 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-03-03 21:25:35,763 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:35,763 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:35,763 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 21:25:35,763 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:35,764 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:35,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -83654911, now seen corresponding path program 1 times
[2025-03-03 21:25:35,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:35,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129819527]
[2025-03-03 21:25:35,764 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:35,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:35,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-03-03 21:25:35,833 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-03 21:25:35,833 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:35,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:36,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 87 proven. 192 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked.
[2025-03-03 21:25:36,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:36,653 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129819527]
[2025-03-03 21:25:36,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129819527] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 21:25:36,653 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608653832]
[2025-03-03 21:25:36,653 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:36,653 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:25:36,653 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:25:36,655 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 21:25:36,656 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 21:25:36,720 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-03-03 21:25:36,786 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-03 21:25:36,787 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:36,787 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:36,794 INFO  L256         TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-03-03 21:25:36,797 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 21:25:37,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 1187 proven. 282 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked.
[2025-03-03 21:25:37,877 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 21:25:38,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 87 proven. 201 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked.
[2025-03-03 21:25:38,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [608653832] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 21:25:38,757 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 21:25:38,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 12] total 29
[2025-03-03 21:25:38,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735070955]
[2025-03-03 21:25:38,757 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 21:25:38,758 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2025-03-03 21:25:38,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:38,758 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-03-03 21:25:38,759 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812
[2025-03-03 21:25:38,759 INFO  L87              Difference]: Start difference. First operand 13647 states and 19091 transitions. Second operand  has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91)
[2025-03-03 21:25:40,359 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:40,360 INFO  L93              Difference]: Finished difference Result 22937 states and 31886 transitions.
[2025-03-03 21:25:40,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2025-03-03 21:25:40,360 INFO  L78                 Accepts]: Start accepts. Automaton has  has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91) Word has length 230
[2025-03-03 21:25:40,361 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:40,396 INFO  L225             Difference]: With dead ends: 22937
[2025-03-03 21:25:40,396 INFO  L226             Difference]: Without dead ends: 9293
[2025-03-03 21:25:40,419 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=769, Invalid=1781, Unknown=0, NotChecked=0, Total=2550
[2025-03-03 21:25:40,419 INFO  L435           NwaCegarLoop]: 168 mSDtfsCounter, 877 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:40,420 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 879 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 21:25:40,425 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9293 states.
[2025-03-03 21:25:41,104 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9293 to 8020.
[2025-03-03 21:25:41,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8020 states, 6531 states have (on average 1.3327208696983617) internal successors, (8704), 6576 states have internal predecessors, (8704), 1213 states have call successors, (1213), 275 states have call predecessors, (1213), 275 states have return successors, (1213), 1168 states have call predecessors, (1213), 1213 states have call successors, (1213)
[2025-03-03 21:25:41,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8020 states to 8020 states and 11130 transitions.
[2025-03-03 21:25:41,137 INFO  L78                 Accepts]: Start accepts. Automaton has 8020 states and 11130 transitions. Word has length 230
[2025-03-03 21:25:41,138 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:41,138 INFO  L471      AbstractCegarLoop]: Abstraction has 8020 states and 11130 transitions.
[2025-03-03 21:25:41,138 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91)
[2025-03-03 21:25:41,138 INFO  L276                IsEmpty]: Start isEmpty. Operand 8020 states and 11130 transitions.
[2025-03-03 21:25:41,140 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-03 21:25:41,140 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:41,140 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:41,147 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-03 21:25:41,340 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-03-03 21:25:41,341 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:41,342 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:41,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1130856321, now seen corresponding path program 1 times
[2025-03-03 21:25:41,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:41,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267503528]
[2025-03-03 21:25:41,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:41,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:41,352 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-03 21:25:41,372 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-03 21:25:41,372 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:41,372 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:41,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:41,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:41,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267503528]
[2025-03-03 21:25:41,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267503528] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:41,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:41,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 21:25:41,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516170780]
[2025-03-03 21:25:41,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:41,740 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 21:25:41,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:41,740 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 21:25:41,741 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-03-03 21:25:41,741 INFO  L87              Difference]: Start difference. First operand 8020 states and 11130 transitions. Second operand  has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:43,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:43,495 INFO  L93              Difference]: Finished difference Result 20139 states and 27811 transitions.
[2025-03-03 21:25:43,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-03 21:25:43,496 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 231
[2025-03-03 21:25:43,496 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:43,541 INFO  L225             Difference]: With dead ends: 20139
[2025-03-03 21:25:43,541 INFO  L226             Difference]: Without dead ends: 13871
[2025-03-03 21:25:43,551 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380
[2025-03-03 21:25:43,551 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 916 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:43,552 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 965 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 21:25:43,559 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13871 states.
[2025-03-03 21:25:44,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 10924.
[2025-03-03 21:25:44,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10924 states, 8781 states have (on average 1.3274114565539232) internal successors, (11656), 8832 states have internal predecessors, (11656), 1747 states have call successors, (1747), 395 states have call predecessors, (1747), 395 states have return successors, (1747), 1696 states have call predecessors, (1747), 1747 states have call successors, (1747)
[2025-03-03 21:25:44,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10924 states to 10924 states and 15150 transitions.
[2025-03-03 21:25:44,822 INFO  L78                 Accepts]: Start accepts. Automaton has 10924 states and 15150 transitions. Word has length 231
[2025-03-03 21:25:44,822 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:44,822 INFO  L471      AbstractCegarLoop]: Abstraction has 10924 states and 15150 transitions.
[2025-03-03 21:25:44,822 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:44,822 INFO  L276                IsEmpty]: Start isEmpty. Operand 10924 states and 15150 transitions.
[2025-03-03 21:25:44,824 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-03 21:25:44,824 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:44,824 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:44,824 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 21:25:44,824 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:44,825 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:44,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 1791235437, now seen corresponding path program 1 times
[2025-03-03 21:25:44,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:44,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945933673]
[2025-03-03 21:25:44,825 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:44,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:44,836 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-03 21:25:44,854 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-03 21:25:44,854 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:44,854 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:45,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:45,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:45,262 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945933673]
[2025-03-03 21:25:45,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945933673] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:45,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:45,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 21:25:45,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630830507]
[2025-03-03 21:25:45,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:45,263 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 21:25:45,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:45,264 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 21:25:45,264 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-03-03 21:25:45,264 INFO  L87              Difference]: Start difference. First operand 10924 states and 15150 transitions. Second operand  has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-03 21:25:46,873 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:46,874 INFO  L93              Difference]: Finished difference Result 22789 states and 31525 transitions.
[2025-03-03 21:25:46,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 21:25:46,874 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 231
[2025-03-03 21:25:46,875 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:46,947 INFO  L225             Difference]: With dead ends: 22789
[2025-03-03 21:25:46,947 INFO  L226             Difference]: Without dead ends: 11868
[2025-03-03 21:25:46,969 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132
[2025-03-03 21:25:46,970 INFO  L435           NwaCegarLoop]: 161 mSDtfsCounter, 432 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:46,970 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 693 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 21:25:46,987 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11868 states.
[2025-03-03 21:25:48,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 11810.
[2025-03-03 21:25:48,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11810 states, 9624 states have (on average 1.325436408977556) internal successors, (12756), 9687 states have internal predecessors, (12756), 1771 states have call successors, (1771), 414 states have call predecessors, (1771), 414 states have return successors, (1771), 1708 states have call predecessors, (1771), 1771 states have call successors, (1771)
[2025-03-03 21:25:48,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 16298 transitions.
[2025-03-03 21:25:48,401 INFO  L78                 Accepts]: Start accepts. Automaton has 11810 states and 16298 transitions. Word has length 231
[2025-03-03 21:25:48,401 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:48,402 INFO  L471      AbstractCegarLoop]: Abstraction has 11810 states and 16298 transitions.
[2025-03-03 21:25:48,402 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-03 21:25:48,402 INFO  L276                IsEmpty]: Start isEmpty. Operand 11810 states and 16298 transitions.
[2025-03-03 21:25:48,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-03 21:25:48,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:48,404 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:48,404 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 21:25:48,404 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:48,404 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:48,405 INFO  L85        PathProgramCache]: Analyzing trace with hash -1537625582, now seen corresponding path program 1 times
[2025-03-03 21:25:48,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:48,405 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758943663]
[2025-03-03 21:25:48,405 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:48,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:48,415 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-03 21:25:48,436 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-03 21:25:48,436 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:48,436 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:48,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:48,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:48,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758943663]
[2025-03-03 21:25:48,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758943663] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:48,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:48,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 21:25:48,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093085291]
[2025-03-03 21:25:48,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:48,631 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 21:25:48,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:48,631 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 21:25:48,631 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 21:25:48,631 INFO  L87              Difference]: Start difference. First operand 11810 states and 16298 transitions. Second operand  has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:51,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:51,173 INFO  L93              Difference]: Finished difference Result 33622 states and 46473 transitions.
[2025-03-03 21:25:51,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 21:25:51,173 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 231
[2025-03-03 21:25:51,174 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:51,252 INFO  L225             Difference]: With dead ends: 33622
[2025-03-03 21:25:51,252 INFO  L226             Difference]: Without dead ends: 21815
[2025-03-03 21:25:51,268 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2025-03-03 21:25:51,272 INFO  L435           NwaCegarLoop]: 150 mSDtfsCounter, 303 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:51,272 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 671 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 21:25:51,288 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21815 states.
[2025-03-03 21:25:53,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21815 to 21795.
[2025-03-03 21:25:53,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21795 states, 17702 states have (on average 1.3241441645011862) internal successors, (23440), 17818 states have internal predecessors, (23440), 3317 states have call successors, (3317), 775 states have call predecessors, (3317), 775 states have return successors, (3317), 3201 states have call predecessors, (3317), 3317 states have call successors, (3317)
[2025-03-03 21:25:53,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21795 states to 21795 states and 30074 transitions.
[2025-03-03 21:25:53,527 INFO  L78                 Accepts]: Start accepts. Automaton has 21795 states and 30074 transitions. Word has length 231
[2025-03-03 21:25:53,527 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:53,527 INFO  L471      AbstractCegarLoop]: Abstraction has 21795 states and 30074 transitions.
[2025-03-03 21:25:53,527 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:53,527 INFO  L276                IsEmpty]: Start isEmpty. Operand 21795 states and 30074 transitions.
[2025-03-03 21:25:53,529 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-03-03 21:25:53,529 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:53,529 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:53,529 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 21:25:53,530 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:53,530 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:53,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -654552696, now seen corresponding path program 1 times
[2025-03-03 21:25:53,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:53,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80908615]
[2025-03-03 21:25:53,530 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:53,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:53,542 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-03-03 21:25:53,565 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-03-03 21:25:53,565 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:53,566 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:53,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:53,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:53,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80908615]
[2025-03-03 21:25:53,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80908615] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:53,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:53,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 21:25:53,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682016492]
[2025-03-03 21:25:53,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:53,696 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 21:25:53,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:53,697 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 21:25:53,697 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:53,697 INFO  L87              Difference]: Start difference. First operand 21795 states and 30074 transitions. Second operand  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:55,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:25:55,985 INFO  L93              Difference]: Finished difference Result 43587 states and 60145 transitions.
[2025-03-03 21:25:55,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 21:25:55,985 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 232
[2025-03-03 21:25:55,985 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:25:56,060 INFO  L225             Difference]: With dead ends: 43587
[2025-03-03 21:25:56,060 INFO  L226             Difference]: Without dead ends: 21795
[2025-03-03 21:25:56,094 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 21:25:56,094 INFO  L435           NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 21:25:56,094 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 21:25:56,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21795 states.
[2025-03-03 21:25:58,066 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21795 to 21795.
[2025-03-03 21:25:58,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21795 states, 17702 states have (on average 1.307818325612925) internal successors, (23151), 17818 states have internal predecessors, (23151), 3317 states have call successors, (3317), 775 states have call predecessors, (3317), 775 states have return successors, (3317), 3201 states have call predecessors, (3317), 3317 states have call successors, (3317)
[2025-03-03 21:25:58,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21795 states to 21795 states and 29785 transitions.
[2025-03-03 21:25:58,158 INFO  L78                 Accepts]: Start accepts. Automaton has 21795 states and 29785 transitions. Word has length 232
[2025-03-03 21:25:58,158 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:25:58,158 INFO  L471      AbstractCegarLoop]: Abstraction has 21795 states and 29785 transitions.
[2025-03-03 21:25:58,158 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:25:58,158 INFO  L276                IsEmpty]: Start isEmpty. Operand 21795 states and 29785 transitions.
[2025-03-03 21:25:58,160 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-03-03 21:25:58,161 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:25:58,161 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:25:58,161 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 21:25:58,161 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:25:58,161 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:25:58,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 173343080, now seen corresponding path program 1 times
[2025-03-03 21:25:58,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:25:58,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854590819]
[2025-03-03 21:25:58,161 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:58,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:25:58,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-03 21:25:58,228 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-03 21:25:58,228 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:58,228 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-03 21:25:58,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581246378]
[2025-03-03 21:25:58,233 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:25:58,233 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:25:58,234 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:25:58,237 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 21:25:58,239 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 21:25:58,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-03 21:25:58,392 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-03 21:25:58,392 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:25:58,393 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 21:25:58,395 INFO  L256         TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-03 21:25:58,406 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 21:25:59,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 21:25:59,212 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 21:25:59,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 21:25:59,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854590819]
[2025-03-03 21:25:59,215 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-03-03 21:25:59,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581246378]
[2025-03-03 21:25:59,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581246378] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 21:25:59,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 21:25:59,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 21:25:59,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966815350]
[2025-03-03 21:25:59,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 21:25:59,216 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 21:25:59,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 21:25:59,216 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 21:25:59,216 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 21:25:59,216 INFO  L87              Difference]: Start difference. First operand 21795 states and 29785 transitions. Second operand  has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:26:02,353 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 21:26:02,353 INFO  L93              Difference]: Finished difference Result 45992 states and 62666 transitions.
[2025-03-03 21:26:02,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 21:26:02,354 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 233
[2025-03-03 21:26:02,354 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 21:26:02,436 INFO  L225             Difference]: With dead ends: 45992
[2025-03-03 21:26:02,436 INFO  L226             Difference]: Without dead ends: 24200
[2025-03-03 21:26:02,476 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-03-03 21:26:02,488 INFO  L435           NwaCegarLoop]: 248 mSDtfsCounter, 393 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 21:26:02,488 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 806 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 21:26:02,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24200 states.
[2025-03-03 21:26:04,473 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24200 to 23648.
[2025-03-03 21:26:04,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23648 states, 19271 states have (on average 1.3042914223444555) internal successors, (25135), 19400 states have internal predecessors, (25135), 3553 states have call successors, (3553), 823 states have call predecessors, (3553), 823 states have return successors, (3553), 3424 states have call predecessors, (3553), 3553 states have call successors, (3553)
[2025-03-03 21:26:04,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23648 states to 23648 states and 32241 transitions.
[2025-03-03 21:26:04,562 INFO  L78                 Accepts]: Start accepts. Automaton has 23648 states and 32241 transitions. Word has length 233
[2025-03-03 21:26:04,562 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 21:26:04,562 INFO  L471      AbstractCegarLoop]: Abstraction has 23648 states and 32241 transitions.
[2025-03-03 21:26:04,563 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 21:26:04,563 INFO  L276                IsEmpty]: Start isEmpty. Operand 23648 states and 32241 transitions.
[2025-03-03 21:26:04,565 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-03-03 21:26:04,565 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 21:26:04,565 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:26:04,572 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-03 21:26:04,765 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:26:04,765 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 21:26:04,766 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 21:26:04,766 INFO  L85        PathProgramCache]: Analyzing trace with hash 1134957097, now seen corresponding path program 1 times
[2025-03-03 21:26:04,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 21:26:04,766 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404549007]
[2025-03-03 21:26:04,766 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:26:04,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 21:26:04,775 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-03 21:26:04,809 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-03 21:26:04,810 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:26:04,810 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-03 21:26:04,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639561367]
[2025-03-03 21:26:04,811 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 21:26:04,811 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:26:04,812 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:26:04,814 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 21:26:04,815 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 21:26:04,887 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-03 21:26:04,935 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-03 21:26:04,935 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:26:04,935 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 21:26:04,936 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-03 21:26:04,956 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-03 21:26:04,981 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-03 21:26:04,981 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 21:26:04,981 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 21:26:05,074 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-03 21:26:05,075 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-03 21:26:05,076 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 21:26:05,094 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-03-03 21:26:05,284 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 21:26:05,293 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 21:26:05,473 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 21:26:05,480 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:26:05 BoogieIcfgContainer
[2025-03-03 21:26:05,481 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 21:26:05,481 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 21:26:05,481 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 21:26:05,486 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 21:26:05,487 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:06" (3/4) ...
[2025-03-03 21:26:05,489 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-03 21:26:05,494 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 21:26:05,495 INFO  L158              Benchmark]: Toolchain (without parser) took 59824.40ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 111.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB.
[2025-03-03 21:26:05,495 INFO  L158              Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 21:26:05,499 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 258.08ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 95.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 21:26:05,499 INFO  L158              Benchmark]: Boogie Procedure Inliner took 54.00ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 90.8MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 21:26:05,499 INFO  L158              Benchmark]: Boogie Preprocessor took 62.29ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 85.6MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 21:26:05,499 INFO  L158              Benchmark]: IcfgBuilder took 550.27ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 50.7MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-03 21:26:05,499 INFO  L158              Benchmark]: TraceAbstraction took 58880.35ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 50.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB.
[2025-03-03 21:26:05,500 INFO  L158              Benchmark]: Witness Printer took 13.10ms. Allocated memory is still 3.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 739.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 21:26:05,501 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 258.08ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 95.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 54.00ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 90.8MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 62.29ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 85.6MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 550.27ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 50.7MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 58880.35ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 50.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB.
 * Witness Printer took 13.10ms. Allocated memory is still 3.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 739.0kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseOr at line 122, overapproximation of bitwiseAnd at line 103, overapproximation of bitwiseAnd at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 198. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    signed char var_1_1 = -64;
[L23]                    unsigned char var_1_3 = 1;
[L24]                    signed char var_1_5 = -32;
[L25]                    unsigned short int var_1_6 = 256;
[L26]                    unsigned long int var_1_10 = 256;
[L27]                    double var_1_12 = 8.2;
[L28]                    signed char var_1_13 = 16;
[L29]                    signed char var_1_14 = 10;
[L30]                    double var_1_15 = 199.125;
[L31]                    double var_1_16 = 9.4;
[L32]                    double var_1_17 = 9999999999999.6;
[L33]                    unsigned char var_1_20 = 32;
[L34]                    unsigned char var_1_21 = 128;
[L35]                    unsigned char var_1_22 = 64;
[L36]                    unsigned long int var_1_23 = 64;
[L37]                    unsigned long int var_1_24 = 5;
[L38]                    signed short int var_1_28 = 256;
[L39]                    signed long int var_1_30 = -4;
[L40]                    signed short int var_1_31 = 64;
[L41]                    double var_1_32 = 0.0;
[L42]                    double var_1_33 = 3.85;
[L43]                    unsigned short int var_1_34 = 34858;
[L44]                    unsigned short int var_1_35 = 41225;
[L45]                    double var_1_37 = 63.63;
[L46]                    double var_1_38 = 64.6;
[L47]                    signed char var_1_39 = 10;
[L48]                    signed char var_1_40 = -25;
[L49]                    signed char var_1_41 = 4;
[L50]                    unsigned char var_1_42 = 50;
[L51]                    unsigned char var_1_44 = 10;
[L52]                    unsigned char var_1_45 = 16;
[L53]                    unsigned char var_1_47 = 0;
[L54]                    unsigned long int last_1_var_1_10 = 256;
[L55]                    unsigned char last_1_var_1_20 = 32;
             VAL         [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256]
[L202]                   isInitial = 1
[L203]       FCALL       initially()
[L204]       COND TRUE   1
[L205]       CALL        updateLastVariables()
[L194]                   last_1_var_1_10 = var_1_10
[L195]                   last_1_var_1_20 = var_1_20
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256]
[L205]       RET         updateLastVariables()
[L206]       CALL        updateVariables()
[L140]                   var_1_3 = __VERIFIER_nondet_uchar()
[L141]       CALL        assume_abort_if_not(var_1_3 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256]
[L141]       RET         assume_abort_if_not(var_1_3 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256]
[L142]       CALL        assume_abort_if_not(var_1_3 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256]
[L142]       RET         assume_abort_if_not(var_1_3 <= 1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256]
[L143]                   var_1_5 = __VERIFIER_nondet_char()
[L144]       CALL        assume_abort_if_not(var_1_5 >= -127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L144]       RET         assume_abort_if_not(var_1_5 >= -127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L145]       CALL        assume_abort_if_not(var_1_5 <= 126)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L145]       RET         assume_abort_if_not(var_1_5 <= 126)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L146]                   var_1_13 = __VERIFIER_nondet_char()
[L147]       CALL        assume_abort_if_not(var_1_13 >= -1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L147]       RET         assume_abort_if_not(var_1_13 >= -1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L148]       CALL        assume_abort_if_not(var_1_13 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L148]       RET         assume_abort_if_not(var_1_13 <= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L149]                   var_1_14 = __VERIFIER_nondet_char()
[L150]       CALL        assume_abort_if_not(var_1_14 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L150]       RET         assume_abort_if_not(var_1_14 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L151]       CALL        assume_abort_if_not(var_1_14 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L151]       RET         assume_abort_if_not(var_1_14 <= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L152]                   var_1_15 = __VERIFIER_nondet_double()
[L153]       CALL        assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L153]       RET         assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L154]       CALL        assume_abort_if_not(var_1_15 != 0.0F)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L154]       RET         assume_abort_if_not(var_1_15 != 0.0F)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L155]                   var_1_16 = __VERIFIER_nondet_double()
[L156]       CALL        assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L156]       RET         assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L157]                   var_1_21 = __VERIFIER_nondet_uchar()
[L158]       CALL        assume_abort_if_not(var_1_21 >= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L158]       RET         assume_abort_if_not(var_1_21 >= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L159]       CALL        assume_abort_if_not(var_1_21 <= 254)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L159]       RET         assume_abort_if_not(var_1_21 <= 254)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L160]                   var_1_22 = __VERIFIER_nondet_uchar()
[L161]       CALL        assume_abort_if_not(var_1_22 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L161]       RET         assume_abort_if_not(var_1_22 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L162]       CALL        assume_abort_if_not(var_1_22 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L162]       RET         assume_abort_if_not(var_1_22 <= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L163]                   var_1_31 = __VERIFIER_nondet_short()
[L164]       CALL        assume_abort_if_not(var_1_31 >= -32768)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L164]       RET         assume_abort_if_not(var_1_31 >= -32768)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L165]       CALL        assume_abort_if_not(var_1_31 <= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L165]       RET         assume_abort_if_not(var_1_31 <= 32767)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L166]       CALL        assume_abort_if_not(var_1_31 != 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L166]       RET         assume_abort_if_not(var_1_31 != 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L167]                   var_1_33 = __VERIFIER_nondet_double()
[L168]       CALL        assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L168]       RET         assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L169]                   var_1_34 = __VERIFIER_nondet_ushort()
[L170]       CALL        assume_abort_if_not(var_1_34 >= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L170]       RET         assume_abort_if_not(var_1_34 >= 32767)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L171]       CALL        assume_abort_if_not(var_1_34 <= 65535)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L171]       RET         assume_abort_if_not(var_1_34 <= 65535)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L172]                   var_1_35 = __VERIFIER_nondet_ushort()
[L173]       CALL        assume_abort_if_not(var_1_35 >= 32767)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L173]       RET         assume_abort_if_not(var_1_35 >= 32767)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L174]       CALL        assume_abort_if_not(var_1_35 <= 65535)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L174]       RET         assume_abort_if_not(var_1_35 <= 65535)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L175]                   var_1_38 = __VERIFIER_nondet_double()
[L176]       CALL        assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L176]       RET         assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F ))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L177]                   var_1_40 = __VERIFIER_nondet_char()
[L178]       CALL        assume_abort_if_not(var_1_40 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L178]       RET         assume_abort_if_not(var_1_40 >= -63)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L179]       CALL        assume_abort_if_not(var_1_40 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L179]       RET         assume_abort_if_not(var_1_40 <= 63)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L180]                   var_1_41 = __VERIFIER_nondet_char()
[L181]       CALL        assume_abort_if_not(var_1_41 >= -63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L181]       RET         assume_abort_if_not(var_1_41 >= -63)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L182]       CALL        assume_abort_if_not(var_1_41 <= 63)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L182]       RET         assume_abort_if_not(var_1_41 <= 63)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L183]                   var_1_44 = __VERIFIER_nondet_uchar()
[L184]       CALL        assume_abort_if_not(var_1_44 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L184]       RET         assume_abort_if_not(var_1_44 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L185]       CALL        assume_abort_if_not(var_1_44 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L185]       RET         assume_abort_if_not(var_1_44 <= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256]
[L186]                   var_1_45 = __VERIFIER_nondet_uchar()
[L187]       CALL        assume_abort_if_not(var_1_45 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L187]       RET         assume_abort_if_not(var_1_45 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L188]       CALL        assume_abort_if_not(var_1_45 <= 127)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L188]       RET         assume_abort_if_not(var_1_45 <= 127)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L189]                   var_1_47 = __VERIFIER_nondet_uchar()
[L190]       CALL        assume_abort_if_not(var_1_47 >= 0)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_5=32, var_1_6=256]
[L190]       RET         assume_abort_if_not(var_1_47 >= 0)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_5=32, var_1_6=256]
[L191]       CALL        assume_abort_if_not(var_1_47 <= 1)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L191]       RET         assume_abort_if_not(var_1_47 <= 1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L206]       RET         updateVariables()
[L207]       CALL        step()
[L59]        COND FALSE  !(\read(var_1_3))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L64]        COND FALSE  !(var_1_10 > var_1_31)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L77]                    signed long int stepLocal_2 = var_1_5 * var_1_13;
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=0, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L78]        COND FALSE  !(stepLocal_2 > last_1_var_1_10)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L81]                    var_1_28 = var_1_20
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L82]        COND FALSE  !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L87]        COND TRUE   var_1_6 >= ((((var_1_23) > (var_1_23)) ? (var_1_23) : (var_1_23)))
[L88]                    var_1_24 = ((((((((var_1_23) > (var_1_6)) ? (var_1_23) : (var_1_6)))) < (var_1_23)) ? (((((var_1_23) > (var_1_6)) ? (var_1_23) : (var_1_6)))) : (var_1_23)))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L92]                    unsigned char stepLocal_1 = var_1_17 <= var_1_17;
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L93]        COND FALSE  !(stepLocal_1 || var_1_3)
[L98]                    var_1_12 = var_1_16
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L100]       EXPR        var_1_23 ^ var_1_20
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L100]       COND FALSE  !(((var_1_23 ^ var_1_20) % var_1_31) > -10)
[L103]       EXPR        var_1_35 & var_1_6
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L103]       EXPR        (var_1_35 & var_1_6) >> var_1_20
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L103]       COND TRUE   var_1_23 >= ((var_1_35 & var_1_6) >> var_1_20)
[L104]                   var_1_37 = ((((var_1_33) < (var_1_38)) ? (var_1_33) : (var_1_38)))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L106]       COND FALSE  !(99999.8f < var_1_17)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L117]       COND FALSE  !((var_1_17 + var_1_12) <= var_1_17)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L122]       EXPR        var_1_6 ^ var_1_20
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L122]                   unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23;
[L123]       COND TRUE   var_1_20 <= stepLocal_0
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L124]       COND TRUE   var_1_12 == var_1_12
[L125]                   var_1_10 = 0u
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L128]       EXPR        ((((var_1_10) > (-16)) ? (var_1_10) : (-16))) & 16
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L128]       COND FALSE  !((~ var_1_20) <= (((((var_1_10) > (-16)) ? (var_1_10) : (-16))) & 16))
[L131]       COND TRUE   var_1_6 <= (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))
[L132]                   var_1_32 = var_1_33
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L137]                   var_1_39 = (var_1_40 + ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41))))
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L207]       RET         step()
[L208]       CALL, EXPR  property()
[L198]       EXPR        (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L198-L199]              return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1)
;
[L208]       RET, EXPR   property()
[L208]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]
[L19]                    reach_error()
             VAL         [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.7s, OverallIterations: 23, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9466 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9411 mSDsluCounter, 13816 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9472 mSDsCounter, 2246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8391 IncrementalHoareTripleChecker+Invalid, 10637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2246 mSolverCounterUnsat, 4344 mSDtfsCounter, 8391 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2566 GetRequests, 2313 SyntacticMatches, 2 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2748 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23648occurred in iteration=22, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 19892 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 6844 NumberOfCodeBlocks, 6844 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 7028 ConstructedInterpolants, 0 QuantifiedInterpolants, 34823 SizeOfPredicates, 21 NumberOfNonLiveVariables, 3040 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 31 InterpolantComputations, 18 PerfectInterpolantSequences, 68316/69564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-03 21:26:05,579 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_fillercodestructure_filler-pr-co_file-3.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 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 21:26:07,907 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 21:26:07,979 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-03 21:26:07,982 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 21:26:07,983 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 21:26:08,005 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 21:26:08,005 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 21:26:08,005 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 21:26:08,006 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 21:26:08,006 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 21:26:08,006 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 21:26:08,007 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 21:26:08,007 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 21:26:08,007 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 21:26:08,007 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 21:26:08,008 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-03 21:26:08,008 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-03 21:26:08,009 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 21:26:08,009 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 21:26:08,009 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 21:26:08,009 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 21:26:08,009 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 21:26:08,009 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 21:26:08,009 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 21:26:08,009 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 21:26:08,010 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 21:26:08,010 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 21:26:08,011 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 21:26:08,011 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 -> 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349
[2025-03-03 21:26:08,227 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 21:26:08,232 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 21:26:08,234 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 21:26:08,235 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 21:26:08,235 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 21:26:08,236 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i
[2025-03-03 21:26:09,362 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fdff8a6/b43bcb29139a4f2da5117349d3156d7d/FLAG3f75a0b1e
[2025-03-03 21:26:09,555 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 21:26:09,556 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i
[2025-03-03 21:26:09,563 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fdff8a6/b43bcb29139a4f2da5117349d3156d7d/FLAG3f75a0b1e
[2025-03-03 21:26:09,939 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fdff8a6/b43bcb29139a4f2da5117349d3156d7d
[2025-03-03 21:26:09,940 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 21:26:09,941 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 21:26:09,942 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 21:26:09,942 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 21:26:09,945 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 21:26:09,945 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:26:09" (1/1) ...
[2025-03-03 21:26:09,946 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5f6891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:09, skipping insertion in model container
[2025-03-03 21:26:09,946 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:26:09" (1/1) ...
[2025-03-03 21:26:09,962 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 21:26:10,062 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_fillercodestructure_filler-pr-co_file-3.i[918,931]
[2025-03-03 21:26:10,107 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 21:26:10,118 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 21:26:10,125 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_fillercodestructure_filler-pr-co_file-3.i[918,931]
[2025-03-03 21:26:10,160 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 21:26:10,175 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 21:26:10,175 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10 WrapperNode
[2025-03-03 21:26:10,175 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 21:26:10,176 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 21:26:10,176 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 21:26:10,176 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 21:26:10,180 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,188 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,207 INFO  L138                Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203
[2025-03-03 21:26:10,208 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 21:26:10,208 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 21:26:10,208 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 21:26:10,208 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 21:26:10,214 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,214 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,217 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,234 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 21:26:10,234 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,235 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,242 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,242 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,247 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,248 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,251 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 21:26:10,252 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 21:26:10,252 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 21:26:10,252 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 21:26:10,253 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:26:10" (1/1) ...
[2025-03-03 21:26:10,257 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 21:26:10,265 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 21:26:10,277 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 21:26:10,280 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 21:26:10,299 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 21:26:10,299 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-03 21:26:10,299 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 21:26:10,299 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 21:26:10,299 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 21:26:10,300 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 21:26:10,375 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 21:26:10,377 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation