./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.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 ../sv-benchmarks/c/eca-rers2012/Problem10_label47.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8eda605ea5d3ae74a01c72b1fcadd4a0dda1a9c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-9a8b2e8 [2020-10-19 23:10:32,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 23:10:32,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 23:10:32,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 23:10:32,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 23:10:32,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 23:10:32,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 23:10:32,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 23:10:32,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 23:10:32,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 23:10:32,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 23:10:32,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 23:10:32,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 23:10:32,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 23:10:32,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 23:10:32,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 23:10:32,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 23:10:32,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 23:10:32,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 23:10:32,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 23:10:32,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 23:10:32,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 23:10:32,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 23:10:32,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 23:10:32,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 23:10:32,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 23:10:32,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 23:10:32,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 23:10:32,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 23:10:32,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 23:10:32,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 23:10:32,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 23:10:32,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 23:10:32,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 23:10:32,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 23:10:32,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 23:10:32,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 23:10:32,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 23:10:32,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 23:10:32,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 23:10:32,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 23:10:32,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-19 23:10:32,804 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 23:10:32,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 23:10:32,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 23:10:32,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 23:10:32,806 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 23:10:32,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 23:10:32,807 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 23:10:32,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 23:10:32,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 23:10:32,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 23:10:32,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-19 23:10:32,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-19 23:10:32,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-19 23:10:32,808 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 23:10:32,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 23:10:32,809 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 23:10:32,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-19 23:10:32,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 23:10:32,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 23:10:32,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-19 23:10:32,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-19 23:10:32,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-19 23:10:32,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 23:10:32,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-19 23:10:32,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-19 23:10:32,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 23:10:32,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-19 23:10:32,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-19 23:10:32,812 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 23:10:32,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8eda605ea5d3ae74a01c72b1fcadd4a0dda1a9c [2020-10-19 23:10:33,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 23:10:33,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 23:10:33,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 23:10:33,070 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 23:10:33,071 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 23:10:33,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label47.c [2020-10-19 23:10:33,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe65f56d/31c22ed01870449ca8099df2473f6eae/FLAGfd0354392 [2020-10-19 23:10:33,725 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 23:10:33,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label47.c [2020-10-19 23:10:33,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe65f56d/31c22ed01870449ca8099df2473f6eae/FLAGfd0354392 [2020-10-19 23:10:33,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe65f56d/31c22ed01870449ca8099df2473f6eae [2020-10-19 23:10:33,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 23:10:33,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 23:10:33,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 23:10:33,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 23:10:33,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 23:10:33,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 11:10:33" (1/1) ... [2020-10-19 23:10:33,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b70db35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:33, skipping insertion in model container [2020-10-19 23:10:33,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 11:10:33" (1/1) ... [2020-10-19 23:10:33,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 23:10:34,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 23:10:34,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 23:10:34,598 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 23:10:34,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 23:10:34,779 INFO L208 MainTranslator]: Completed translation [2020-10-19 23:10:34,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34 WrapperNode [2020-10-19 23:10:34,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 23:10:34,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 23:10:34,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 23:10:34,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 23:10:34,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:34,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:34,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 23:10:34,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 23:10:34,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 23:10:34,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 23:10:34,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:34,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:34,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:34,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:34,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:34,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:35,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (1/1) ... [2020-10-19 23:10:35,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 23:10:35,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 23:10:35,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 23:10:35,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 23:10:35,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (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 [2020-10-19 23:10:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 23:10:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 23:10:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 23:10:35,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 23:10:36,364 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 23:10:36,365 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-19 23:10:36,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 11:10:36 BoogieIcfgContainer [2020-10-19 23:10:36,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 23:10:36,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-19 23:10:36,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-19 23:10:36,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-19 23:10:36,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 11:10:33" (1/3) ... [2020-10-19 23:10:36,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d597a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 11:10:36, skipping insertion in model container [2020-10-19 23:10:36,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 11:10:34" (2/3) ... [2020-10-19 23:10:36,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d597a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 11:10:36, skipping insertion in model container [2020-10-19 23:10:36,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 11:10:36" (3/3) ... [2020-10-19 23:10:36,377 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label47.c [2020-10-19 23:10:36,392 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-19 23:10:36,402 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-19 23:10:36,419 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-19 23:10:36,452 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-19 23:10:36,452 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-19 23:10:36,452 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-19 23:10:36,453 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 23:10:36,453 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 23:10:36,453 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-19 23:10:36,454 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 23:10:36,454 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-19 23:10:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2020-10-19 23:10:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-19 23:10:36,487 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:36,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 23:10:36,489 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash 406614337, now seen corresponding path program 1 times [2020-10-19 23:10:36,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:36,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024002971] [2020-10-19 23:10:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:36,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024002971] [2020-10-19 23:10:36,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 23:10:36,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 23:10:36,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675578413] [2020-10-19 23:10:36,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 23:10:36,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:36,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 23:10:36,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 23:10:36,932 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2020-10-19 23:10:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:38,027 INFO L93 Difference]: Finished difference Result 568 states and 982 transitions. [2020-10-19 23:10:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 23:10:38,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-19 23:10:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:38,056 INFO L225 Difference]: With dead ends: 568 [2020-10-19 23:10:38,056 INFO L226 Difference]: Without dead ends: 282 [2020-10-19 23:10:38,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 23:10:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-10-19 23:10:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-10-19 23:10:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-19 23:10:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2020-10-19 23:10:38,134 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 19 [2020-10-19 23:10:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:38,135 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2020-10-19 23:10:38,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 23:10:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2020-10-19 23:10:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-19 23:10:38,138 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:38,139 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-19 23:10:38,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-19 23:10:38,140 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1562502098, now seen corresponding path program 1 times [2020-10-19 23:10:38,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:38,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849786139] [2020-10-19 23:10:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:38,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849786139] [2020-10-19 23:10:38,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100878418] [2020-10-19 23:10:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 23:10:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:38,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 23:10:38,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 23:10:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-19 23:10:38,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 23:10:38,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2020-10-19 23:10:38,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894449322] [2020-10-19 23:10:38,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 23:10:38,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 23:10:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 23:10:38,651 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 3 states. [2020-10-19 23:10:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:39,305 INFO L93 Difference]: Finished difference Result 562 states and 862 transitions. [2020-10-19 23:10:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 23:10:39,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-10-19 23:10:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:39,310 INFO L225 Difference]: With dead ends: 562 [2020-10-19 23:10:39,319 INFO L226 Difference]: Without dead ends: 560 [2020-10-19 23:10:39,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 23:10:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-10-19 23:10:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 282. [2020-10-19 23:10:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-19 23:10:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2020-10-19 23:10:39,340 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 85 [2020-10-19 23:10:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:39,341 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2020-10-19 23:10:39,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 23:10:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2020-10-19 23:10:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-19 23:10:39,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:39,344 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-19 23:10:39,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-10-19 23:10:39,553 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash 961634745, now seen corresponding path program 1 times [2020-10-19 23:10:39,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:39,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383434247] [2020-10-19 23:10:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:39,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383434247] [2020-10-19 23:10:39,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 23:10:39,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 23:10:39,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27114306] [2020-10-19 23:10:39,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 23:10:39,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:39,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 23:10:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 23:10:39,687 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 3 states. [2020-10-19 23:10:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:40,388 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2020-10-19 23:10:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 23:10:40,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-10-19 23:10:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:40,394 INFO L225 Difference]: With dead ends: 701 [2020-10-19 23:10:40,394 INFO L226 Difference]: Without dead ends: 421 [2020-10-19 23:10:40,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 23:10:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-19 23:10:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-19 23:10:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-19 23:10:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2020-10-19 23:10:40,413 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 88 [2020-10-19 23:10:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:40,413 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2020-10-19 23:10:40,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 23:10:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2020-10-19 23:10:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-19 23:10:40,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:40,417 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-19 23:10:40,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-19 23:10:40,418 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1410409968, now seen corresponding path program 1 times [2020-10-19 23:10:40,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:40,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789119245] [2020-10-19 23:10:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:40,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789119245] [2020-10-19 23:10:40,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 23:10:40,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 23:10:40,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850430579] [2020-10-19 23:10:40,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-19 23:10:40,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:40,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 23:10:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 23:10:40,605 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand 4 states. [2020-10-19 23:10:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:41,495 INFO L93 Difference]: Finished difference Result 990 states and 1390 transitions. [2020-10-19 23:10:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 23:10:41,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-10-19 23:10:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:41,500 INFO L225 Difference]: With dead ends: 990 [2020-10-19 23:10:41,500 INFO L226 Difference]: Without dead ends: 571 [2020-10-19 23:10:41,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-19 23:10:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-10-19 23:10:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 560. [2020-10-19 23:10:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-10-19 23:10:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2020-10-19 23:10:41,521 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 97 [2020-10-19 23:10:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:41,522 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2020-10-19 23:10:41,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-19 23:10:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2020-10-19 23:10:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-10-19 23:10:41,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:41,531 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 23:10:41,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-19 23:10:41,532 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1059012289, now seen corresponding path program 1 times [2020-10-19 23:10:41,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:41,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031815318] [2020-10-19 23:10:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:41,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031815318] [2020-10-19 23:10:41,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 23:10:41,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 23:10:41,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796963320] [2020-10-19 23:10:41,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 23:10:41,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:41,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 23:10:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 23:10:41,675 INFO L87 Difference]: Start difference. First operand 560 states and 740 transitions. Second operand 3 states. [2020-10-19 23:10:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:42,262 INFO L93 Difference]: Finished difference Result 1257 states and 1713 transitions. [2020-10-19 23:10:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 23:10:42,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2020-10-19 23:10:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:42,270 INFO L225 Difference]: With dead ends: 1257 [2020-10-19 23:10:42,270 INFO L226 Difference]: Without dead ends: 838 [2020-10-19 23:10:42,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 23:10:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-10-19 23:10:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-10-19 23:10:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-10-19 23:10:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1039 transitions. [2020-10-19 23:10:42,294 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1039 transitions. Word has length 163 [2020-10-19 23:10:42,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:42,295 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1039 transitions. [2020-10-19 23:10:42,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 23:10:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1039 transitions. [2020-10-19 23:10:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-10-19 23:10:42,300 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:42,300 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 23:10:42,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-19 23:10:42,301 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:42,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1597687401, now seen corresponding path program 1 times [2020-10-19 23:10:42,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:42,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720566080] [2020-10-19 23:10:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:42,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720566080] [2020-10-19 23:10:42,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 23:10:42,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-19 23:10:42,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472713230] [2020-10-19 23:10:42,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-19 23:10:42,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-19 23:10:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 23:10:42,564 INFO L87 Difference]: Start difference. First operand 838 states and 1039 transitions. Second operand 7 states. [2020-10-19 23:10:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:45,423 INFO L93 Difference]: Finished difference Result 1590 states and 1987 transitions. [2020-10-19 23:10:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 23:10:45,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2020-10-19 23:10:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:45,429 INFO L225 Difference]: With dead ends: 1590 [2020-10-19 23:10:45,429 INFO L226 Difference]: Without dead ends: 838 [2020-10-19 23:10:45,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-19 23:10:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-10-19 23:10:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-10-19 23:10:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-10-19 23:10:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1035 transitions. [2020-10-19 23:10:45,449 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1035 transitions. Word has length 172 [2020-10-19 23:10:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:45,450 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1035 transitions. [2020-10-19 23:10:45,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-19 23:10:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1035 transitions. [2020-10-19 23:10:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-10-19 23:10:45,453 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:45,454 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-19 23:10:45,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-19 23:10:45,454 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1263254351, now seen corresponding path program 1 times [2020-10-19 23:10:45,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:45,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114518199] [2020-10-19 23:10:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:45,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114518199] [2020-10-19 23:10:45,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 23:10:45,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 23:10:45,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206985766] [2020-10-19 23:10:45,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 23:10:45,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:45,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 23:10:45,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 23:10:45,611 INFO L87 Difference]: Start difference. First operand 838 states and 1035 transitions. Second operand 3 states. [2020-10-19 23:10:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:46,514 INFO L93 Difference]: Finished difference Result 1952 states and 2515 transitions. [2020-10-19 23:10:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 23:10:46,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2020-10-19 23:10:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:46,522 INFO L225 Difference]: With dead ends: 1952 [2020-10-19 23:10:46,522 INFO L226 Difference]: Without dead ends: 1255 [2020-10-19 23:10:46,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-19 23:10:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-10-19 23:10:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2020-10-19 23:10:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-10-19 23:10:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1363 transitions. [2020-10-19 23:10:46,556 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1363 transitions. Word has length 208 [2020-10-19 23:10:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:46,557 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1363 transitions. [2020-10-19 23:10:46,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 23:10:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1363 transitions. [2020-10-19 23:10:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2020-10-19 23:10:46,566 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:46,566 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-19 23:10:46,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-19 23:10:46,567 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:46,568 INFO L82 PathProgramCache]: Analyzing trace with hash -531322504, now seen corresponding path program 1 times [2020-10-19 23:10:46,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:46,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264359146] [2020-10-19 23:10:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 126 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:46,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264359146] [2020-10-19 23:10:46,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298622830] [2020-10-19 23:10:46,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 23:10:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:47,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 23:10:47,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 23:10:47,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 23:10:47,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 23:10:47,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 23:10:47,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 23:10:47,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 23:10:47,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 23:10:47,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:47,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 23:10:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 126 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:47,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 23:10:47,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-19 23:10:47,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220532550] [2020-10-19 23:10:47,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-19 23:10:47,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:47,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 23:10:47,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 23:10:47,708 INFO L87 Difference]: Start difference. First operand 1116 states and 1363 transitions. Second operand 5 states. [2020-10-19 23:10:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:49,375 INFO L93 Difference]: Finished difference Result 3759 states and 4576 transitions. [2020-10-19 23:10:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 23:10:49,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2020-10-19 23:10:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:49,391 INFO L225 Difference]: With dead ends: 3759 [2020-10-19 23:10:49,391 INFO L226 Difference]: Without dead ends: 2784 [2020-10-19 23:10:49,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 23:10:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2020-10-19 23:10:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 1950. [2020-10-19 23:10:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2020-10-19 23:10:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2316 transitions. [2020-10-19 23:10:49,457 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2316 transitions. Word has length 262 [2020-10-19 23:10:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:49,458 INFO L481 AbstractCegarLoop]: Abstraction has 1950 states and 2316 transitions. [2020-10-19 23:10:49,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-19 23:10:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2316 transitions. [2020-10-19 23:10:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2020-10-19 23:10:49,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:49,469 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-19 23:10:49,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 23:10:49,685 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1541169861, now seen corresponding path program 1 times [2020-10-19 23:10:49,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:49,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620388372] [2020-10-19 23:10:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 33 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:50,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620388372] [2020-10-19 23:10:50,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596829107] [2020-10-19 23:10:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 23:10:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:50,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 23:10:50,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 23:10:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2020-10-19 23:10:50,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 23:10:50,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-10-19 23:10:50,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415927455] [2020-10-19 23:10:50,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 23:10:50,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:50,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 23:10:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-19 23:10:50,658 INFO L87 Difference]: Start difference. First operand 1950 states and 2316 transitions. Second operand 3 states. [2020-10-19 23:10:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:51,418 INFO L93 Difference]: Finished difference Result 4315 states and 5216 transitions. [2020-10-19 23:10:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 23:10:51,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2020-10-19 23:10:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:51,434 INFO L225 Difference]: With dead ends: 4315 [2020-10-19 23:10:51,434 INFO L226 Difference]: Without dead ends: 2506 [2020-10-19 23:10:51,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-19 23:10:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-10-19 23:10:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2367. [2020-10-19 23:10:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2020-10-19 23:10:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2798 transitions. [2020-10-19 23:10:51,496 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2798 transitions. Word has length 264 [2020-10-19 23:10:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:51,497 INFO L481 AbstractCegarLoop]: Abstraction has 2367 states and 2798 transitions. [2020-10-19 23:10:51,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 23:10:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2798 transitions. [2020-10-19 23:10:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-10-19 23:10:51,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:51,504 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 23:10:51,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 23:10:51,706 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2045419390, now seen corresponding path program 1 times [2020-10-19 23:10:51,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:51,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488880403] [2020-10-19 23:10:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 23:10:51,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488880403] [2020-10-19 23:10:51,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 23:10:51,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 23:10:51,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727969617] [2020-10-19 23:10:51,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-19 23:10:51,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 23:10:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-19 23:10:51,981 INFO L87 Difference]: Start difference. First operand 2367 states and 2798 transitions. Second operand 4 states. [2020-10-19 23:10:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:10:53,039 INFO L93 Difference]: Finished difference Result 4871 states and 5779 transitions. [2020-10-19 23:10:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 23:10:53,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2020-10-19 23:10:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:10:53,054 INFO L225 Difference]: With dead ends: 4871 [2020-10-19 23:10:53,054 INFO L226 Difference]: Without dead ends: 2645 [2020-10-19 23:10:53,058 INFO L677 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 [2020-10-19 23:10:53,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2020-10-19 23:10:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2367. [2020-10-19 23:10:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2020-10-19 23:10:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2783 transitions. [2020-10-19 23:10:53,139 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2783 transitions. Word has length 267 [2020-10-19 23:10:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:10:53,140 INFO L481 AbstractCegarLoop]: Abstraction has 2367 states and 2783 transitions. [2020-10-19 23:10:53,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-19 23:10:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2783 transitions. [2020-10-19 23:10:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-10-19 23:10:53,146 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:10:53,147 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 23:10:53,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-19 23:10:53,147 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:10:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:10:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash -5293596, now seen corresponding path program 1 times [2020-10-19 23:10:53,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:10:53,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564604778] [2020-10-19 23:10:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:10:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 170 proven. 17 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-10-19 23:10:53,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564604778] [2020-10-19 23:10:53,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453577796] [2020-10-19 23:10:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 23:10:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 23:10:53,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 23:10:53,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 23:10:53,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 23:10:53,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 23:10:53,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 23:10:53,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 23:10:53,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-19 23:10:53,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-19 23:10:53,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:53,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 23:10:53,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-19 23:10:56,528 WARN L193 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 154 DAG size of output: 34 [2020-10-19 23:10:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-10-19 23:10:56,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-19 23:10:56,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-10-19 23:10:56,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704947152] [2020-10-19 23:10:56,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-19 23:10:56,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 23:10:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-19 23:10:56,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 23:10:56,791 INFO L87 Difference]: Start difference. First operand 2367 states and 2783 transitions. Second operand 3 states. [2020-10-19 23:11:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 23:11:08,224 INFO L93 Difference]: Finished difference Result 3342 states and 3976 transitions. [2020-10-19 23:11:08,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-19 23:11:08,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2020-10-19 23:11:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-19 23:11:08,239 INFO L225 Difference]: With dead ends: 3342 [2020-10-19 23:11:08,239 INFO L226 Difference]: Without dead ends: 3340 [2020-10-19 23:11:08,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-19 23:11:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2020-10-19 23:11:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2367. [2020-10-19 23:11:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2020-10-19 23:11:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2783 transitions. [2020-10-19 23:11:08,296 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2783 transitions. Word has length 280 [2020-10-19 23:11:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-19 23:11:08,296 INFO L481 AbstractCegarLoop]: Abstraction has 2367 states and 2783 transitions. [2020-10-19 23:11:08,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-19 23:11:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2783 transitions. [2020-10-19 23:11:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-10-19 23:11:08,303 INFO L414 BasicCegarLoop]: Found error trace [2020-10-19 23:11:08,303 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-19 23:11:08,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 23:11:08,516 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-19 23:11:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 23:11:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1536635249, now seen corresponding path program 1 times [2020-10-19 23:11:08,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 23:11:08,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728698447] [2020-10-19 23:11:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 23:11:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 23:11:08,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 23:11:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 23:11:08,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 23:11:08,712 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 23:11:08,712 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-19 23:11:08,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-19 23:11:08,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 11:11:08 BoogieIcfgContainer [2020-10-19 23:11:08,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-19 23:11:08,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 23:11:08,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 23:11:08,995 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 23:11:08,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 11:10:36" (3/4) ... [2020-10-19 23:11:08,998 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-19 23:11:09,264 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 23:11:09,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 23:11:09,266 INFO L168 Benchmark]: Toolchain (without parser) took 35318.41 ms. Allocated memory was 35.1 MB in the beginning and 189.3 MB in the end (delta: 154.1 MB). Free memory was 11.7 MB in the beginning and 25.5 MB in the end (delta: -13.9 MB). Peak memory consumption was 140.3 MB. Max. memory is 14.3 GB. [2020-10-19 23:11:09,266 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 33.6 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 64.4 kB). Peak memory consumption was 64.4 kB. Max. memory is 14.3 GB. [2020-10-19 23:11:09,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.42 ms. Allocated memory was 35.1 MB in the beginning and 45.6 MB in the end (delta: 10.5 MB). Free memory was 10.8 MB in the beginning and 17.2 MB in the end (delta: -6.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. [2020-10-19 23:11:09,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.78 ms. Allocated memory was 45.6 MB in the beginning and 46.1 MB in the end (delta: 524.3 kB). Free memory was 17.0 MB in the beginning and 21.7 MB in the end (delta: -4.7 MB). Peak memory consumption was 8.6 MB. Max. memory is 14.3 GB. [2020-10-19 23:11:09,267 INFO L168 Benchmark]: Boogie Preprocessor took 106.64 ms. Allocated memory is still 46.1 MB. Free memory was 21.7 MB in the beginning and 16.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 14.3 GB. [2020-10-19 23:11:09,268 INFO L168 Benchmark]: RCFGBuilder took 1355.42 ms. Allocated memory was 46.1 MB in the beginning and 57.7 MB in the end (delta: 11.5 MB). Free memory was 16.1 MB in the beginning and 21.8 MB in the end (delta: -5.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 14.3 GB. [2020-10-19 23:11:09,268 INFO L168 Benchmark]: TraceAbstraction took 32625.31 ms. Allocated memory was 57.7 MB in the beginning and 189.3 MB in the end (delta: 131.6 MB). Free memory was 21.4 MB in the beginning and 64.7 MB in the end (delta: -43.3 MB). Peak memory consumption was 88.3 MB. Max. memory is 14.3 GB. [2020-10-19 23:11:09,268 INFO L168 Benchmark]: Witness Printer took 269.59 ms. Allocated memory is still 189.3 MB. Free memory was 64.7 MB in the beginning and 25.5 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 14.3 GB. [2020-10-19 23:11:09,271 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 33.6 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 64.4 kB). Peak memory consumption was 64.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 828.42 ms. Allocated memory was 35.1 MB in the beginning and 45.6 MB in the end (delta: 10.5 MB). Free memory was 10.8 MB in the beginning and 17.2 MB in the end (delta: -6.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 122.78 ms. Allocated memory was 45.6 MB in the beginning and 46.1 MB in the end (delta: 524.3 kB). Free memory was 17.0 MB in the beginning and 21.7 MB in the end (delta: -4.7 MB). Peak memory consumption was 8.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 106.64 ms. Allocated memory is still 46.1 MB. Free memory was 21.7 MB in the beginning and 16.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1355.42 ms. Allocated memory was 46.1 MB in the beginning and 57.7 MB in the end (delta: 11.5 MB). Free memory was 16.1 MB in the beginning and 21.8 MB in the end (delta: -5.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 14.3 GB. * TraceAbstraction took 32625.31 ms. Allocated memory was 57.7 MB in the beginning and 189.3 MB in the end (delta: 131.6 MB). Free memory was 21.4 MB in the beginning and 64.7 MB in the end (delta: -43.3 MB). Peak memory consumption was 88.3 MB. Max. memory is 14.3 GB. * Witness Printer took 269.59 ms. Allocated memory is still 189.3 MB. Free memory was 64.7 MB in the beginning and 25.5 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; [L10] int inputD = 4; [L11] int inputE = 5; [L12] int inputF = 6; [L13] int inputB = 2; [L16] int a1 = 23; [L17] int a19 = 9; [L18] int a10 = 0; [L19] int a12 = 0; [L20] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L23] 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] [L26] 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] [L29] 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] [L32] 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] [L35] 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] [L38] 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] [L41] 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] [L44] 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] [L47] 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] [L50] 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] [L53] 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] [L56] 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] [L59] 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] [L62] 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] [L65] 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] [L68] 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] [L71] 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] [L74] 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] [L77] 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] [L80] 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] [L83] 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] [L86] 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] [L89] 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] [L92] 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] [L95] 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] [L98] 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] [L101] 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] [L104] 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] [L107] 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] [L110] 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] [L113] 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] [L116] 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] [L119] 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] [L122] 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] [L125] 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] [L128] 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] [L131] 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] [L134] 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] [L137] 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] [L140] 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] [L143] 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] [L146] 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] [L149] 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] [L152] 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] [L155] 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] [L158] 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] [L161] 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] [L164] 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] [L167] 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] [L170] 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] [L173] 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] [L176] 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] [L179] 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] [L182] 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] [L185] 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] [L188] 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] [L191] 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] [L194] 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] [L197] 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] [L200] 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] [L203] 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] [L207] 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] [L212] 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] [L217] 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] [L222] 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] [L227] 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] [L233] 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] [L238] 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] [L241] 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] [L246] 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] [L251] 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] [L256] 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] [L262] 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] [L267] 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] [L273] 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] [L279] 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] [L285] 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] [L288] 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] [L293] 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] [L298] 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] [L303] 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] [L308] 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] [L314] 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] [L319] 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] [L322] 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] [L325] 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] [L328] 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] [L331] 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] [L337] 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] [L342] 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] [L347] 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] [L353] 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] [L356] 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] [L359] 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] [L362] 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] [L367] 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] [L372] 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] [L377] 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] [L380] 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] [L385] 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] [L390] 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] [L395] 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] [L400] 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] [L405] 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] [L410] 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] [L416] 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] [L421] 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] [L427] 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] [L432] 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] [L438] 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] [L444] 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] [L450] 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] [L456] 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] [L462] 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] [L467] 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] [L473] 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] [L478] 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] [L483] 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] [L489] 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] [L495] 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] [L501] 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] [L506] 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] [L511] 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] [L516] 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] [L519] 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] [L525] 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] [L528] 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] [L531] 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] [L536] 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] [L542] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L543] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L544] a10 = 1 [L546] return 25; VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L23] 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] [L26] 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] [L29] 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] [L32] 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] [L35] 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] [L38] 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] [L41] 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] [L44] 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] [L47] 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] [L50] 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] [L53] 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] [L56] 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] [L59] 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] [L62] 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] [L65] 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] [L68] 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] [L71] 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] [L74] 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] [L77] 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] [L80] 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] [L83] 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] [L86] 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] [L89] 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] [L92] 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] [L95] 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] [L98] 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] [L101] 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] [L104] 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] [L107] 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] [L110] 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] [L113] 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] [L116] 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] [L119] 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] [L122] 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] [L125] 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] [L128] 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] [L131] 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] [L134] 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] [L137] 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] [L140] 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] [L143] 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] [L146] 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] [L149] 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] [L152] 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] [L155] 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] [L158] 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] [L161] 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] [L164] 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] [L167] 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] [L170] 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] [L173] 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] [L176] 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] [L179] 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] [L182] 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] [L185] 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] [L188] 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] [L191] 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] [L194] 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] [L197] 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] [L200] 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] [L203] 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] [L207] 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] [L212] 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] [L217] 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] [L222] 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] [L227] 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] [L233] 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] [L238] 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] [L241] 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] [L246] 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] [L251] 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] [L256] 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] [L262] 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] [L267] 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] [L273] 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] [L279] 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] [L285] 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] [L288] 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] [L293] 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] [L298] 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] [L303] 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] [L308] 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] [L314] 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] [L319] 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] [L322] 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] [L325] 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] [L328] 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] [L331] 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] [L337] 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] [L342] 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] [L347] 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] [L353] 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] [L356] 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] [L359] 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] [L362] 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] [L367] 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] [L372] 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] [L377] 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] [L380] 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] [L385] 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] [L390] 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] [L395] 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] [L400] 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] [L405] 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] [L410] 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] [L416] 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] [L421] 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] [L427] 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] [L432] 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] [L438] 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] [L444] 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] [L450] 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] [L456] 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] [L462] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L467] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( 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] [L473] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L478] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (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] [L483] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L489] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (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] [L495] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (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] [L501] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && 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] [L506] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L511] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (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] [L519] 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=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L525] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-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] [L528] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND TRUE ((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0))))) [L537] a1 = (((a1 + -438195) * 1) * 1) [L538] a10 = 2 [L539] a19 = 8 [L541] return -1; VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] output = calculate_output(input) [L584] COND TRUE 1 [L587] int input; [L588] input = __VERIFIER_nondet_int() [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND TRUE (((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) VAL [a1=-438026, a10=2, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L4] __assert_fail("0", "Problem10_label47.c", 4, "reach_error") VAL [a1=-438026, a10=2, 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, 207 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.2s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1007 SDtfs, 1693 SDslu, 73 SDs, 0 SdLazy, 5135 SolverSat, 870 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 927 GetRequests, 898 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2367occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 2652 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 3080 NumberOfCodeBlocks, 3080 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2781 ConstructedInterpolants, 17 QuantifiedInterpolants, 2933356 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1363 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 1565/1746 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...