./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC --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 bd7bfdc90ad274b856f062dcd9b414cf1c7c524311f5a91ee1cc532e8e6a452d
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-23 23:13:25,372 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-23 23:13:25,432 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-23 23:13:25,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-23 23:13:25,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-23 23:13:25,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-23 23:13:25,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-23 23:13:25,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-23 23:13:25,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-23 23:13:25,462 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-23 23:13:25,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-23 23:13:25,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-23 23:13:25,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-23 23:13:25,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-23 23:13:25,463 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-23 23:13:25,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-23 23:13:25,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-23 23:13:25,464 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-23 23:13:25,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-23 23:13:25,464 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-23 23:13:25,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-23 23:13:25,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-23 23:13:25,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-23 23:13:25,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-23 23:13:25,465 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-23 23:13:25,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-23 23:13:25,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-23 23:13:25,465 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-23 23:13:25,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-23 23:13:25,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-23 23:13:25,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-23 23:13:25,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-23 23:13:25,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-23 23:13:25,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-23 23:13:25,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-23 23:13:25,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-23 23:13:25,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-23 23:13:25,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-23 23:13:25,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-23 23:13:25,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-23 23:13:25,467 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-23 23:13:25,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-23 23:13:25,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-23 23:13:25,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-23 23:13:25,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-23 23:13:25,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-23 23:13:25,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-23 23:13:25,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-23 23:13:25,468 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC
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 -> bd7bfdc90ad274b856f062dcd9b414cf1c7c524311f5a91ee1cc532e8e6a452d
[2024-11-23 23:13:25,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-23 23:13:25,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-23 23:13:25,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-23 23:13:25,736 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-23 23:13:25,737 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-23 23:13:25,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/eca-rers2012/Problem02_label45.c
[2024-11-23 23:13:28,784 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/data/ad49c9581/2c1a452296524b4d80f4b954940e5c96/FLAGcf18942ca
[2024-11-23 23:13:29,132 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-23 23:13:29,132 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/sv-benchmarks/c/eca-rers2012/Problem02_label45.c
[2024-11-23 23:13:29,144 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/data/ad49c9581/2c1a452296524b4d80f4b954940e5c96/FLAGcf18942ca
[2024-11-23 23:13:29,351 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/data/ad49c9581/2c1a452296524b4d80f4b954940e5c96
[2024-11-23 23:13:29,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-23 23:13:29,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-23 23:13:29,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-23 23:13:29,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-23 23:13:29,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-23 23:13:29,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:29,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b313878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29, skipping insertion in model container
[2024-11-23 23:13:29,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:29,415 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-23 23:13:29,702 WARN L250 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_66a2bf55-6d20-4384-88bf-061518c326a6/sv-benchmarks/c/eca-rers2012/Problem02_label45.c[14744,14757]
[2024-11-23 23:13:29,743 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-23 23:13:29,752 INFO L200 MainTranslator]: Completed pre-run
[2024-11-23 23:13:29,821 WARN L250 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_66a2bf55-6d20-4384-88bf-061518c326a6/sv-benchmarks/c/eca-rers2012/Problem02_label45.c[14744,14757]
[2024-11-23 23:13:29,850 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-23 23:13:29,871 INFO L204 MainTranslator]: Completed translation
[2024-11-23 23:13:29,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29 WrapperNode
[2024-11-23 23:13:29,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-23 23:13:29,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-23 23:13:29,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-23 23:13:29,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-23 23:13:29,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:29,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:29,951 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668
[2024-11-23 23:13:29,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-23 23:13:29,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-23 23:13:29,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-23 23:13:29,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-23 23:13:29,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:29,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:29,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,004 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-23 23:13:30,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-23 23:13:30,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-23 23:13:30,060 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-23 23:13:30,062 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-23 23:13:30,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (1/1) ...
[2024-11-23 23:13:30,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-23 23:13:30,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-23 23:13:30,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-23 23:13:30,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-23 23:13:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-23 23:13:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-23 23:13:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-23 23:13:30,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-23 23:13:30,196 INFO L234 CfgBuilder]: Building ICFG
[2024-11-23 23:13:30,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-23 23:13:31,469 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2024-11-23 23:13:31,470 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-23 23:13:31,490 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-23 23:13:31,493 INFO L312 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-23 23:13:31,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:31 BoogieIcfgContainer
[2024-11-23 23:13:31,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-23 23:13:31,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-23 23:13:31,496 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-23 23:13:31,504 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-23 23:13:31,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:13:29" (1/3) ...
[2024-11-23 23:13:31,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4310aa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:13:31, skipping insertion in model container
[2024-11-23 23:13:31,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:13:29" (2/3) ...
[2024-11-23 23:13:31,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4310aa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:13:31, skipping insertion in model container
[2024-11-23 23:13:31,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:31" (3/3) ...
[2024-11-23 23:13:31,507 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label45.c
[2024-11-23 23:13:31,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-23 23:13:31,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label45.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2024-11-23 23:13:31,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-23 23:13:31,639 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@bf58225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-23 23:13:31,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-23 23:13:31,646 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)
[2024-11-23 23:13:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2024-11-23 23:13:31,656 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:31,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 23:13:31,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:31,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -578138675, now seen corresponding path program 1 times
[2024-11-23 23:13:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:31,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307558381]
[2024-11-23 23:13:31,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 23:13:32,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307558381]
[2024-11-23 23:13:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307558381] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-23 23:13:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030070859]
[2024-11-23 23:13:32,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:32,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:32,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:32,364 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.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:33,326 INFO L93 Difference]: Finished difference Result 639 states and 1082 transitions.
[2024-11-23 23:13:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 82
[2024-11-23 23:13:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:33,343 INFO L225 Difference]: With dead ends: 639
[2024-11-23 23:13:33,344 INFO L226 Difference]: Without dead ends: 318
[2024-11-23 23:13:33,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:33,355 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 127 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:33,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 136 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-23 23:13:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2024-11-23 23:13:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313.
[2024-11-23 23:13:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4711538461538463) internal successors, (459), 312 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 459 transitions.
[2024-11-23 23:13:33,422 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 459 transitions. Word has length 82
[2024-11-23 23:13:33,423 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:33,423 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 459 transitions.
[2024-11-23 23:13:33,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 459 transitions.
[2024-11-23 23:13:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-23 23:13:33,429 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:33,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 23:13:33,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-23 23:13:33,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:33,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:33,430 INFO L85 PathProgramCache]: Analyzing trace with hash -32610184, now seen corresponding path program 1 times
[2024-11-23 23:13:33,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:33,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983661638]
[2024-11-23 23:13:33,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 23:13:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983661638]
[2024-11-23 23:13:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983661638] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 23:13:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396215020]
[2024-11-23 23:13:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:33,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:33,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:33,749 INFO L87 Difference]: Start difference. First operand 313 states and 459 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:34,364 INFO L93 Difference]: Finished difference Result 909 states and 1337 transitions.
[2024-11-23 23:13:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86
[2024-11-23 23:13:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:34,368 INFO L225 Difference]: With dead ends: 909
[2024-11-23 23:13:34,368 INFO L226 Difference]: Without dead ends: 598
[2024-11-23 23:13:34,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:34,369 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:34,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 77 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-23 23:13:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states.
[2024-11-23 23:13:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598.
[2024-11-23 23:13:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4036850921273032) internal successors, (838), 597 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 838 transitions.
[2024-11-23 23:13:34,395 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 838 transitions. Word has length 86
[2024-11-23 23:13:34,395 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:34,395 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 838 transitions.
[2024-11-23 23:13:34,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 838 transitions.
[2024-11-23 23:13:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-23 23:13:34,407 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:34,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 23:13:34,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-23 23:13:34,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:34,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1625501619, now seen corresponding path program 1 times
[2024-11-23 23:13:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:34,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199290371]
[2024-11-23 23:13:34,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 23:13:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:34,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199290371]
[2024-11-23 23:13:34,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199290371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 23:13:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997164603]
[2024-11-23 23:13:34,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:34,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:34,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:34,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:34,519 INFO L87 Difference]: Start difference. First operand 598 states and 838 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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)
[2024-11-23 23:13:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:35,048 INFO L93 Difference]: Finished difference Result 1193 states and 1675 transitions.
[2024-11-23 23:13:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:35,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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
[2024-11-23 23:13:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:35,053 INFO L225 Difference]: With dead ends: 1193
[2024-11-23 23:13:35,055 INFO L226 Difference]: Without dead ends: 597
[2024-11-23 23:13:35,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:35,057 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 163 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:35,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 288 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-23 23:13:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states.
[2024-11-23 23:13:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 592.
[2024-11-23 23:13:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.3248730964467006) internal successors, (783), 591 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 783 transitions.
[2024-11-23 23:13:35,080 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 783 transitions. Word has length 91
[2024-11-23 23:13:35,080 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:35,080 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 783 transitions.
[2024-11-23 23:13:35,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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)
[2024-11-23 23:13:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 783 transitions.
[2024-11-23 23:13:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-23 23:13:35,083 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:35,083 INFO L218 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, 1]
[2024-11-23 23:13:35,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-23 23:13:35,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:35,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash 321908750, now seen corresponding path program 1 times
[2024-11-23 23:13:35,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:35,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995382823]
[2024-11-23 23:13:35,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:35,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 23:13:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995382823]
[2024-11-23 23:13:35,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995382823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:35,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:35,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 23:13:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852185811]
[2024-11-23 23:13:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:35,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:35,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:35,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:35,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:35,251 INFO L87 Difference]: Start difference. First operand 592 states and 783 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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)
[2024-11-23 23:13:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:35,808 INFO L93 Difference]: Finished difference Result 1742 states and 2310 transitions.
[2024-11-23 23:13:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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
[2024-11-23 23:13:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:35,814 INFO L225 Difference]: With dead ends: 1742
[2024-11-23 23:13:35,814 INFO L226 Difference]: Without dead ends: 1152
[2024-11-23 23:13:35,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:35,816 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:35,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 64 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-23 23:13:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states.
[2024-11-23 23:13:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152.
[2024-11-23 23:13:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.2823631624674197) internal successors, (1476), 1151 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1476 transitions.
[2024-11-23 23:13:35,854 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1476 transitions. Word has length 91
[2024-11-23 23:13:35,854 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:35,855 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1476 transitions.
[2024-11-23 23:13:35,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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)
[2024-11-23 23:13:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1476 transitions.
[2024-11-23 23:13:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-23 23:13:35,859 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:35,859 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1]
[2024-11-23 23:13:35,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-23 23:13:35,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1346928599, now seen corresponding path program 1 times
[2024-11-23 23:13:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:35,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871843042]
[2024-11-23 23:13:35,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 23:13:36,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871843042]
[2024-11-23 23:13:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871843042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:36,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:36,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-23 23:13:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122517672]
[2024-11-23 23:13:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:36,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:36,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:36,038 INFO L87 Difference]: Start difference. First operand 1152 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:36,625 INFO L93 Difference]: Finished difference Result 3281 states and 4199 transitions.
[2024-11-23 23:13:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102
[2024-11-23 23:13:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:36,632 INFO L225 Difference]: With dead ends: 3281
[2024-11-23 23:13:36,632 INFO L226 Difference]: Without dead ends: 2131
[2024-11-23 23:13:36,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:36,638 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 176 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:36,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 77 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-23 23:13:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states.
[2024-11-23 23:13:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2131.
[2024-11-23 23:13:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 2130 states have (on average 1.2178403755868545) internal successors, (2594), 2130 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2594 transitions.
[2024-11-23 23:13:36,699 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2594 transitions. Word has length 102
[2024-11-23 23:13:36,699 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:36,699 INFO L471 AbstractCegarLoop]: Abstraction has 2131 states and 2594 transitions.
[2024-11-23 23:13:36,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2594 transitions.
[2024-11-23 23:13:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-23 23:13:36,704 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:36,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-23 23:13:36,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-23 23:13:36,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:36,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1362794175, now seen corresponding path program 1 times
[2024-11-23 23:13:36,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:36,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520741863]
[2024-11-23 23:13:36,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:36,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2024-11-23 23:13:36,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520741863]
[2024-11-23 23:13:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520741863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-23 23:13:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333712927]
[2024-11-23 23:13:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:36,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:36,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:36,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:36,884 INFO L87 Difference]: Start difference. First operand 2131 states and 2594 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:37,200 INFO L93 Difference]: Finished difference Result 4109 states and 4989 transitions.
[2024-11-23 23:13:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:37,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 125
[2024-11-23 23:13:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:37,208 INFO L225 Difference]: With dead ends: 4109
[2024-11-23 23:13:37,208 INFO L226 Difference]: Without dead ends: 1980
[2024-11-23 23:13:37,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:37,214 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:37,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 20 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-23 23:13:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states.
[2024-11-23 23:13:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1280.
[2024-11-23 23:13:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.178264268960125) internal successors, (1507), 1279 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1507 transitions.
[2024-11-23 23:13:37,257 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1507 transitions. Word has length 125
[2024-11-23 23:13:37,257 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:37,257 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1507 transitions.
[2024-11-23 23:13:37,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1507 transitions.
[2024-11-23 23:13:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2024-11-23 23:13:37,264 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:37,264 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 23:13:37,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-23 23:13:37,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:37,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1202705131, now seen corresponding path program 1 times
[2024-11-23 23:13:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979473377]
[2024-11-23 23:13:37,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-23 23:13:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979473377]
[2024-11-23 23:13:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979473377] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:37,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 23:13:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627559111]
[2024-11-23 23:13:37,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:37,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:37,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:37,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:37,475 INFO L87 Difference]: Start difference. First operand 1280 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:37,977 INFO L93 Difference]: Finished difference Result 2976 states and 3495 transitions.
[2024-11-23 23:13:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:37,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 129
[2024-11-23 23:13:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:37,982 INFO L225 Difference]: With dead ends: 2976
[2024-11-23 23:13:37,982 INFO L226 Difference]: Without dead ends: 995
[2024-11-23 23:13:37,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:37,987 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 122 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:37,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 239 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-23 23:13:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states.
[2024-11-23 23:13:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995.
[2024-11-23 23:13:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.1448692152917506) internal successors, (1138), 994 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1138 transitions.
[2024-11-23 23:13:38,012 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1138 transitions. Word has length 129
[2024-11-23 23:13:38,012 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:38,013 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1138 transitions.
[2024-11-23 23:13:38,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1138 transitions.
[2024-11-23 23:13:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2024-11-23 23:13:38,016 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:38,016 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-23 23:13:38,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-23 23:13:38,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:38,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1550656378, now seen corresponding path program 1 times
[2024-11-23 23:13:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236482062]
[2024-11-23 23:13:38,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-23 23:13:38,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236482062]
[2024-11-23 23:13:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236482062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:38,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:38,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 23:13:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330120084]
[2024-11-23 23:13:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:38,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:38,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:38,159 INFO L87 Difference]: Start difference. First operand 995 states and 1138 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:38,612 INFO L93 Difference]: Finished difference Result 2126 states and 2430 transitions.
[2024-11-23 23:13:38,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:38,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 131
[2024-11-23 23:13:38,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:38,616 INFO L225 Difference]: With dead ends: 2126
[2024-11-23 23:13:38,616 INFO L226 Difference]: Without dead ends: 1133
[2024-11-23 23:13:38,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:38,618 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:38,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 23 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-23 23:13:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states.
[2024-11-23 23:13:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133.
[2024-11-23 23:13:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1132 states have (on average 1.1289752650176679) internal successors, (1278), 1132 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1278 transitions.
[2024-11-23 23:13:38,642 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1278 transitions. Word has length 131
[2024-11-23 23:13:38,642 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:38,643 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1278 transitions.
[2024-11-23 23:13:38,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1278 transitions.
[2024-11-23 23:13:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-23 23:13:38,645 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:38,645 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 23:13:38,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-23 23:13:38,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:38,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1748597166, now seen corresponding path program 1 times
[2024-11-23 23:13:38,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:38,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626600868]
[2024-11-23 23:13:38,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:38,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-23 23:13:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:38,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626600868]
[2024-11-23 23:13:38,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626600868] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:38,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:38,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 23:13:38,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399701526]
[2024-11-23 23:13:38,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:38,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:38,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:38,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:38,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:38,784 INFO L87 Difference]: Start difference. First operand 1133 states and 1278 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:39,247 INFO L93 Difference]: Finished difference Result 2685 states and 3024 transitions.
[2024-11-23 23:13:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:39,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 138
[2024-11-23 23:13:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:39,253 INFO L225 Difference]: With dead ends: 2685
[2024-11-23 23:13:39,254 INFO L226 Difference]: Without dead ends: 1554
[2024-11-23 23:13:39,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:39,256 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 126 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:39,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 195 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-23 23:13:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states.
[2024-11-23 23:13:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1553.
[2024-11-23 23:13:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1552 states have (on average 1.094716494845361) internal successors, (1699), 1552 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1699 transitions.
[2024-11-23 23:13:39,287 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1699 transitions. Word has length 138
[2024-11-23 23:13:39,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:39,287 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 1699 transitions.
[2024-11-23 23:13:39,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1699 transitions.
[2024-11-23 23:13:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2024-11-23 23:13:39,291 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:39,291 INFO L218 NwaCegarLoop]: trace histogram [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, 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]
[2024-11-23 23:13:39,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-23 23:13:39,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:39,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash -903589753, now seen corresponding path program 1 times
[2024-11-23 23:13:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262923612]
[2024-11-23 23:13:39,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-23 23:13:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:39,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262923612]
[2024-11-23 23:13:39,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262923612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:39,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:39,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-23 23:13:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345502512]
[2024-11-23 23:13:39,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:39,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:39,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:39,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:39,497 INFO L87 Difference]: Start difference. First operand 1553 states and 1699 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:39,957 INFO L93 Difference]: Finished difference Result 3245 states and 3558 transitions.
[2024-11-23 23:13:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:39,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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 175
[2024-11-23 23:13:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:39,965 INFO L225 Difference]: With dead ends: 3245
[2024-11-23 23:13:39,965 INFO L226 Difference]: Without dead ends: 1692
[2024-11-23 23:13:39,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:39,968 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 71 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:39,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 65 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-23 23:13:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states.
[2024-11-23 23:13:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1691.
[2024-11-23 23:13:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1690 states have (on average 1.0834319526627219) internal successors, (1831), 1690 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 1831 transitions.
[2024-11-23 23:13:40,019 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 1831 transitions. Word has length 175
[2024-11-23 23:13:40,019 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:40,019 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 1831 transitions.
[2024-11-23 23:13:40,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 1831 transitions.
[2024-11-23 23:13:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188
[2024-11-23 23:13:40,024 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:40,026 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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]
[2024-11-23 23:13:40,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-23 23:13:40,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:40,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1138263687, now seen corresponding path program 1 times
[2024-11-23 23:13:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467108731]
[2024-11-23 23:13:40,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 23:13:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-23 23:13:40,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 23:13:40,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467108731]
[2024-11-23 23:13:40,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467108731] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 23:13:40,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 23:13:40,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 23:13:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328459938]
[2024-11-23 23:13:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 23:13:40,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-23 23:13:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 23:13:40,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 23:13:40,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:40,245 INFO L87 Difference]: Start difference. First operand 1691 states and 1831 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 23:13:40,673 INFO L93 Difference]: Finished difference Result 3240 states and 3515 transitions.
[2024-11-23 23:13:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-23 23:13:40,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 187
[2024-11-23 23:13:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-23 23:13:40,677 INFO L225 Difference]: With dead ends: 3240
[2024-11-23 23:13:40,677 INFO L226 Difference]: Without dead ends: 1268
[2024-11-23 23:13:40,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 23:13:40,679 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 82 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-23 23:13:40,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 190 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-23 23:13:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states.
[2024-11-23 23:13:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1268.
[2024-11-23 23:13:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 1.0402525651144436) internal successors, (1318), 1267 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1318 transitions.
[2024-11-23 23:13:40,703 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1318 transitions. Word has length 187
[2024-11-23 23:13:40,703 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-23 23:13:40,703 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1318 transitions.
[2024-11-23 23:13:40,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 23:13:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1318 transitions.
[2024-11-23 23:13:40,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2024-11-23 23:13:40,707 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-23 23:13:40,707 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2024-11-23 23:13:40,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-23 23:13:40,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-23 23:13:40,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 23:13:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1000259223, now seen corresponding path program 1 times
[2024-11-23 23:13:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 23:13:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77088741]
[2024-11-23 23:13:40,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 23:13:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 23:13:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 23:13:40,767 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-23 23:13:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 23:13:40,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-23 23:13:40,949 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-23 23:13:40,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-23 23:13:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-23 23:13:40,962 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 23:13:41,139 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-23 23:13:41,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:13:41 BoogieIcfgContainer
[2024-11-23 23:13:41,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-23 23:13:41,146 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-23 23:13:41,146 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-23 23:13:41,146 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-23 23:13:41,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:13:31" (3/4) ...
[2024-11-23 23:13:41,148 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-23 23:13:41,362 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 227.
[2024-11-23 23:13:41,569 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/witness.graphml
[2024-11-23 23:13:41,569 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/witness.yml
[2024-11-23 23:13:41,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-23 23:13:41,570 INFO L158 Benchmark]: Toolchain (without parser) took 12215.43ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 91.2MB in the beginning and 86.0MB in the end (delta: 5.2MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB.
[2024-11-23 23:13:41,573 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-23 23:13:41,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.98ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 65.6MB in the end (delta: 25.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-23 23:13:41,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.44ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 60.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-23 23:13:41,573 INFO L158 Benchmark]: Boogie Preprocessor took 103.25ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 55.2MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-23 23:13:41,574 INFO L158 Benchmark]: RCFGBuilder took 1434.48ms. Allocated memory is still 117.4MB. Free memory was 55.2MB in the beginning and 76.8MB in the end (delta: -21.6MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB.
[2024-11-23 23:13:41,574 INFO L158 Benchmark]: TraceAbstraction took 9648.84ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 76.1MB in the beginning and 121.3MB in the end (delta: -45.2MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB.
[2024-11-23 23:13:41,574 INFO L158 Benchmark]: Witness Printer took 423.43ms. Allocated memory is still 176.2MB. Free memory was 121.3MB in the beginning and 86.0MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-11-23 23:13:41,575 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 515.98ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 65.6MB in the end (delta: 25.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 82.44ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 60.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 103.25ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 55.2MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 1434.48ms. Allocated memory is still 117.4MB. Free memory was 55.2MB in the beginning and 76.8MB in the end (delta: -21.6MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 9648.84ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 76.1MB in the beginning and 121.3MB in the end (delta: -45.2MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB.
* Witness Printer took 423.43ms. Allocated memory is still 176.2MB. Free memory was 121.3MB in the beginning and 86.0MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. 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: 428]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L17] int a= 1;
[L18] int e= 5;
[L19] int d= 4;
[L20] int f= 6;
[L21] int c= 3;
[L24] int u = 21;
[L25] int v = 22;
[L26] int w = 23;
[L27] int x = 24;
[L28] int y = 25;
[L29] int z = 26;
[L32] int a25 = 0;
[L33] int a11 = 0;
[L34] int a28 = 7;
[L35] int a19 = 1;
[L36] int a21 = 1;
[L37] int a17 = 8;
VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L613] int output = -1;
VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L619] int input;
[L620] input = __VERIFIER_nondet_int()
[L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624] CALL, EXPR calculate_output(input)
[L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [\result=23, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L624] RET, EXPR calculate_output(input)
[L624] output = calculate_output(input)
[L619] int input;
[L620] input = __VERIFIER_nondet_int()
[L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624] CALL, EXPR calculate_output(input)
[L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [\result=25, a11=0, a17=8, a19=0, 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]
[L624] RET, EXPR calculate_output(input)
[L624] output = calculate_output(input)
[L619] int input;
[L620] input = __VERIFIER_nondet_int()
[L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624] CALL, EXPR calculate_output(input)
[L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
VAL [a11=0, a17=8, a19=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]
[L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
VAL [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]
[L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
VAL [a11=0, a17=8, a19=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]
[L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
VAL [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]
[L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
VAL [a11=0, a17=8, a19=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]
[L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
VAL [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]
[L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
VAL [a11=0, a17=8, a19=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]
[L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
VAL [a11=0, a17=8, a19=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]
[L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
VAL [a11=0, a17=8, a19=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]
[L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
VAL [a11=0, a17=8, a19=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]
[L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
VAL [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]
[L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
VAL [a11=0, a17=8, a19=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]
[L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
VAL [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]
[L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
VAL [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]
[L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
VAL [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]
[L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
VAL [a11=0, a17=8, a19=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]
[L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
VAL [a11=0, a17=8, a19=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]
[L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
VAL [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]
[L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
VAL [a11=0, a17=8, a19=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]
[L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
VAL [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]
[L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
VAL [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]
[L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
VAL [a11=0, a17=8, a19=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]
[L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
VAL [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]
[L158] COND TRUE ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))
[L159] a11 = 1
[L160] a19 = 1
[L161] a28 = 10
[L162] a25 = 1
[L163] return -1;
VAL [\result=-1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L624] RET, EXPR calculate_output(input)
[L624] output = calculate_output(input)
[L619] int input;
[L620] input = __VERIFIER_nondet_int()
[L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L624] CALL calculate_output(input)
[L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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 FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1)))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1))))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1))))))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1)))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9)))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11)))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1)))))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L427] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L428] reach_error()
VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1410 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1410 mSDsluCounter, 1374 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 621 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3711 IncrementalHoareTripleChecker+Invalid, 4332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 621 mSolverCounterUnsat, 1236 mSDtfsCounter, 3711 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2131occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 712 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1566 NumberOfCodeBlocks, 1566 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1326 ConstructedInterpolants, 0 QuantifiedInterpolants, 2426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 595/595 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-23 23:13:41,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a2bf55-6d20-4384-88bf-061518c326a6/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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