./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label58_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem10_label58_false-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edc318da5f2cd799dc236b61cf9204b26fd846e6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 23:24:55,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 23:24:55,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 23:24:55,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 23:24:55,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 23:24:55,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 23:24:55,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 23:24:55,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 23:24:55,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 23:24:55,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 23:24:55,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 23:24:55,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 23:24:55,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 23:24:55,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 23:24:55,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 23:24:55,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 23:24:55,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 23:24:55,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 23:24:55,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 23:24:55,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 23:24:55,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 23:24:55,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 23:24:55,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 23:24:55,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 23:24:55,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 23:24:55,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 23:24:55,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 23:24:55,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 23:24:55,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 23:24:55,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 23:24:55,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 23:24:55,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 23:24:55,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 23:24:55,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 23:24:55,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 23:24:55,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 23:24:55,082 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 23:24:55,112 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 23:24:55,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 23:24:55,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 23:24:55,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 23:24:55,115 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 23:24:55,120 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 23:24:55,120 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 23:24:55,120 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 23:24:55,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 23:24:55,121 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 23:24:55,121 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 23:24:55,122 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 23:24:55,122 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 23:24:55,122 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 23:24:55,122 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 23:24:55,122 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 23:24:55,122 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 23:24:55,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 23:24:55,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 23:24:55,125 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 23:24:55,125 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 23:24:55,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 23:24:55,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 23:24:55,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 23:24:55,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 23:24:55,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 23:24:55,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 23:24:55,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 23:24:55,127 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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(__VERIFIER_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 -> edc318da5f2cd799dc236b61cf9204b26fd846e6 [2019-01-11 23:24:55,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 23:24:55,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 23:24:55,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 23:24:55,211 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 23:24:55,212 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 23:24:55,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label58_false-unreach-call.c [2019-01-11 23:24:55,262 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1101aaf5/696cf8d29a3a45268bab82172ed67c5f/FLAG8e24f1911 [2019-01-11 23:24:55,888 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 23:24:55,889 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label58_false-unreach-call.c [2019-01-11 23:24:55,905 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1101aaf5/696cf8d29a3a45268bab82172ed67c5f/FLAG8e24f1911 [2019-01-11 23:24:56,118 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1101aaf5/696cf8d29a3a45268bab82172ed67c5f [2019-01-11 23:24:56,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 23:24:56,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 23:24:56,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 23:24:56,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 23:24:56,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 23:24:56,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:56,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd106d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56, skipping insertion in model container [2019-01-11 23:24:56,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:56,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 23:24:56,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 23:24:56,724 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 23:24:56,733 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 23:24:56,858 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 23:24:56,968 INFO L195 MainTranslator]: Completed translation [2019-01-11 23:24:56,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56 WrapperNode [2019-01-11 23:24:56,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 23:24:56,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 23:24:56,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 23:24:56,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 23:24:56,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:56,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:57,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 23:24:57,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 23:24:57,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 23:24:57,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 23:24:57,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:57,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:57,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:57,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:57,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:57,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:57,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... [2019-01-11 23:24:57,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 23:24:57,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 23:24:57,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 23:24:57,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 23:24:57,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 23:24:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 23:24:57,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 23:25:00,214 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 23:25:00,214 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 23:25:00,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:25:00 BoogieIcfgContainer [2019-01-11 23:25:00,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 23:25:00,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 23:25:00,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 23:25:00,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 23:25:00,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 11:24:56" (1/3) ... [2019-01-11 23:25:00,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725ad7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:25:00, skipping insertion in model container [2019-01-11 23:25:00,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 11:24:56" (2/3) ... [2019-01-11 23:25:00,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725ad7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:25:00, skipping insertion in model container [2019-01-11 23:25:00,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:25:00" (3/3) ... [2019-01-11 23:25:00,224 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label58_false-unreach-call.c [2019-01-11 23:25:00,232 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 23:25:00,240 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 23:25:00,256 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 23:25:00,289 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 23:25:00,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 23:25:00,290 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 23:25:00,290 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 23:25:00,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 23:25:00,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 23:25:00,290 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 23:25:00,291 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 23:25:00,291 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 23:25:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-11 23:25:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 23:25:00,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:00,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:00,322 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:00,329 INFO L82 PathProgramCache]: Analyzing trace with hash -461255479, now seen corresponding path program 1 times [2019-01-11 23:25:00,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:00,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:00,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 23:25:00,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 23:25:00,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 23:25:00,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 23:25:00,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 23:25:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 23:25:00,598 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-11 23:25:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:03,455 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-01-11 23:25:03,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 23:25:03,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-11 23:25:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:03,477 INFO L225 Difference]: With dead ends: 694 [2019-01-11 23:25:03,477 INFO L226 Difference]: Without dead ends: 421 [2019-01-11 23:25:03,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 23:25:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-11 23:25:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-01-11 23:25:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-11 23:25:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-01-11 23:25:03,546 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 13 [2019-01-11 23:25:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:03,547 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-01-11 23:25:03,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 23:25:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-01-11 23:25:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 23:25:03,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:03,551 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:03,551 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1757812319, now seen corresponding path program 1 times [2019-01-11 23:25:03,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:03,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:03,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:03,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 23:25:03,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 23:25:03,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 23:25:03,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 23:25:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 23:25:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 23:25:03,900 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-01-11 23:25:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:05,245 INFO L93 Difference]: Finished difference Result 840 states and 1290 transitions. [2019-01-11 23:25:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 23:25:05,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-01-11 23:25:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:05,252 INFO L225 Difference]: With dead ends: 840 [2019-01-11 23:25:05,252 INFO L226 Difference]: Without dead ends: 560 [2019-01-11 23:25:05,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 23:25:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-01-11 23:25:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2019-01-11 23:25:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-11 23:25:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2019-01-11 23:25:05,281 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 82 [2019-01-11 23:25:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:05,283 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2019-01-11 23:25:05,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 23:25:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2019-01-11 23:25:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-11 23:25:05,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:05,287 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:05,287 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1580554992, now seen corresponding path program 1 times [2019-01-11 23:25:05,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:05,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:05,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:05,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 23:25:05,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 23:25:05,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 23:25:05,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 23:25:05,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 23:25:05,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 23:25:05,463 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand 4 states. [2019-01-11 23:25:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:07,051 INFO L93 Difference]: Finished difference Result 1396 states and 1948 transitions. [2019-01-11 23:25:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 23:25:07,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-01-11 23:25:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:07,059 INFO L225 Difference]: With dead ends: 1396 [2019-01-11 23:25:07,059 INFO L226 Difference]: Without dead ends: 977 [2019-01-11 23:25:07,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 23:25:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-11 23:25:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2019-01-11 23:25:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-01-11 23:25:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 904 transitions. [2019-01-11 23:25:07,105 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 904 transitions. Word has length 88 [2019-01-11 23:25:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:07,105 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 904 transitions. [2019-01-11 23:25:07,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 23:25:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 904 transitions. [2019-01-11 23:25:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-11 23:25:07,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:07,114 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:07,114 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1330656395, now seen corresponding path program 1 times [2019-01-11 23:25:07,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:07,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:07,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:07,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:07,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 23:25:07,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 23:25:07,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 23:25:07,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 23:25:07,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 23:25:07,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 23:25:07,355 INFO L87 Difference]: Start difference. First operand 699 states and 904 transitions. Second operand 4 states. [2019-01-11 23:25:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:09,485 INFO L93 Difference]: Finished difference Result 1674 states and 2149 transitions. [2019-01-11 23:25:09,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 23:25:09,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-01-11 23:25:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:09,492 INFO L225 Difference]: With dead ends: 1674 [2019-01-11 23:25:09,492 INFO L226 Difference]: Without dead ends: 977 [2019-01-11 23:25:09,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 23:25:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-11 23:25:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-01-11 23:25:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-11 23:25:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1182 transitions. [2019-01-11 23:25:09,513 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1182 transitions. Word has length 150 [2019-01-11 23:25:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:09,514 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1182 transitions. [2019-01-11 23:25:09,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 23:25:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1182 transitions. [2019-01-11 23:25:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-11 23:25:09,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:09,518 INFO L402 BasicCegarLoop]: trace histogram [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, 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] [2019-01-11 23:25:09,518 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:09,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1065467721, now seen corresponding path program 1 times [2019-01-11 23:25:09,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:09,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:09,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:09,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:09,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:09,928 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-01-11 23:25:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 23:25:10,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 23:25:10,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 23:25:10,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 23:25:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 23:25:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 23:25:10,007 INFO L87 Difference]: Start difference. First operand 977 states and 1182 transitions. Second operand 5 states. [2019-01-11 23:25:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:11,706 INFO L93 Difference]: Finished difference Result 3620 states and 4381 transitions. [2019-01-11 23:25:11,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 23:25:11,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2019-01-11 23:25:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:11,720 INFO L225 Difference]: With dead ends: 3620 [2019-01-11 23:25:11,720 INFO L226 Difference]: Without dead ends: 2645 [2019-01-11 23:25:11,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 23:25:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-01-11 23:25:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1811. [2019-01-11 23:25:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-01-11 23:25:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2121 transitions. [2019-01-11 23:25:11,766 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2121 transitions. Word has length 182 [2019-01-11 23:25:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:11,767 INFO L480 AbstractCegarLoop]: Abstraction has 1811 states and 2121 transitions. [2019-01-11 23:25:11,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 23:25:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2121 transitions. [2019-01-11 23:25:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-11 23:25:11,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:11,772 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:11,772 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash 143010852, now seen corresponding path program 1 times [2019-01-11 23:25:11,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:11,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:11,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:12,181 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-11 23:25:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 23:25:12,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 23:25:12,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 23:25:12,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 23:25:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 23:25:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 23:25:12,267 INFO L87 Difference]: Start difference. First operand 1811 states and 2121 transitions. Second operand 5 states. [2019-01-11 23:25:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:15,432 INFO L93 Difference]: Finished difference Result 5149 states and 5979 transitions. [2019-01-11 23:25:15,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 23:25:15,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-01-11 23:25:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:15,442 INFO L225 Difference]: With dead ends: 5149 [2019-01-11 23:25:15,443 INFO L226 Difference]: Without dead ends: 1811 [2019-01-11 23:25:15,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-11 23:25:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-01-11 23:25:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1672. [2019-01-11 23:25:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-11 23:25:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1847 transitions. [2019-01-11 23:25:15,482 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1847 transitions. Word has length 225 [2019-01-11 23:25:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:15,483 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1847 transitions. [2019-01-11 23:25:15,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 23:25:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1847 transitions. [2019-01-11 23:25:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-11 23:25:15,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:15,489 INFO L402 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:15,489 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 663196150, now seen corresponding path program 1 times [2019-01-11 23:25:15,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:15,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:15,789 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-11 23:25:15,962 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 23:25:16,414 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-01-11 23:25:16,855 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-01-11 23:25:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 170 proven. 64 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 23:25:17,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 23:25:17,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 23:25:17,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:17,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 23:25:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 23:25:17,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 23:25:17,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-01-11 23:25:17,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 23:25:17,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 23:25:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-11 23:25:17,515 INFO L87 Difference]: Start difference. First operand 1672 states and 1847 transitions. Second operand 11 states. [2019-01-11 23:25:20,396 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-11 23:25:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:23,529 INFO L93 Difference]: Finished difference Result 3519 states and 3907 transitions. [2019-01-11 23:25:23,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 23:25:23,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 248 [2019-01-11 23:25:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:23,540 INFO L225 Difference]: With dead ends: 3519 [2019-01-11 23:25:23,540 INFO L226 Difference]: Without dead ends: 1988 [2019-01-11 23:25:23,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-11 23:25:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-01-11 23:25:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1811. [2019-01-11 23:25:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-01-11 23:25:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 1971 transitions. [2019-01-11 23:25:23,588 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 1971 transitions. Word has length 248 [2019-01-11 23:25:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:23,588 INFO L480 AbstractCegarLoop]: Abstraction has 1811 states and 1971 transitions. [2019-01-11 23:25:23,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 23:25:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 1971 transitions. [2019-01-11 23:25:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-11 23:25:23,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:23,593 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:23,594 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:23,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2034481354, now seen corresponding path program 1 times [2019-01-11 23:25:23,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:23,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:23,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:23,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:23,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 11 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 23:25:24,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 23:25:24,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 23:25:24,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:24,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 23:25:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 11 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 23:25:24,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 23:25:24,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-01-11 23:25:24,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 23:25:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 23:25:24,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 23:25:24,878 INFO L87 Difference]: Start difference. First operand 1811 states and 1971 transitions. Second operand 7 states. [2019-01-11 23:25:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:28,795 INFO L93 Difference]: Finished difference Result 5846 states and 6404 transitions. [2019-01-11 23:25:28,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 23:25:28,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 261 [2019-01-11 23:25:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:28,813 INFO L225 Difference]: With dead ends: 5846 [2019-01-11 23:25:28,813 INFO L226 Difference]: Without dead ends: 4037 [2019-01-11 23:25:28,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 23:25:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2019-01-11 23:25:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 2923. [2019-01-11 23:25:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-01-11 23:25:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3210 transitions. [2019-01-11 23:25:28,888 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3210 transitions. Word has length 261 [2019-01-11 23:25:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:28,889 INFO L480 AbstractCegarLoop]: Abstraction has 2923 states and 3210 transitions. [2019-01-11 23:25:28,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 23:25:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3210 transitions. [2019-01-11 23:25:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-01-11 23:25:28,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:28,898 INFO L402 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:28,898 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1078051459, now seen corresponding path program 1 times [2019-01-11 23:25:28,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:28,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:28,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:28,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:29,231 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-11 23:25:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 259 proven. 43 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 23:25:29,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 23:25:29,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 23:25:29,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 23:25:29,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 23:25:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 197 proven. 105 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 23:25:30,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 23:25:30,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-01-11 23:25:30,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 23:25:30,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 23:25:30,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-11 23:25:30,321 INFO L87 Difference]: Start difference. First operand 2923 states and 3210 transitions. Second operand 9 states. [2019-01-11 23:25:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 23:25:32,530 INFO L93 Difference]: Finished difference Result 6747 states and 7422 transitions. [2019-01-11 23:25:32,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 23:25:32,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-01-11 23:25:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 23:25:32,549 INFO L225 Difference]: With dead ends: 6747 [2019-01-11 23:25:32,550 INFO L226 Difference]: Without dead ends: 3965 [2019-01-11 23:25:32,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 323 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 23:25:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2019-01-11 23:25:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 2923. [2019-01-11 23:25:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-01-11 23:25:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3186 transitions. [2019-01-11 23:25:32,632 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3186 transitions. Word has length 327 [2019-01-11 23:25:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 23:25:32,633 INFO L480 AbstractCegarLoop]: Abstraction has 2923 states and 3186 transitions. [2019-01-11 23:25:32,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 23:25:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3186 transitions. [2019-01-11 23:25:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-01-11 23:25:32,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 23:25:32,653 INFO L402 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 23:25:32,654 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 23:25:32,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 23:25:32,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1365207174, now seen corresponding path program 1 times [2019-01-11 23:25:32,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 23:25:32,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 23:25:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:32,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 23:25:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 23:25:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 23:25:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 23:25:32,906 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 23:25:33,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 11:25:33 BoogieIcfgContainer [2019-01-11 23:25:33,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 23:25:33,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 23:25:33,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 23:25:33,116 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 23:25:33,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:25:00" (3/4) ... [2019-01-11 23:25:33,121 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 23:25:33,330 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 23:25:33,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 23:25:33,331 INFO L168 Benchmark]: Toolchain (without parser) took 37208.91 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 466.6 MB). Free memory was 940.6 MB in the beginning and 1.3 GB in the end (delta: -321.5 MB). Peak memory consumption was 145.1 MB. Max. memory is 11.5 GB. [2019-01-11 23:25:33,331 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 23:25:33,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2019-01-11 23:25:33,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-11 23:25:33,333 INFO L168 Benchmark]: Boogie Preprocessor took 89.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-11 23:25:33,334 INFO L168 Benchmark]: RCFGBuilder took 3054.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. [2019-01-11 23:25:33,334 INFO L168 Benchmark]: TraceAbstraction took 32898.96 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -285.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-01-11 23:25:33,337 INFO L168 Benchmark]: Witness Printer took 213.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-11 23:25:33,342 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 845.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3054.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32898.96 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -285.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Witness Printer took 213.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] return 25; VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L461] a1 = (((a1 / 5) + 105416) + 61704) [L462] a10 = 4 [L464] return 24; VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND TRUE ((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))) [L314] a19 = 8 [L316] return -1; VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND TRUE (((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] __VERIFIER_error() VAL [a1=167153, a10=4, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. UNSAFE Result, 32.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 529 SDtfs, 3252 SDslu, 193 SDs, 0 SdLazy, 9768 SolverSat, 1308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 842 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2923occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 3862 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2761 NumberOfCodeBlocks, 2761 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2400 ConstructedInterpolants, 11 QuantifiedInterpolants, 3815125 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1151 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 1154/1606 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...