./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label43.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 023d838f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/eca-rers2012/Problem02_label43.c -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 34dbb4950b3457cf98a513c0428fa3aea09e3e6919478fbbfbf6cf9bb32ef81c
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m
[2024-11-09 18:38:03,803 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-09 18:38:03,866 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-09 18:38:03,869 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-09 18:38:03,870 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-09 18:38:03,893 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-09 18:38:03,893 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-09 18:38:03,893 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-09 18:38:03,894 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-09 18:38:03,894 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-09 18:38:03,894 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-09 18:38:03,894 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-09 18:38:03,895 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-09 18:38:03,895 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-09 18:38:03,895 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-09 18:38:03,895 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-09 18:38:03,896 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-09 18:38:03,896 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-09 18:38:03,896 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-09 18:38:03,896 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-09 18:38:03,896 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-09 18:38:03,901 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-09 18:38:03,901 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-09 18:38:03,902 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-09 18:38:03,902 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-09 18:38:03,902 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-09 18:38:03,902 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-09 18:38:03,902 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-09 18:38:03,902 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-09 18:38:03,902 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-09 18:38:03,902 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-09 18:38:03,903 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-09 18:38:03,903 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-09 18:38:03,903 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-09 18:38:03,903 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-09 18:38:03,903 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-09 18:38:03,903 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-09 18:38:03,903 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-09 18:38:03,903 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-09 18:38:03,904 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-09 18:38:03,904 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-09 18:38:03,904 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-09 18:38:03,904 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> 34dbb4950b3457cf98a513c0428fa3aea09e3e6919478fbbfbf6cf9bb32ef81c
[2024-11-09 18:38:04,183 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-09 18:38:04,204 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-09 18:38:04,206 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-09 18:38:04,207 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-09 18:38:04,208 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-09 18:38:04,209 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label43.c
[2024-11-09 18:38:05,565 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-09 18:38:05,827 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-09 18:38:05,827 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label43.c
[2024-11-09 18:38:05,847 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7b784e0/089e83b29b024665bdfeb4234675831f/FLAG21e5a748a
[2024-11-09 18:38:05,861 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7b784e0/089e83b29b024665bdfeb4234675831f
[2024-11-09 18:38:05,864 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-09 18:38:05,865 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-09 18:38:05,867 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-09 18:38:05,867 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-09 18:38:05,873 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-09 18:38:05,873 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:38:05" (1/1) ...
[2024-11-09 18:38:05,874 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363c6615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:05, skipping insertion in model container
[2024-11-09 18:38:05,874 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:38:05" (1/1) ...
[2024-11-09 18:38:05,915 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-09 18:38:06,201 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/eca-rers2012/Problem02_label43.c[15084,15097]
[2024-11-09 18:38:06,245 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-09 18:38:06,259 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-09 18:38:06,306 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/eca-rers2012/Problem02_label43.c[15084,15097]
[2024-11-09 18:38:06,319 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-09 18:38:06,337 INFO  L204         MainTranslator]: Completed translation
[2024-11-09 18:38:06,338 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06 WrapperNode
[2024-11-09 18:38:06,338 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-09 18:38:06,339 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-09 18:38:06,340 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-09 18:38:06,340 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-09 18:38:06,347 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,368 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,402 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668
[2024-11-09 18:38:06,403 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-09 18:38:06,403 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-09 18:38:06,403 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-09 18:38:06,403 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-09 18:38:06,416 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,416 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,424 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,449 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].
[2024-11-09 18:38:06,452 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,452 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,469 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,473 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,482 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,488 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,496 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-09 18:38:06,498 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-11-09 18:38:06,498 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2024-11-09 18:38:06,498 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2024-11-09 18:38:06,499 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (1/1) ...
[2024-11-09 18:38:06,508 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-09 18:38:06,521 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-09 18:38:06,539 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)
[2024-11-09 18:38:06,542 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
[2024-11-09 18:38:06,583 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-09 18:38:06,584 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-09 18:38:06,584 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-09 18:38:06,585 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-09 18:38:06,706 INFO  L256             CfgBuilder]: Building ICFG
[2024-11-09 18:38:06,708 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-09 18:38:07,618 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2024-11-09 18:38:07,618 INFO  L307             CfgBuilder]: Performing block encoding
[2024-11-09 18:38:07,645 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-09 18:38:07,645 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-09 18:38:07,646 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:07 BoogieIcfgContainer
[2024-11-09 18:38:07,646 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-11-09 18:38:07,647 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-09 18:38:07,647 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-09 18:38:07,651 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-09 18:38:07,652 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:38:05" (1/3) ...
[2024-11-09 18:38:07,652 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171ae895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:38:07, skipping insertion in model container
[2024-11-09 18:38:07,652 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:38:06" (2/3) ...
[2024-11-09 18:38:07,654 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171ae895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:38:07, skipping insertion in model container
[2024-11-09 18:38:07,654 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:07" (3/3) ...
[2024-11-09 18:38:07,655 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label43.c
[2024-11-09 18:38:07,671 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-09 18:38:07,672 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-09 18:38:07,742 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-09 18:38:07,751 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;@1534516e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-09 18:38:07,752 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-09 18:38:07,757 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:07,766 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2024-11-09 18:38:07,766 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:38:07,767 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:38:07,768 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:38:07,773 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:38:07,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -180596635, now seen corresponding path program 1 times
[2024-11-09 18:38:07,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:38:07,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677402658]
[2024-11-09 18:38:07,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:38:07,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:38:07,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:38:08,227 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:38:08,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:38:08,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677402658]
[2024-11-09 18:38:08,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677402658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:38:08,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:38:08,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-09 18:38:08,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932522143]
[2024-11-09 18:38:08,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:38:08,240 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:38:08,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:38:08,278 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:38:08,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:38:08,282 INFO  L87              Difference]: Start difference. First operand  has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:09,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:38:09,045 INFO  L93              Difference]: Finished difference Result 636 states and 1076 transitions.
[2024-11-09 18:38:09,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:38:09,048 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87
[2024-11-09 18:38:09,048 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:38:09,059 INFO  L225             Difference]: With dead ends: 636
[2024-11-09 18:38:09,059 INFO  L226             Difference]: Without dead ends: 321
[2024-11-09 18:38:09,064 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:38:09,067 INFO  L432           NwaCegarLoop]: 98 mSDtfsCounter, 145 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-09 18:38:09,068 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 123 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-09 18:38:09,088 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2024-11-09 18:38:09,130 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321.
[2024-11-09 18:38:09,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 321 states, 320 states have (on average 1.46875) internal successors, (470), 320 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:09,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 470 transitions.
[2024-11-09 18:38:09,138 INFO  L78                 Accepts]: Start accepts. Automaton has 321 states and 470 transitions. Word has length 87
[2024-11-09 18:38:09,139 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:38:09,140 INFO  L471      AbstractCegarLoop]: Abstraction has 321 states and 470 transitions.
[2024-11-09 18:38:09,140 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:09,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 321 states and 470 transitions.
[2024-11-09 18:38:09,143 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2024-11-09 18:38:09,144 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:38:09,144 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:38:09,145 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-09 18:38:09,145 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:38:09,145 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:38:09,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 1742215457, now seen corresponding path program 1 times
[2024-11-09 18:38:09,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:38:09,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036188871]
[2024-11-09 18:38:09,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:38:09,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:38:09,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:38:09,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:38:09,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:38:09,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036188871]
[2024-11-09 18:38:09,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036188871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:38:09,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:38:09,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-09 18:38:09,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334625852]
[2024-11-09 18:38:09,373 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:38:09,375 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:38:09,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:38:09,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:38:09,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:38:09,377 INFO  L87              Difference]: Start difference. First operand 321 states and 470 transitions. Second operand  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:09,762 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:38:09,762 INFO  L93              Difference]: Finished difference Result 928 states and 1366 transitions.
[2024-11-09 18:38:09,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:38:09,763 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92
[2024-11-09 18:38:09,763 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:38:09,765 INFO  L225             Difference]: With dead ends: 928
[2024-11-09 18:38:09,766 INFO  L226             Difference]: Without dead ends: 609
[2024-11-09 18:38:09,767 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:38:09,767 INFO  L432           NwaCegarLoop]: 111 mSDtfsCounter, 144 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-09 18:38:09,768 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 131 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-09 18:38:09,769 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 609 states.
[2024-11-09 18:38:09,781 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607.
[2024-11-09 18:38:09,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 607 states, 606 states have (on average 1.2887788778877889) internal successors, (781), 606 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:09,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 781 transitions.
[2024-11-09 18:38:09,787 INFO  L78                 Accepts]: Start accepts. Automaton has 607 states and 781 transitions. Word has length 92
[2024-11-09 18:38:09,787 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:38:09,787 INFO  L471      AbstractCegarLoop]: Abstraction has 607 states and 781 transitions.
[2024-11-09 18:38:09,788 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:09,788 INFO  L276                IsEmpty]: Start isEmpty. Operand 607 states and 781 transitions.
[2024-11-09 18:38:09,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2024-11-09 18:38:09,793 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:38:09,793 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:38:09,793 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-09 18:38:09,793 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:38:09,793 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:38:09,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -48975205, now seen corresponding path program 1 times
[2024-11-09 18:38:09,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:38:09,794 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128540957]
[2024-11-09 18:38:09,794 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:38:09,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:38:09,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:38:09,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:38:09,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:38:09,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128540957]
[2024-11-09 18:38:09,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128540957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:38:09,946 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:38:09,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-09 18:38:09,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386898903]
[2024-11-09 18:38:09,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:38:09,946 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:38:09,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:38:09,947 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:38:09,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:38:09,947 INFO  L87              Difference]: Start difference. First operand 607 states and 781 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:10,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:38:10,348 INFO  L93              Difference]: Finished difference Result 1500 states and 1988 transitions.
[2024-11-09 18:38:10,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:38:10,351 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98
[2024-11-09 18:38:10,351 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:38:10,353 INFO  L225             Difference]: With dead ends: 1500
[2024-11-09 18:38:10,353 INFO  L226             Difference]: Without dead ends: 895
[2024-11-09 18:38:10,356 INFO  L431           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
[2024-11-09 18:38:10,357 INFO  L432           NwaCegarLoop]: 241 mSDtfsCounter, 144 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-09 18:38:10,361 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 260 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-09 18:38:10,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 895 states.
[2024-11-09 18:38:10,382 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 893.
[2024-11-09 18:38:10,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 893 states, 892 states have (on average 1.2298206278026906) internal successors, (1097), 892 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:10,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1097 transitions.
[2024-11-09 18:38:10,386 INFO  L78                 Accepts]: Start accepts. Automaton has 893 states and 1097 transitions. Word has length 98
[2024-11-09 18:38:10,386 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:38:10,387 INFO  L471      AbstractCegarLoop]: Abstraction has 893 states and 1097 transitions.
[2024-11-09 18:38:10,387 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:10,387 INFO  L276                IsEmpty]: Start isEmpty. Operand 893 states and 1097 transitions.
[2024-11-09 18:38:10,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-09 18:38:10,390 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:38:10,390 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:38:10,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-09 18:38:10,391 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:38:10,391 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:38:10,391 INFO  L85        PathProgramCache]: Analyzing trace with hash 619502161, now seen corresponding path program 1 times
[2024-11-09 18:38:10,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:38:10,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862286119]
[2024-11-09 18:38:10,392 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:38:10,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:38:10,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:38:10,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-09 18:38:10,509 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:38:10,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862286119]
[2024-11-09 18:38:10,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862286119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:38:10,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:38:10,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-09 18:38:10,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015618241]
[2024-11-09 18:38:10,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:38:10,510 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:38:10,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:38:10,512 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:38:10,512 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:38:10,512 INFO  L87              Difference]: Start difference. First operand 893 states and 1097 transitions. Second operand  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:10,972 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:38:10,972 INFO  L93              Difference]: Finished difference Result 2070 states and 2618 transitions.
[2024-11-09 18:38:10,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:38:10,972 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102
[2024-11-09 18:38:10,972 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:38:10,976 INFO  L225             Difference]: With dead ends: 2070
[2024-11-09 18:38:10,977 INFO  L226             Difference]: Without dead ends: 1179
[2024-11-09 18:38:10,978 INFO  L431           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
[2024-11-09 18:38:10,979 INFO  L432           NwaCegarLoop]: 252 mSDtfsCounter, 140 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-09 18:38:10,980 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 272 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-09 18:38:10,981 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1179 states.
[2024-11-09 18:38:10,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1176.
[2024-11-09 18:38:10,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1176 states, 1175 states have (on average 1.1914893617021276) internal successors, (1400), 1175 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:10,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1400 transitions.
[2024-11-09 18:38:10,999 INFO  L78                 Accepts]: Start accepts. Automaton has 1176 states and 1400 transitions. Word has length 102
[2024-11-09 18:38:10,999 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:38:11,000 INFO  L471      AbstractCegarLoop]: Abstraction has 1176 states and 1400 transitions.
[2024-11-09 18:38:11,000 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:11,000 INFO  L276                IsEmpty]: Start isEmpty. Operand 1176 states and 1400 transitions.
[2024-11-09 18:38:11,002 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-09 18:38:11,002 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:38:11,002 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:38:11,002 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-09 18:38:11,003 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:38:11,003 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:38:11,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -189783190, now seen corresponding path program 1 times
[2024-11-09 18:38:11,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:38:11,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312129449]
[2024-11-09 18:38:11,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:38:11,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:38:11,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-09 18:38:11,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-09 18:38:11,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-09 18:38:11,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312129449]
[2024-11-09 18:38:11,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312129449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-09 18:38:11,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-09 18:38:11,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-09 18:38:11,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768195445]
[2024-11-09 18:38:11,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-09 18:38:11,084 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-09 18:38:11,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-09 18:38:11,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-09 18:38:11,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:38:11,088 INFO  L87              Difference]: Start difference. First operand 1176 states and 1400 transitions. Second operand  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:11,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-09 18:38:11,463 INFO  L93              Difference]: Finished difference Result 3198 states and 3837 transitions.
[2024-11-09 18:38:11,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-09 18:38:11,463 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2024-11-09 18:38:11,463 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-09 18:38:11,468 INFO  L225             Difference]: With dead ends: 3198
[2024-11-09 18:38:11,468 INFO  L226             Difference]: Without dead ends: 2024
[2024-11-09 18:38:11,469 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-09 18:38:11,470 INFO  L432           NwaCegarLoop]: 70 mSDtfsCounter, 182 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-09 18:38:11,471 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 87 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-09 18:38:11,472 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2024 states.
[2024-11-09 18:38:11,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2024.
[2024-11-09 18:38:11,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2024 states, 2023 states have (on average 1.1655956500247158) internal successors, (2358), 2023 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:11,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2358 transitions.
[2024-11-09 18:38:11,501 INFO  L78                 Accepts]: Start accepts. Automaton has 2024 states and 2358 transitions. Word has length 110
[2024-11-09 18:38:11,502 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-09 18:38:11,502 INFO  L471      AbstractCegarLoop]: Abstraction has 2024 states and 2358 transitions.
[2024-11-09 18:38:11,502 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-09 18:38:11,503 INFO  L276                IsEmpty]: Start isEmpty. Operand 2024 states and 2358 transitions.
[2024-11-09 18:38:11,505 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2024-11-09 18:38:11,506 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-09 18:38:11,506 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-09 18:38:11,506 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-09 18:38:11,506 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-09 18:38:11,506 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-09 18:38:11,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 1810272927, now seen corresponding path program 1 times
[2024-11-09 18:38:11,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-09 18:38:11,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177222462]
[2024-11-09 18:38:11,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-09 18:38:11,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-09 18:38:11,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-09 18:38:11,536 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-09 18:38:11,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-09 18:38:11,591 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-09 18:38:11,591 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-09 18:38:11,593 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-09 18:38:11,594 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-09 18:38:11,597 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-11-09 18:38:11,677 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-09 18:38:11,680 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:38:11 BoogieIcfgContainer
[2024-11-09 18:38:11,680 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-09 18:38:11,681 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-09 18:38:11,681 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-09 18:38:11,681 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-09 18:38:11,684 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:07" (3/4) ...
[2024-11-09 18:38:11,684 INFO  L137         WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-09 18:38:11,771 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-09 18:38:11,771 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-09 18:38:11,772 INFO  L158              Benchmark]: Toolchain (without parser) took 5906.75ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 81.7MB in the beginning and 65.5MB in the end (delta: 16.2MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB.
[2024-11-09 18:38:11,772 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-09 18:38:11,773 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 471.36ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 116.1MB in the end (delta: -34.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB.
[2024-11-09 18:38:11,773 INFO  L158              Benchmark]: Boogie Procedure Inliner took 63.65ms. Allocated memory is still 159.4MB. Free memory was 116.1MB in the beginning and 110.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-09 18:38:11,774 INFO  L158              Benchmark]: Boogie Preprocessor took 93.13ms. Allocated memory is still 159.4MB. Free memory was 110.6MB in the beginning and 106.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-09 18:38:11,774 INFO  L158              Benchmark]: IcfgBuilder took 1148.05ms. Allocated memory is still 159.4MB. Free memory was 106.3MB in the beginning and 107.8MB in the end (delta: -1.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB.
[2024-11-09 18:38:11,774 INFO  L158              Benchmark]: TraceAbstraction took 4033.35ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 106.9MB in the beginning and 79.1MB in the end (delta: 27.8MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB.
[2024-11-09 18:38:11,774 INFO  L158              Benchmark]: Witness Printer took 90.54ms. Allocated memory is still 224.4MB. Free memory was 79.1MB in the beginning and 65.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-09 18:38:11,775 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.16ms. Allocated memory is still 159.4MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 471.36ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 116.1MB in the end (delta: -34.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 63.65ms. Allocated memory is still 159.4MB. Free memory was 116.1MB in the beginning and 110.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 93.13ms. Allocated memory is still 159.4MB. Free memory was 110.6MB in the beginning and 106.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1148.05ms. Allocated memory is still 159.4MB. Free memory was 106.3MB in the beginning and 107.8MB in the end (delta: -1.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 4033.35ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 106.9MB in the beginning and 79.1MB in the end (delta: 27.8MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB.
 * Witness Printer took 90.54ms. Allocated memory is still 224.4MB. Free memory was 79.1MB in the beginning and 65.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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
  - CounterExampleResult [Line: 437]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L17]               int a= 1;
[L18]               int e= 5;
[L19]               int d= 4;
[L20]               int f= 6;
[L21]               int c= 3;
[L24]               int u = 21;
[L25]               int v = 22;
[L26]               int w = 23;
[L27]               int x = 24;
[L28]               int y = 25;
[L29]               int z = 26;
[L32]               int a25 = 0;
[L33]               int a11 = 0;
[L34]               int a28 = 7;
[L35]               int a19 = 1;
[L36]               int a21 = 1;
[L37]               int a17 = 8;
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L613]              int output = -1;
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L616]  COND TRUE   1
[L619]              int input;
[L620]              input = __VERIFIER_nondet_int()
[L621]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624]  CALL, EXPR  calculate_output(input)
[L40]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L45]   COND FALSE  !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L48]   COND FALSE  !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L52]   COND FALSE  !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L57]   COND FALSE  !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L60]   COND FALSE  !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L64]   COND FALSE  !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L69]   COND FALSE  !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L75]   COND FALSE  !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L79]   COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L84]   COND FALSE  !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L92]   COND FALSE  !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L101]  COND FALSE  !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L105]  COND FALSE  !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L109]  COND FALSE  !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L116]  COND FALSE  !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L123]  COND FALSE  !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L129]  COND FALSE  !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L133]  COND FALSE  !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L140]  COND FALSE  !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L144]  COND FALSE  !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L149]  COND FALSE  !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L153]  COND FALSE  !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L158]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L164]  COND FALSE  !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L169]  COND FALSE  !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1)))
        VAL         [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L175]  COND TRUE   (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))
[L176]              a25 = 1
[L177]              a28 = 9
[L178]              return 26;
        VAL         [\result=26, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L624]  RET, EXPR   calculate_output(input)
[L624]              output = calculate_output(input)
[L616]  COND TRUE   1
[L619]              int input;
[L620]              input = __VERIFIER_nondet_int()
[L621]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624]  CALL, EXPR  calculate_output(input)
[L40]   COND TRUE   (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))
[L41]               a28 = 9
[L42]               a11 = 1
[L43]               a25 = 1
[L44]               return -1;
        VAL         [\result=-1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L624]  RET, EXPR   calculate_output(input)
[L624]              output = calculate_output(input)
[L616]  COND TRUE   1
[L619]              int input;
[L620]              input = __VERIFIER_nondet_int()
[L621]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624]  CALL        calculate_output(input)
[L40]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L45]   COND FALSE  !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L48]   COND FALSE  !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L52]   COND FALSE  !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L57]   COND FALSE  !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L60]   COND FALSE  !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L64]   COND FALSE  !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L69]   COND FALSE  !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L75]   COND FALSE  !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L79]   COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L84]   COND FALSE  !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L92]   COND FALSE  !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L101]  COND FALSE  !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L105]  COND FALSE  !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L109]  COND FALSE  !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L116]  COND FALSE  !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L123]  COND FALSE  !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L129]  COND FALSE  !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L133]  COND FALSE  !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L140]  COND FALSE  !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L144]  COND FALSE  !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L149]  COND FALSE  !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L153]  COND FALSE  !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L158]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L164]  COND FALSE  !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L169]  COND FALSE  !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L175]  COND FALSE  !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L179]  COND FALSE  !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L185]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L189]  COND FALSE  !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L195]  COND FALSE  !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L197]  COND FALSE  !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L199]  COND FALSE  !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L201]  COND FALSE  !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L204]  COND FALSE  !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L208]  COND FALSE  !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1))))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L212]  COND FALSE  !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L222]  COND FALSE  !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L225]  COND FALSE  !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1))))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L228]  COND FALSE  !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L233]  COND FALSE  !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L235]  COND FALSE  !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L242]  COND FALSE  !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L244]  COND FALSE  !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L247]  COND FALSE  !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L258]  COND FALSE  !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L263]  COND FALSE  !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L269]  COND FALSE  !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1)))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L271]  COND FALSE  !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1))))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L286]  COND FALSE  !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1))))))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L290]  COND FALSE  !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1)))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L293]  COND FALSE  !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L296]  COND FALSE  !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L301]  COND FALSE  !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L303]  COND FALSE  !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L307]  COND FALSE  !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L319]  COND FALSE  !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L324]  COND FALSE  !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9)))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L338]  COND FALSE  !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L341]  COND FALSE  !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L347]  COND FALSE  !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L359]  COND FALSE  !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L364]  COND FALSE  !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L371]  COND FALSE  !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L378]  COND FALSE  !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L385]  COND FALSE  !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L388]  COND FALSE  !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L390]  COND FALSE  !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L399]  COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L404]  COND FALSE  !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L408]  COND FALSE  !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L412]  COND FALSE  !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L414]  COND FALSE  !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L417]  COND FALSE  !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11)))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L419]  COND FALSE  !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1)))))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L424]  COND FALSE  !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L427]  COND FALSE  !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L430]  COND FALSE  !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L433]  COND FALSE  !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7)))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L436]  COND TRUE   ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L437]              reach_error()
        VAL         [a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 755 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 755 mSDsluCounter, 873 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 386 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1954 IncrementalHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 386 mSolverCounterUnsat, 772 mSDtfsCounter, 1954 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2024occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 484 ConstructedInterpolants, 0 QuantifiedInterpolants, 759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 60/60 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
RESULT: Ultimate proved your program to be incorrect!
[2024-11-09 18:38:11,809 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
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE