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


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


Checking for ERROR reachability
Using default analysis
Version cf1a7837
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl --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 f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-cf1a783
[2023-11-12 02:13:37,709 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-12 02:13:37,823 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-12 02:13:37,831 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-11-12 02:13:37,832 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-12 02:13:37,868 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-12 02:13:37,869 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-12 02:13:37,870 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-12 02:13:37,871 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-12 02:13:37,872 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-12 02:13:37,873 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-12 02:13:37,873 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-12 02:13:37,874 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-12 02:13:37,875 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-12 02:13:37,875 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-12 02:13:37,876 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-12 02:13:37,877 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-12 02:13:37,877 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-12 02:13:37,878 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-12 02:13:37,878 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-12 02:13:37,879 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-12 02:13:37,880 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-12 02:13:37,880 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-12 02:13:37,881 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-12 02:13:37,881 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-12 02:13:37,882 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-12 02:13:37,882 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-12 02:13:37,883 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-12 02:13:37,883 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-12 02:13:37,884 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-12 02:13:37,884 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-12 02:13:37,885 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-12 02:13:37,885 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-12 02:13:37,886 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-12 02:13:37,886 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-12 02:13:37,887 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-12 02:13:37,887 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-12 02:13:37,888 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-12 02:13:37,888 INFO  L153        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-12 02:13:37,889 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl
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 -> f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161
[2023-11-12 02:13:38,223 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-12 02:13:38,255 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-12 02:13:38,258 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-12 02:13:38,260 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-12 02:13:38,261 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-12 02:13:38,262 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c
[2023-11-12 02:13:41,371 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-12 02:13:41,672 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-12 02:13:41,673 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/sv-benchmarks/c/eca-rers2012/Problem02_label16.c
[2023-11-12 02:13:41,687 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/data/11bb46b77/5553aa894ac245c993ecd3bc17d1be40/FLAG55e05d399
[2023-11-12 02:13:41,703 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/data/11bb46b77/5553aa894ac245c993ecd3bc17d1be40
[2023-11-12 02:13:41,705 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-12 02:13:41,707 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-12 02:13:41,709 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-12 02:13:41,709 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-12 02:13:41,716 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-12 02:13:41,720 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:13:41" (1/1) ...
[2023-11-12 02:13:41,722 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd99506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:41, skipping insertion in model container
[2023-11-12 02:13:41,722 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:13:41" (1/1) ...
[2023-11-12 02:13:41,795 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-12 02:13:42,120 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325]
[2023-11-12 02:13:42,199 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-12 02:13:42,217 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-12 02:13:42,345 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325]
[2023-11-12 02:13:42,384 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-12 02:13:42,400 INFO  L206         MainTranslator]: Completed translation
[2023-11-12 02:13:42,401 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42 WrapperNode
[2023-11-12 02:13:42,402 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-12 02:13:42,404 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-12 02:13:42,404 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-12 02:13:42,404 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-12 02:13:42,412 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,445 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,503 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669
[2023-11-12 02:13:42,503 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-12 02:13:42,504 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-12 02:13:42,505 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-12 02:13:42,506 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-12 02:13:42,516 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,517 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,532 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,539 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,593 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,602 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,625 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,630 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,638 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-12 02:13:42,639 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-12 02:13:42,639 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-12 02:13:42,639 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-12 02:13:42,640 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (1/1) ...
[2023-11-12 02:13:42,647 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-12 02:13:42,662 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/z3
[2023-11-12 02:13:42,685 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-12 02:13:42,703 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-12 02:13:42,722 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-12 02:13:42,722 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-12 02:13:42,722 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-12 02:13:42,722 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-12 02:13:42,798 INFO  L236             CfgBuilder]: Building ICFG
[2023-11-12 02:13:42,800 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-12 02:13:43,934 INFO  L277             CfgBuilder]: Performing block encoding
[2023-11-12 02:13:43,943 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-12 02:13:43,943 INFO  L302             CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-12 02:13:43,946 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:43 BoogieIcfgContainer
[2023-11-12 02:13:43,946 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-12 02:13:43,948 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-12 02:13:43,949 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-12 02:13:43,952 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-12 02:13:43,952 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:13:41" (1/3) ...
[2023-11-12 02:13:43,953 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1573e697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:13:43, skipping insertion in model container
[2023-11-12 02:13:43,953 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:13:42" (2/3) ...
[2023-11-12 02:13:43,953 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1573e697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:13:43, skipping insertion in model container
[2023-11-12 02:13:43,953 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:43" (3/3) ...
[2023-11-12 02:13:43,954 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label16.c
[2023-11-12 02:13:43,974 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-12 02:13:43,974 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-12 02:13:44,032 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-12 02:13:44,038 INFO  L357      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, mHoare=true, 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;@6c949815, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-12 02:13:44,038 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-12 02:13:44,043 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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)
[2023-11-12 02:13:44,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2023-11-12 02:13:44,055 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-12 02:13:44,055 INFO  L195           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]
[2023-11-12 02:13:44,056 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-12 02:13:44,060 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-12 02:13:44,061 INFO  L85        PathProgramCache]: Analyzing trace with hash -866593277, now seen corresponding path program 1 times
[2023-11-12 02:13:44,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-12 02:13:44,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270885404]
[2023-11-12 02:13:44,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-12 02:13:44,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-12 02:13:44,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-12 02:13:44,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-12 02:13:44,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-12 02:13:44,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270885404]
[2023-11-12 02:13:44,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270885404] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-12 02:13:44,668 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-12 02:13:44,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-12 02:13:44,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360084676]
[2023-11-12 02:13:44,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-12 02:13:44,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-12 02:13:44,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-12 02:13:44,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-12 02:13:44,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-12 02:13:44,736 INFO  L87              Difference]: Start difference. First operand  has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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)
[2023-11-12 02:13:45,610 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-12 02:13:45,610 INFO  L93              Difference]: Finished difference Result 596 states and 1030 transitions.
[2023-11-12 02:13:45,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-12 02:13:45,613 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
[2023-11-12 02:13:45,614 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-12 02:13:45,627 INFO  L225             Difference]: With dead ends: 596
[2023-11-12 02:13:45,627 INFO  L226             Difference]: Without dead ends: 305
[2023-11-12 02:13:45,631 INFO  L412           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
[2023-11-12 02:13:45,635 INFO  L413           NwaCegarLoop]: 78 mSDtfsCounter, 157 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2023-11-12 02:13:45,636 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2023-11-12 02:13:45,657 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2023-11-12 02:13:45,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305.
[2023-11-12 02:13:45,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 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)
[2023-11-12 02:13:45,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions.
[2023-11-12 02:13:45,701 INFO  L78                 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 87
[2023-11-12 02:13:45,701 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-12 02:13:45,702 INFO  L495      AbstractCegarLoop]: Abstraction has 305 states and 464 transitions.
[2023-11-12 02:13:45,702 INFO  L496      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)
[2023-11-12 02:13:45,702 INFO  L276                IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions.
[2023-11-12 02:13:45,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2023-11-12 02:13:45,707 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-12 02:13:45,707 INFO  L195           NwaCegarLoop]: trace histogram [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, 1, 1, 1]
[2023-11-12 02:13:45,708 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-12 02:13:45,708 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-12 02:13:45,709 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-12 02:13:45,709 INFO  L85        PathProgramCache]: Analyzing trace with hash -1684381881, now seen corresponding path program 1 times
[2023-11-12 02:13:45,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-12 02:13:45,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232845050]
[2023-11-12 02:13:45,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-12 02:13:45,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-12 02:13:45,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-12 02:13:46,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-12 02:13:46,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-12 02:13:46,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232845050]
[2023-11-12 02:13:46,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232845050] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-12 02:13:46,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-12 02:13:46,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-12 02:13:46,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496398170]
[2023-11-12 02:13:46,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-12 02:13:46,023 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-12 02:13:46,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-12 02:13:46,025 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-12 02:13:46,025 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-12 02:13:46,025 INFO  L87              Difference]: Start difference. First operand 305 states and 464 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 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)
[2023-11-12 02:13:46,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-12 02:13:46,585 INFO  L93              Difference]: Finished difference Result 900 states and 1374 transitions.
[2023-11-12 02:13:46,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-12 02:13:46,586 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 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
[2023-11-12 02:13:46,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-12 02:13:46,593 INFO  L225             Difference]: With dead ends: 900
[2023-11-12 02:13:46,594 INFO  L226             Difference]: Without dead ends: 597
[2023-11-12 02:13:46,595 INFO  L412           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
[2023-11-12 02:13:46,597 INFO  L413           NwaCegarLoop]: 53 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-12 02:13:46,597 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 72 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-12 02:13:46,603 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 597 states.
[2023-11-12 02:13:46,632 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 456.
[2023-11-12 02:13:46,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 456 states, 455 states have (on average 1.4901098901098901) internal successors, (678), 455 states have internal predecessors, (678), 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)
[2023-11-12 02:13:46,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 678 transitions.
[2023-11-12 02:13:46,636 INFO  L78                 Accepts]: Start accepts. Automaton has 456 states and 678 transitions. Word has length 98
[2023-11-12 02:13:46,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-12 02:13:46,636 INFO  L495      AbstractCegarLoop]: Abstraction has 456 states and 678 transitions.
[2023-11-12 02:13:46,636 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 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)
[2023-11-12 02:13:46,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 456 states and 678 transitions.
[2023-11-12 02:13:46,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2023-11-12 02:13:46,649 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-12 02:13:46,649 INFO  L195           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-12 02:13:46,649 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-12 02:13:46,650 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-12 02:13:46,650 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-12 02:13:46,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 1709716194, now seen corresponding path program 1 times
[2023-11-12 02:13:46,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-12 02:13:46,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679731143]
[2023-11-12 02:13:46,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-12 02:13:46,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-12 02:13:46,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-12 02:13:46,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-12 02:13:46,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-12 02:13:46,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679731143]
[2023-11-12 02:13:46,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679731143] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-12 02:13:46,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-12 02:13:46,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-12 02:13:46,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064789020]
[2023-11-12 02:13:46,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-12 02:13:46,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-12 02:13:46,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-12 02:13:46,853 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-12 02:13:46,853 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-12 02:13:46,853 INFO  L87              Difference]: Start difference. First operand 456 states and 678 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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)
[2023-11-12 02:13:47,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-12 02:13:47,403 INFO  L93              Difference]: Finished difference Result 1352 states and 2016 transitions.
[2023-11-12 02:13:47,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-12 02:13:47,404 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105
[2023-11-12 02:13:47,404 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-12 02:13:47,413 INFO  L225             Difference]: With dead ends: 1352
[2023-11-12 02:13:47,413 INFO  L226             Difference]: Without dead ends: 898
[2023-11-12 02:13:47,415 INFO  L412           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
[2023-11-12 02:13:47,417 INFO  L413           NwaCegarLoop]: 95 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-12 02:13:47,417 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 123 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-12 02:13:47,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 898 states.
[2023-11-12 02:13:47,450 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 889.
[2023-11-12 02:13:47,452 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 889 states, 888 states have (on average 1.4391891891891893) internal successors, (1278), 888 states have internal predecessors, (1278), 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)
[2023-11-12 02:13:47,457 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1278 transitions.
[2023-11-12 02:13:47,457 INFO  L78                 Accepts]: Start accepts. Automaton has 889 states and 1278 transitions. Word has length 105
[2023-11-12 02:13:47,459 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-12 02:13:47,461 INFO  L495      AbstractCegarLoop]: Abstraction has 889 states and 1278 transitions.
[2023-11-12 02:13:47,462 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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)
[2023-11-12 02:13:47,462 INFO  L276                IsEmpty]: Start isEmpty. Operand 889 states and 1278 transitions.
[2023-11-12 02:13:47,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2023-11-12 02:13:47,470 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-12 02:13:47,472 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-12 02:13:47,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-12 02:13:47,472 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-12 02:13:47,474 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-12 02:13:47,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 1852917719, now seen corresponding path program 1 times
[2023-11-12 02:13:47,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-12 02:13:47,482 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657642056]
[2023-11-12 02:13:47,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-12 02:13:47,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-12 02:13:47,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-12 02:13:47,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-11-12 02:13:47,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-12 02:13:47,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657642056]
[2023-11-12 02:13:47,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657642056] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-12 02:13:47,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-12 02:13:47,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-12 02:13:47,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198872660]
[2023-11-12 02:13:47,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-12 02:13:47,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-12 02:13:47,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-12 02:13:47,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-12 02:13:47,878 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-12 02:13:47,878 INFO  L87              Difference]: Start difference. First operand 889 states and 1278 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)
[2023-11-12 02:13:48,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-12 02:13:48,436 INFO  L93              Difference]: Finished difference Result 2201 states and 3179 transitions.
[2023-11-12 02:13:48,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-12 02:13:48,437 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 109
[2023-11-12 02:13:48,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-12 02:13:48,444 INFO  L225             Difference]: With dead ends: 2201
[2023-11-12 02:13:48,445 INFO  L226             Difference]: Without dead ends: 1314
[2023-11-12 02:13:48,446 INFO  L412           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
[2023-11-12 02:13:48,456 INFO  L413           NwaCegarLoop]: 106 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-12 02:13:48,458 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 122 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-12 02:13:48,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1314 states.
[2023-11-12 02:13:48,489 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1172.
[2023-11-12 02:13:48,491 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1172 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1171 states have internal predecessors, (1586), 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)
[2023-11-12 02:13:48,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1586 transitions.
[2023-11-12 02:13:48,497 INFO  L78                 Accepts]: Start accepts. Automaton has 1172 states and 1586 transitions. Word has length 109
[2023-11-12 02:13:48,497 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-12 02:13:48,497 INFO  L495      AbstractCegarLoop]: Abstraction has 1172 states and 1586 transitions.
[2023-11-12 02:13:48,498 INFO  L496      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)
[2023-11-12 02:13:48,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 1172 states and 1586 transitions.
[2023-11-12 02:13:48,501 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2023-11-12 02:13:48,501 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-12 02:13:48,502 INFO  L195           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-12 02:13:48,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-12 02:13:48,502 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-12 02:13:48,503 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-12 02:13:48,503 INFO  L85        PathProgramCache]: Analyzing trace with hash -953514324, now seen corresponding path program 1 times
[2023-11-12 02:13:48,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-12 02:13:48,504 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081813399]
[2023-11-12 02:13:48,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-12 02:13:48,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-12 02:13:48,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-12 02:13:48,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-11-12 02:13:48,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-12 02:13:48,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081813399]
[2023-11-12 02:13:48,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081813399] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-12 02:13:48,740 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-12 02:13:48,740 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-12 02:13:48,740 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85360996]
[2023-11-12 02:13:48,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-12 02:13:48,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-12 02:13:48,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-12 02:13:48,741 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-12 02:13:48,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-12 02:13:48,742 INFO  L87              Difference]: Start difference. First operand 1172 states and 1586 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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)
[2023-11-12 02:13:49,341 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-12 02:13:49,341 INFO  L93              Difference]: Finished difference Result 3189 states and 4396 transitions.
[2023-11-12 02:13:49,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-12 02:13:49,342 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 114
[2023-11-12 02:13:49,342 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-12 02:13:49,354 INFO  L225             Difference]: With dead ends: 3189
[2023-11-12 02:13:49,354 INFO  L226             Difference]: Without dead ends: 2019
[2023-11-12 02:13:49,356 INFO  L412           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
[2023-11-12 02:13:49,357 INFO  L413           NwaCegarLoop]: 234 mSDtfsCounter, 146 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2023-11-12 02:13:49,357 INFO  L414           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 249 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2023-11-12 02:13:49,360 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2019 states.
[2023-11-12 02:13:49,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2014.
[2023-11-12 02:13:49,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2014 states, 2013 states have (on average 1.2518628912071534) internal successors, (2520), 2013 states have internal predecessors, (2520), 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)
[2023-11-12 02:13:49,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2520 transitions.
[2023-11-12 02:13:49,433 INFO  L78                 Accepts]: Start accepts. Automaton has 2014 states and 2520 transitions. Word has length 114
[2023-11-12 02:13:49,434 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2023-11-12 02:13:49,434 INFO  L495      AbstractCegarLoop]: Abstraction has 2014 states and 2520 transitions.
[2023-11-12 02:13:49,434 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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)
[2023-11-12 02:13:49,435 INFO  L276                IsEmpty]: Start isEmpty. Operand 2014 states and 2520 transitions.
[2023-11-12 02:13:49,438 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2023-11-12 02:13:49,438 INFO  L187           NwaCegarLoop]: Found error trace
[2023-11-12 02:13:49,439 INFO  L195           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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]
[2023-11-12 02:13:49,439 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-12 02:13:49,439 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-12 02:13:49,440 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-12 02:13:49,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -1619945599, now seen corresponding path program 1 times
[2023-11-12 02:13:49,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-12 02:13:49,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373755143]
[2023-11-12 02:13:49,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-12 02:13:49,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-12 02:13:49,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-12 02:13:49,498 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-12 02:13:49,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-12 02:13:49,590 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-12 02:13:49,590 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-12 02:13:49,591 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-12 02:13:49,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-12 02:13:49,599 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-11-12 02:13:49,604 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-12 02:13:49,730 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:13:49 BoogieIcfgContainer
[2023-11-12 02:13:49,731 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-12 02:13:49,731 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-12 02:13:49,731 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2023-11-12 02:13:49,731 INFO  L274        PluginConnector]: Witness Printer initialized
[2023-11-12 02:13:49,732 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:13:43" (3/4) ...
[2023-11-12 02:13:49,733 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-12 02:13:49,824 INFO  L149         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml
[2023-11-12 02:13:49,825 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-12 02:13:49,825 INFO  L158              Benchmark]: Toolchain (without parser) took 8118.37ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 112.1MB in the beginning and 56.4MB in the end (delta: 55.7MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB.
[2023-11-12 02:13:49,826 INFO  L158              Benchmark]: CDTParser took 0.50ms. Allocated memory is still 159.4MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-12 02:13:49,826 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 693.98ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 84.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2023-11-12 02:13:49,826 INFO  L158              Benchmark]: Boogie Procedure Inliner took 100.02ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 79.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-12 02:13:49,851 INFO  L158              Benchmark]: Boogie Preprocessor took 134.24ms. Allocated memory is still 159.4MB. Free memory was 79.9MB in the beginning and 75.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-12 02:13:49,851 INFO  L158              Benchmark]: RCFGBuilder took 1307.23ms. Allocated memory is still 159.4MB. Free memory was 75.0MB in the beginning and 71.6MB in the end (delta: 3.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB.
[2023-11-12 02:13:49,852 INFO  L158              Benchmark]: TraceAbstraction took 5782.15ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 70.8MB in the beginning and 66.9MB in the end (delta: 3.9MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB.
[2023-11-12 02:13:49,852 INFO  L158              Benchmark]: Witness Printer took 93.68ms. Allocated memory is still 203.4MB. Free memory was 66.9MB in the beginning and 56.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2023-11-12 02:13:49,854 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.50ms. Allocated memory is still 159.4MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 693.98ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 84.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 100.02ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 79.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 134.24ms. Allocated memory is still 159.4MB. Free memory was 79.9MB in the beginning and 75.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1307.23ms. Allocated memory is still 159.4MB. Free memory was 75.0MB in the beginning and 71.6MB in the end (delta: 3.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 5782.15ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 70.8MB in the beginning and 66.9MB in the end (delta: 3.9MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB.
 * Witness Printer took 93.68ms. Allocated memory is still 203.4MB. Free memory was 66.9MB in the beginning and 56.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 443]: 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, output=-1, u=21, v=22, w=23, x=24, y=25, z=26]
[L616]       COND TRUE         1
[L619]                         int input;
[L620]       EXPR              input = __VERIFIER_nondet_int()
[L621]       COND FALSE, EXPR  !((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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L60]        COND TRUE         ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))
[L61]                          a28 = 11
[L62]                          a25 = 1
[L63]                          return 26;
             VAL               [\old(input)=1, \result=26, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L624]       RET, EXPR         calculate_output(input)
[L624]       EXPR              output = calculate_output(input)
[L617-L626]                    {
        // read input
        int input;
        input = __VERIFIER_nondet_int();
        if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2;

        // operate eca engine
        output = calculate_output(input);

    }
             VAL               [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26]
[L616]       COND TRUE         1
[L619]                         int input;
[L620]       EXPR              input = __VERIFIER_nondet_int()
[L621]       COND FALSE, EXPR  !((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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, 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               [\old(input)=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L109]       COND TRUE         ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))
[L110]                         a17 = 7
[L111]                         a25 = 0
[L112]                         a11 = 1
[L113]                         a28 = 10
[L114]                         a19 = 0
[L115]                         return -1;
             VAL               [\old(input)=1, \result=-1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26]
[L624]       RET, EXPR         calculate_output(input)
[L624]       EXPR              output = calculate_output(input)
[L617-L626]                    {
        // read input
        int input;
        input = __VERIFIER_nondet_int();
        if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2;

        // operate eca engine
        output = calculate_output(input);

    }
             VAL               [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, output=-1, 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              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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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 FALSE        !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)))
             VAL               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, 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               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L436]       COND FALSE        !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)))
             VAL               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L439]       COND FALSE        !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)))
             VAL               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L442]       COND TRUE         (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))
             VAL               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L443]                         reach_error()
             VAL               [\old(input)=3, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 795 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 655 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1966 IncrementalHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 566 mSDtfsCounter, 1966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2014occurred 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 297 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 627 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 88/88 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!
[2023-11-12 02:13:49,898 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7a3f897-f27d-479c-8515-84687676826d/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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