./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aae675ead2f575cce05887b769a7a66f133447b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:12:33,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:12:33,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:12:33,016 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:12:33,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:12:33,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:12:33,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:12:33,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:12:33,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:12:33,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:12:33,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:12:33,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:12:33,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:12:33,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:12:33,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:12:33,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:12:33,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:12:33,048 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:12:33,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:12:33,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:12:33,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:12:33,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:12:33,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:12:33,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:12:33,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:12:33,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:12:33,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:12:33,058 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:12:33,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:12:33,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:12:33,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:12:33,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:12:33,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:12:33,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:12:33,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:12:33,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:12:33,063 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:12:33,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:12:33,078 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:12:33,079 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:12:33,079 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:12:33,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:12:33,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:12:33,080 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:12:33,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:12:33,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:12:33,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:12:33,081 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:12:33,081 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:12:33,081 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:12:33,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:12:33,082 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:12:33,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:12:33,082 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:12:33,082 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:12:33,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:12:33,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:12:33,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:12:33,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:12:33,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:12:33,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:12:33,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:12:33,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:12:33,084 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:12:33,084 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:12:33,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:12:33,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:12:33,084 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aae675ead2f575cce05887b769a7a66f133447b [2018-11-28 16:12:33,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:12:33,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:12:33,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:12:33,153 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:12:33,153 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:12:33,154 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c [2018-11-28 16:12:33,223 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61a65045/1ad9b107c186421a97dbe10aa9cd38ef/FLAGd33e5ca5b [2018-11-28 16:12:33,816 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:12:33,817 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c [2018-11-28 16:12:33,834 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61a65045/1ad9b107c186421a97dbe10aa9cd38ef/FLAGd33e5ca5b [2018-11-28 16:12:34,022 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61a65045/1ad9b107c186421a97dbe10aa9cd38ef [2018-11-28 16:12:34,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:12:34,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:12:34,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:12:34,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:12:34,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:12:34,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b94ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34, skipping insertion in model container [2018-11-28 16:12:34,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:12:34,109 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:12:34,606 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:12:34,613 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:12:34,734 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:12:34,755 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:12:34,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34 WrapperNode [2018-11-28 16:12:34,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:12:34,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:12:34,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:12:34,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:12:34,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:12:34,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:12:34,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:12:34,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:12:34,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:34,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:35,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (1/1) ... [2018-11-28 16:12:35,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:12:35,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:12:35,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:12:35,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:12:35,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12: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 [2018-11-28 16:12:35,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:12:35,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:12:35,102 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-28 16:12:35,102 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-28 16:12:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:12:35,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:12:35,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:12:35,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:12:38,480 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:12:38,480 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:12:38,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:12:38 BoogieIcfgContainer [2018-11-28 16:12:38,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:12:38,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:12:38,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:12:38,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:12:38,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:12:34" (1/3) ... [2018-11-28 16:12:38,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ace3d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:12:38, skipping insertion in model container [2018-11-28 16:12:38,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:12:34" (2/3) ... [2018-11-28 16:12:38,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ace3d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:12:38, skipping insertion in model container [2018-11-28 16:12:38,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:12:38" (3/3) ... [2018-11-28 16:12:38,495 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label43_false-unreach-call_false-termination.c [2018-11-28 16:12:38,506 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:12:38,514 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:12:38,534 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:12:38,572 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:12:38,572 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:12:38,573 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:12:38,573 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:12:38,573 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:12:38,573 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:12:38,573 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:12:38,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:12:38,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:12:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2018-11-28 16:12:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 16:12:38,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:12:38,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:12:38,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:12:38,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:12:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 389606425, now seen corresponding path program 1 times [2018-11-28 16:12:38,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:12:38,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:12:38,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:38,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:12:38,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:12:39,211 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-28 16:12:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:12:39,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:12:39,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:12:39,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:12:39,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:12:39,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:12:39,345 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2018-11-28 16:12:40,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:12:40,882 INFO L93 Difference]: Finished difference Result 624 states and 1069 transitions. [2018-11-28 16:12:40,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:12:40,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-11-28 16:12:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:12:40,911 INFO L225 Difference]: With dead ends: 624 [2018-11-28 16:12:40,911 INFO L226 Difference]: Without dead ends: 326 [2018-11-28 16:12:40,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:12:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-28 16:12:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2018-11-28 16:12:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-28 16:12:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 467 transitions. [2018-11-28 16:12:41,017 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 467 transitions. Word has length 91 [2018-11-28 16:12:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:12:41,019 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 467 transitions. [2018-11-28 16:12:41,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:12:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 467 transitions. [2018-11-28 16:12:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 16:12:41,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:12:41,026 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:12:41,027 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:12:41,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:12:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1705382370, now seen corresponding path program 1 times [2018-11-28 16:12:41,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:12:41,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:12:41,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:41,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:12:41,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:12:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:12:41,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:12:41,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 16:12:41,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 16:12:41,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 16:12:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 16:12:41,275 INFO L87 Difference]: Start difference. First operand 321 states and 467 transitions. Second operand 6 states. [2018-11-28 16:12:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:12:43,797 INFO L93 Difference]: Finished difference Result 1255 states and 1892 transitions. [2018-11-28 16:12:43,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 16:12:43,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-28 16:12:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:12:43,807 INFO L225 Difference]: With dead ends: 1255 [2018-11-28 16:12:43,807 INFO L226 Difference]: Without dead ends: 940 [2018-11-28 16:12:43,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-28 16:12:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-11-28 16:12:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 928. [2018-11-28 16:12:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-11-28 16:12:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1239 transitions. [2018-11-28 16:12:43,874 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1239 transitions. Word has length 99 [2018-11-28 16:12:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:12:43,875 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1239 transitions. [2018-11-28 16:12:43,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 16:12:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1239 transitions. [2018-11-28 16:12:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-28 16:12:43,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:12:43,884 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:12:43,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:12:43,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:12:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1624429431, now seen corresponding path program 1 times [2018-11-28 16:12:43,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:12:43,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:12:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:43,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:12:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:12:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:12:44,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:12:44,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:12:44,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:12:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:12:44,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:12:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:12:44,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:12:44,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-28 16:12:44,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 16:12:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 16:12:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 16:12:44,482 INFO L87 Difference]: Start difference. First operand 928 states and 1239 transitions. Second operand 8 states. [2018-11-28 16:12:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:12:48,734 INFO L93 Difference]: Finished difference Result 2633 states and 3766 transitions. [2018-11-28 16:12:48,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 16:12:48,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2018-11-28 16:12:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:12:48,747 INFO L225 Difference]: With dead ends: 2633 [2018-11-28 16:12:48,747 INFO L226 Difference]: Without dead ends: 1108 [2018-11-28 16:12:48,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-28 16:12:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2018-11-28 16:12:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1074. [2018-11-28 16:12:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2018-11-28 16:12:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1354 transitions. [2018-11-28 16:12:48,799 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1354 transitions. Word has length 117 [2018-11-28 16:12:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:12:48,800 INFO L480 AbstractCegarLoop]: Abstraction has 1074 states and 1354 transitions. [2018-11-28 16:12:48,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 16:12:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1354 transitions. [2018-11-28 16:12:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-28 16:12:48,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:12:48,805 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:12:48,805 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:12:48,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:12:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash -156771037, now seen corresponding path program 1 times [2018-11-28 16:12:48,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:12:48,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:12:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:48,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:12:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:12:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:12:48,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:12:48,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 16:12:48,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:12:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:12:49,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:12:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 16:12:49,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 16:12:49,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-11-28 16:12:49,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 16:12:49,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 16:12:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 16:12:49,147 INFO L87 Difference]: Start difference. First operand 1074 states and 1354 transitions. Second operand 7 states. [2018-11-28 16:12:49,319 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-28 16:12:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:12:50,401 INFO L93 Difference]: Finished difference Result 3046 states and 3963 transitions. [2018-11-28 16:12:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 16:12:50,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-11-28 16:12:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:12:50,421 INFO L225 Difference]: With dead ends: 3046 [2018-11-28 16:12:50,421 INFO L226 Difference]: Without dead ends: 1978 [2018-11-28 16:12:50,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 16:12:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2018-11-28 16:12:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1974. [2018-11-28 16:12:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-11-28 16:12:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 2288 transitions. [2018-11-28 16:12:50,499 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 2288 transitions. Word has length 120 [2018-11-28 16:12:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:12:50,499 INFO L480 AbstractCegarLoop]: Abstraction has 1974 states and 2288 transitions. [2018-11-28 16:12:50,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 16:12:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2288 transitions. [2018-11-28 16:12:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-28 16:12:50,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:12:50,505 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:12:50,506 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:12:50,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:12:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1300144537, now seen corresponding path program 1 times [2018-11-28 16:12:50,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:12:50,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:12:50,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:50,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:12:50,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:12:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:12:50,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:12:50,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:12:50,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:12:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:12:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:12:50,696 INFO L87 Difference]: Start difference. First operand 1974 states and 2288 transitions. Second operand 3 states. [2018-11-28 16:12:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:12:51,310 INFO L93 Difference]: Finished difference Result 4668 states and 5521 transitions. [2018-11-28 16:12:51,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:12:51,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-28 16:12:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:12:51,327 INFO L225 Difference]: With dead ends: 4668 [2018-11-28 16:12:51,327 INFO L226 Difference]: Without dead ends: 2700 [2018-11-28 16:12:51,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:12:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2018-11-28 16:12:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2268. [2018-11-28 16:12:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2018-11-28 16:12:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2663 transitions. [2018-11-28 16:12:51,416 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2663 transitions. Word has length 125 [2018-11-28 16:12:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:12:51,417 INFO L480 AbstractCegarLoop]: Abstraction has 2268 states and 2663 transitions. [2018-11-28 16:12:51,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:12:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2663 transitions. [2018-11-28 16:12:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-28 16:12:51,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:12:51,425 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:12:51,425 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:12:51,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:12:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1079124894, now seen corresponding path program 1 times [2018-11-28 16:12:51,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:12:51,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:12:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:51,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:12:51,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:12:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 16:12:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 16:12:51,564 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 16:12:51,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:12:51 BoogieIcfgContainer [2018-11-28 16:12:51,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:12:51,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:12:51,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:12:51,773 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:12:51,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:12:38" (3/4) ... [2018-11-28 16:12:51,778 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 16:12:51,987 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:12:51,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:12:51,989 INFO L168 Benchmark]: Toolchain (without parser) took 17962.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -357.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:12:51,990 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:12:51,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.00 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-28 16:12:51,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.72 ms. Allocated memory is still 1.0 GB. Free memory is still 915.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:12:51,990 INFO L168 Benchmark]: Boogie Preprocessor took 205.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:12:51,992 INFO L168 Benchmark]: RCFGBuilder took 3467.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:12:51,992 INFO L168 Benchmark]: TraceAbstraction took 13289.40 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -283.6 MB). Peak memory consumption was 373.0 MB. Max. memory is 11.5 GB. [2018-11-28 16:12:51,993 INFO L168 Benchmark]: Witness Printer took 214.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2018-11-28 16:12:51,995 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.00 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.72 ms. Allocated memory is still 1.0 GB. Free memory is still 915.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 205.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3467.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13289.40 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -283.6 MB). Peak memory consumption was 373.0 MB. Max. memory is 11.5 GB. * Witness Printer took 214.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 427]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; VAL [\old(a)=24, \old(a11)=27, \old(a17)=14, \old(a19)=15, \old(a21)=18, \old(a25)=20, \old(a28)=28, \old(c)=16, \old(d)=22, \old(e)=13, \old(f)=21, \old(u)=25, \old(v)=12, \old(w)=23, \old(x)=17, \old(y)=26, \old(z)=19, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L603] int output = -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L166] a25 = 1 [L167] a28 = 9 [L168] return 26; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L31] a28 = 9 [L32] a11 = 1 [L33] a25 = 1 [L34] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L614] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L614] CALL calculate_output(input) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L427] __VERIFIER_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=5, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. UNSAFE Result, 13.1s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 334 SDtfs, 2769 SDslu, 340 SDs, 0 SdLazy, 3971 SolverSat, 670 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2268occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 487 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 922 NumberOfCodeBlocks, 922 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 233144 SizeOfPredicates, 3 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 133/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...