./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 9bd2c7ff
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_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu --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 55cfdf74604724371a452c38b03dd4e25c32928e3cf25773bd571d9975e54b78
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:58:36,917 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:58:37,037 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:58:37,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:58:37,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:58:37,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:58:37,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:58:37,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:58:37,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:58:37,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:58:37,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:58:37,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:58:37,114 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:58:37,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:58:37,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:58:37,118 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:58:37,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:58:37,119 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:58:37,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:58:37,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:58:37,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:58:37,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:58:37,122 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:58:37,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:58:37,138 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:58:37,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:58:37,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:58:37,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:58:37,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:58:37,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:58:37,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:58:37,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:58:37,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:58:37,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:58:37,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:58:37,144 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:58:37,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:58:37,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:58:37,145 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:58:37,145 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_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/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_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu
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 -> 55cfdf74604724371a452c38b03dd4e25c32928e3cf25773bd571d9975e54b78
[2023-11-19 07:58:37,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:58:37,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:58:37,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:58:37,554 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:58:37,555 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:58:37,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/eca-rers2012/Problem02_label50.c
[2023-11-19 07:58:41,493 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:58:41,899 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:58:41,900 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/sv-benchmarks/c/eca-rers2012/Problem02_label50.c
[2023-11-19 07:58:41,946 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/data/83f30e9f9/da26ef836565406db3bbaed06fe56676/FLAG005834352
[2023-11-19 07:58:41,977 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/data/83f30e9f9/da26ef836565406db3bbaed06fe56676
[2023-11-19 07:58:41,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:58:41,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:58:41,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:58:41,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:58:41,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:58:41,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:41" (1/1) ...
[2023-11-19 07:58:42,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3afb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:41, skipping insertion in model container
[2023-11-19 07:58:42,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:41" (1/1) ...
[2023-11-19 07:58:42,111 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:58:42,519 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_a36fc56a-e106-4948-bc69-ed548ca2af3e/sv-benchmarks/c/eca-rers2012/Problem02_label50.c[14631,14644]
[2023-11-19 07:58:42,590 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:58:42,606 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:58:42,785 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_a36fc56a-e106-4948-bc69-ed548ca2af3e/sv-benchmarks/c/eca-rers2012/Problem02_label50.c[14631,14644]
[2023-11-19 07:58:42,820 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:58:42,844 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:58:42,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42 WrapperNode
[2023-11-19 07:58:42,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:58:42,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:58:42,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:58:42,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:58:42,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:42,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:42,962 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669
[2023-11-19 07:58:42,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:58:42,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:58:42,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:58:42,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:58:42,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:42,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:42,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:42,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:43,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:43,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:43,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:43,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:43,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:58:43,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:58:43,111 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:58:43,117 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:58:43,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (1/1) ...
[2023-11-19 07:58:43,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:58:43,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:58:43,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 07:58:43,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 07:58:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:58:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:58:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:58:43,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:58:43,352 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:58:43,356 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:58:44,913 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:58:44,939 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:58:44,939 INFO L302 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-19 07:58:44,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:44 BoogieIcfgContainer
[2023-11-19 07:58:44,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:58:44,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:58:44,958 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:58:44,962 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:58:44,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:58:41" (1/3) ...
[2023-11-19 07:58:44,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba786fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:44, skipping insertion in model container
[2023-11-19 07:58:44,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:42" (2/3) ...
[2023-11-19 07:58:44,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba786fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:44, skipping insertion in model container
[2023-11-19 07:58:44,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:44" (3/3) ...
[2023-11-19 07:58:44,973 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label50.c
[2023-11-19 07:58:45,005 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:58:45,005 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-19 07:58:45,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:58:45,110 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;@7c87ea89, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:58:45,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-19 07:58:45,117 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-19 07:58:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2023-11-19 07:58:45,131 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:45,132 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]
[2023-11-19 07:58:45,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:45,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1127028437, now seen corresponding path program 1 times
[2023-11-19 07:58:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594159720]
[2023-11-19 07:58:45,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:46,102 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-19 07:58:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:46,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594159720]
[2023-11-19 07:58:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594159720] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:46,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:46,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:58:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718254804]
[2023-11-19 07:58:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:46,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:46,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:46,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:46,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:46,169 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 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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-19 07:58:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:47,366 INFO L93 Difference]: Finished difference Result 617 states and 1059 transitions.
[2023-11-19 07:58:47,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:47,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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 81
[2023-11-19 07:58:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:47,388 INFO L225 Difference]: With dead ends: 617
[2023-11-19 07:58:47,388 INFO L226 Difference]: Without dead ends: 316
[2023-11-19 07:58:47,394 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-19 07:58:47,399 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 120 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:47,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 102 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2023-11-19 07:58:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states.
[2023-11-19 07:58:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309.
[2023-11-19 07:58:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 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-19 07:58:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions.
[2023-11-19 07:58:47,478 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 81
[2023-11-19 07:58:47,479 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:47,480 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions.
[2023-11-19 07:58:47,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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-19 07:58:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions.
[2023-11-19 07:58:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2023-11-19 07:58:47,486 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:47,487 INFO L195 NwaCegarLoop]: trace histogram [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]
[2023-11-19 07:58:47,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:58:47,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:47,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1717775062, now seen corresponding path program 1 times
[2023-11-19 07:58:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184597213]
[2023-11-19 07:58:47,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:58:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184597213]
[2023-11-19 07:58:47,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184597213] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:47,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:47,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:58:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756965572]
[2023-11-19 07:58:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:47,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:47,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:47,666 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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-19 07:58:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:48,426 INFO L93 Difference]: Finished difference Result 900 states and 1316 transitions.
[2023-11-19 07:58:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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 89
[2023-11-19 07:58:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:48,433 INFO L225 Difference]: With dead ends: 900
[2023-11-19 07:58:48,433 INFO L226 Difference]: Without dead ends: 593
[2023-11-19 07:58:48,435 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-19 07:58:48,437 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 141 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:48,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 117 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2023-11-19 07:58:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states.
[2023-11-19 07:58:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591.
[2023-11-19 07:58:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 590 states have internal predecessors, (763), 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-19 07:58:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 763 transitions.
[2023-11-19 07:58:48,510 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 763 transitions. Word has length 89
[2023-11-19 07:58:48,510 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:48,511 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 763 transitions.
[2023-11-19 07:58:48,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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-19 07:58:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 763 transitions.
[2023-11-19 07:58:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2023-11-19 07:58:48,529 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:48,529 INFO L195 NwaCegarLoop]: trace histogram [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]
[2023-11-19 07:58:48,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:58:48,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:48,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2067825974, now seen corresponding path program 1 times
[2023-11-19 07:58:48,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686736087]
[2023-11-19 07:58:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:58:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686736087]
[2023-11-19 07:58:48,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686736087] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:48,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:48,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:58:48,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781675026]
[2023-11-19 07:58:48,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:48,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:48,875 INFO L87 Difference]: Start difference. First operand 591 states and 763 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-19 07:58:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:49,626 INFO L93 Difference]: Finished difference Result 1750 states and 2263 transitions.
[2023-11-19 07:58:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90
[2023-11-19 07:58:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:49,644 INFO L225 Difference]: With dead ends: 1750
[2023-11-19 07:58:49,644 INFO L226 Difference]: Without dead ends: 1161
[2023-11-19 07:58:49,650 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-19 07:58:49,652 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 89 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:49,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 297 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2023-11-19 07:58:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states.
[2023-11-19 07:58:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1014.
[2023-11-19 07:58:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 1.2645607107601184) internal successors, (1281), 1013 states have internal predecessors, (1281), 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-19 07:58:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1281 transitions.
[2023-11-19 07:58:49,703 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1281 transitions. Word has length 90
[2023-11-19 07:58:49,709 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:49,710 INFO L495 AbstractCegarLoop]: Abstraction has 1014 states and 1281 transitions.
[2023-11-19 07:58:49,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-19 07:58:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1281 transitions.
[2023-11-19 07:58:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2023-11-19 07:58:49,717 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:49,719 INFO L195 NwaCegarLoop]: trace histogram [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]
[2023-11-19 07:58:49,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:58:49,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:49,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1615869743, now seen corresponding path program 1 times
[2023-11-19 07:58:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:49,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856812206]
[2023-11-19 07:58:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:58:49,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:49,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856812206]
[2023-11-19 07:58:49,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856812206] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:49,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:49,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:58:49,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517192936]
[2023-11-19 07:58:49,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:49,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:49,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:49,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:49,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:49,850 INFO L87 Difference]: Start difference. First operand 1014 states and 1281 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-19 07:58:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:50,546 INFO L93 Difference]: Finished difference Result 2870 states and 3645 transitions.
[2023-11-19 07:58:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 91
[2023-11-19 07:58:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:50,565 INFO L225 Difference]: With dead ends: 2870
[2023-11-19 07:58:50,565 INFO L226 Difference]: Without dead ends: 1858
[2023-11-19 07:58:50,570 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-19 07:58:50,572 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 188 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:50,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 81 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2023-11-19 07:58:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states.
[2023-11-19 07:58:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858.
[2023-11-19 07:58:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.2245557350565428) internal successors, (2274), 1857 states have internal predecessors, (2274), 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-19 07:58:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2274 transitions.
[2023-11-19 07:58:50,636 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2274 transitions. Word has length 91
[2023-11-19 07:58:50,636 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:50,636 INFO L495 AbstractCegarLoop]: Abstraction has 1858 states and 2274 transitions.
[2023-11-19 07:58:50,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-19 07:58:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2274 transitions.
[2023-11-19 07:58:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2023-11-19 07:58:50,641 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:50,642 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]
[2023-11-19 07:58:50,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:58:50,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:50,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash -66969303, now seen corresponding path program 1 times
[2023-11-19 07:58:50,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:50,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123555966]
[2023-11-19 07:58:50,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:50,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-19 07:58:50,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:50,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123555966]
[2023-11-19 07:58:50,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123555966] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:50,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:58:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129782533]
[2023-11-19 07:58:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:50,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:50,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:50,893 INFO L87 Difference]: Start difference. First operand 1858 states and 2274 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-19 07:58:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:51,705 INFO L93 Difference]: Finished difference Result 4555 states and 5653 transitions.
[2023-11-19 07:58:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:51,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 108
[2023-11-19 07:58:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:51,731 INFO L225 Difference]: With dead ends: 4555
[2023-11-19 07:58:51,731 INFO L226 Difference]: Without dead ends: 2699
[2023-11-19 07:58:51,734 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-19 07:58:51,738 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 82 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:51,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 246 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2023-11-19 07:58:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states.
[2023-11-19 07:58:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2699.
[2023-11-19 07:58:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2698 states have (on average 1.1730911786508524) internal successors, (3165), 2698 states have internal predecessors, (3165), 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-19 07:58:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3165 transitions.
[2023-11-19 07:58:51,855 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3165 transitions. Word has length 108
[2023-11-19 07:58:51,855 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:51,856 INFO L495 AbstractCegarLoop]: Abstraction has 2699 states and 3165 transitions.
[2023-11-19 07:58:51,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-19 07:58:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3165 transitions.
[2023-11-19 07:58:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2023-11-19 07:58:51,861 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:51,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:58:51,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:58:51,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:51,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1685449902, now seen corresponding path program 1 times
[2023-11-19 07:58:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098422795]
[2023-11-19 07:58:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:58:52,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:52,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098422795]
[2023-11-19 07:58:52,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098422795] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:52,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:52,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:58:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877854418]
[2023-11-19 07:58:52,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:52,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:52,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:52,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:52,040 INFO L87 Difference]: Start difference. First operand 2699 states and 3165 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-19 07:58:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:52,737 INFO L93 Difference]: Finished difference Result 5818 states and 6787 transitions.
[2023-11-19 07:58:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:52,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2023-11-19 07:58:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:52,755 INFO L225 Difference]: With dead ends: 5818
[2023-11-19 07:58:52,756 INFO L226 Difference]: Without dead ends: 2559
[2023-11-19 07:58:52,760 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-19 07:58:52,762 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:52,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 61 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2023-11-19 07:58:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states.
[2023-11-19 07:58:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2557.
[2023-11-19 07:58:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.1165884194053208) internal successors, (2854), 2556 states have internal predecessors, (2854), 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-19 07:58:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 2854 transitions.
[2023-11-19 07:58:52,844 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 2854 transitions. Word has length 110
[2023-11-19 07:58:52,845 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:52,845 INFO L495 AbstractCegarLoop]: Abstraction has 2557 states and 2854 transitions.
[2023-11-19 07:58:52,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-19 07:58:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 2854 transitions.
[2023-11-19 07:58:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2023-11-19 07:58:52,851 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:52,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:58:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:58:52,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:52,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash -109920232, now seen corresponding path program 1 times
[2023-11-19 07:58:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730843989]
[2023-11-19 07:58:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2023-11-19 07:58:53,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:53,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730843989]
[2023-11-19 07:58:53,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730843989] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:53,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:53,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:58:53,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277642193]
[2023-11-19 07:58:53,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:53,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:53,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:53,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:53,034 INFO L87 Difference]: Start difference. First operand 2557 states and 2854 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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-19 07:58:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:53,357 INFO L93 Difference]: Finished difference Result 4534 states and 5065 transitions.
[2023-11-19 07:58:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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 124
[2023-11-19 07:58:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:53,371 INFO L225 Difference]: With dead ends: 4534
[2023-11-19 07:58:53,372 INFO L226 Difference]: Without dead ends: 1837
[2023-11-19 07:58:53,376 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-19 07:58:53,378 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:53,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 19 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2023-11-19 07:58:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states.
[2023-11-19 07:58:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837.
[2023-11-19 07:58:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.0648148148148149) internal successors, (1955), 1836 states have internal predecessors, (1955), 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-19 07:58:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 1955 transitions.
[2023-11-19 07:58:53,447 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 1955 transitions. Word has length 124
[2023-11-19 07:58:53,447 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:53,447 INFO L495 AbstractCegarLoop]: Abstraction has 1837 states and 1955 transitions.
[2023-11-19 07:58:53,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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-19 07:58:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 1955 transitions.
[2023-11-19 07:58:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2023-11-19 07:58:53,453 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:53,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2023-11-19 07:58:53,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:58:53,454 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:53,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:53,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1619560322, now seen corresponding path program 1 times
[2023-11-19 07:58:53,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:53,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036881170]
[2023-11-19 07:58:53,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:53,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 07:58:53,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:53,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036881170]
[2023-11-19 07:58:53,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036881170] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:53,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:58:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310485261]
[2023-11-19 07:58:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:53,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:53,620 INFO L87 Difference]: Start difference. First operand 1837 states and 1955 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-19 07:58:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:54,087 INFO L93 Difference]: Finished difference Result 3531 states and 3768 transitions.
[2023-11-19 07:58:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153
[2023-11-19 07:58:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:54,101 INFO L225 Difference]: With dead ends: 3531
[2023-11-19 07:58:54,102 INFO L226 Difference]: Without dead ends: 2116
[2023-11-19 07:58:54,104 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-19 07:58:54,105 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:54,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 31 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2023-11-19 07:58:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states.
[2023-11-19 07:58:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1976.
[2023-11-19 07:58:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 1.0622784810126582) internal successors, (2098), 1975 states have internal predecessors, (2098), 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-19 07:58:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2098 transitions.
[2023-11-19 07:58:54,168 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2098 transitions. Word has length 153
[2023-11-19 07:58:54,169 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:54,169 INFO L495 AbstractCegarLoop]: Abstraction has 1976 states and 2098 transitions.
[2023-11-19 07:58:54,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-19 07:58:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2098 transitions.
[2023-11-19 07:58:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2023-11-19 07:58:54,175 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:54,175 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2023-11-19 07:58:54,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:58:54,176 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:54,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1477057216, now seen corresponding path program 1 times
[2023-11-19 07:58:54,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:54,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755300932]
[2023-11-19 07:58:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:58:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-11-19 07:58:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:58:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755300932]
[2023-11-19 07:58:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755300932] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:58:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:58:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:58:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595177181]
[2023-11-19 07:58:54,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:58:54,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:58:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:58:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:58:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:58:54,364 INFO L87 Difference]: Start difference. First operand 1976 states and 2098 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-19 07:58:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:58:54,863 INFO L93 Difference]: Finished difference Result 3670 states and 3908 transitions.
[2023-11-19 07:58:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:58:54,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 168
[2023-11-19 07:58:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:58:54,877 INFO L225 Difference]: With dead ends: 3670
[2023-11-19 07:58:54,877 INFO L226 Difference]: Without dead ends: 1416
[2023-11-19 07:58:54,880 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-19 07:58:54,882 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 95 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2023-11-19 07:58:54,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 207 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2023-11-19 07:58:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states.
[2023-11-19 07:58:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416.
[2023-11-19 07:58:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.0494699646643109) internal successors, (1485), 1415 states have internal predecessors, (1485), 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-19 07:58:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1485 transitions.
[2023-11-19 07:58:54,942 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1485 transitions. Word has length 168
[2023-11-19 07:58:54,942 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:58:54,943 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 1485 transitions.
[2023-11-19 07:58:54,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-19 07:58:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1485 transitions.
[2023-11-19 07:58:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2023-11-19 07:58:54,948 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:58:54,949 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:58:54,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:58:54,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:58:54,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:58:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1167918892, now seen corresponding path program 1 times
[2023-11-19 07:58:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:58:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501096032]
[2023-11-19 07:58:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:58:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:58:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:58:55,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:58:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:58:55,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:58:55,188 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:58:55,189 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-19 07:58:55,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:58:55,195 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:58:55,201 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:58:55,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:58:55 BoogieIcfgContainer
[2023-11-19 07:58:55,387 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:58:55,388 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:58:55,388 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:58:55,389 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:58:55,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:44" (3/4) ...
[2023-11-19 07:58:55,391 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-19 07:58:55,573 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:58:55,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:58:55,574 INFO L158 Benchmark]: Toolchain (without parser) took 13590.61ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 148.6MB in the beginning and 88.0MB in the end (delta: 60.6MB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB.
[2023-11-19 07:58:55,575 INFO L158 Benchmark]: CDTParser took 15.36ms. Allocated memory is still 132.1MB. Free memory is still 106.3MB. Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:58:55,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 859.31ms. Allocated memory is still 178.3MB. Free memory was 148.4MB in the beginning and 123.2MB in the end (delta: 25.2MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB.
[2023-11-19 07:58:55,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.09ms. Allocated memory is still 178.3MB. Free memory was 123.2MB in the beginning and 117.7MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-19 07:58:55,576 INFO L158 Benchmark]: Boogie Preprocessor took 146.32ms. Allocated memory is still 178.3MB. Free memory was 117.7MB in the beginning and 112.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2023-11-19 07:58:55,576 INFO L158 Benchmark]: RCFGBuilder took 1843.89ms. Allocated memory is still 178.3MB. Free memory was 112.7MB in the beginning and 80.8MB in the end (delta: 31.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2023-11-19 07:58:55,577 INFO L158 Benchmark]: TraceAbstraction took 10429.51ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 79.8MB in the beginning and 104.8MB in the end (delta: -25.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB.
[2023-11-19 07:58:55,578 INFO L158 Benchmark]: Witness Printer took 185.40ms. Allocated memory is still 257.9MB. Free memory was 104.8MB in the beginning and 88.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2023-11-19 07:58:55,580 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 15.36ms. Allocated memory is still 132.1MB. Free memory is still 106.3MB. Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 859.31ms. Allocated memory is still 178.3MB. Free memory was 148.4MB in the beginning and 123.2MB in the end (delta: 25.2MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 116.09ms. Allocated memory is still 178.3MB. Free memory was 123.2MB in the beginning and 117.7MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 146.32ms. Allocated memory is still 178.3MB. Free memory was 117.7MB in the beginning and 112.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* RCFGBuilder took 1843.89ms. Allocated memory is still 178.3MB. Free memory was 112.7MB in the beginning and 80.8MB in the end (delta: 31.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 10429.51ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 79.8MB in the beginning and 104.8MB in the end (delta: -25.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB.
* Witness Printer took 185.40ms. Allocated memory is still 257.9MB. Free memory was 104.8MB in the beginning and 88.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 425]: 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, 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)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))
[L245] a28 = 9
[L246] return 23;
VAL [\old(input)=4, \result=23, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, 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=0, a28=9, a=1, c=3, d=4, e=5, f=6, output=23, 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)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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 TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))
[L405] a19 = 0
[L406] a28 = 7
[L407] return 25;
VAL [\old(input)=3, \result=25, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[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=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, output=25, 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=0, 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=0, 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=0, 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=0, 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=0, 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 FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
VAL [\old(input)=1, a11=0, a17=8, a19=0, 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]
[L64] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))
[L65] a28 = 7
[L66] a11 = 1
[L67] a25 = 0
[L68] return -1;
VAL [\old(input)=1, \result=-1, a11=1, a17=8, a19=0, 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]
[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=8, a19=0, 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] 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)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1))))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1))))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1)))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1))))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1))))))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1)))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9)))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8)))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11)))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1)))))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L424] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L425] reach_error()
VAL [\old(input)=6, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=6, 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: 10.1s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1177 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1177 mSDsluCounter, 1161 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3052 IncrementalHoareTripleChecker+Invalid, 3632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 580 mSolverCounterUnsat, 1036 mSDtfsCounter, 3052 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2699occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 298 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 1820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 394/394 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-19 07:58:55,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36fc56a-e106-4948-bc69-ed548ca2af3e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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