./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer --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 a91a998212d77a3e9dd6829139b4c40272a542d6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-1dbac8b [2018-11-10 08:48:27,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:48:27,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:48:27,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:48:27,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:48:27,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:48:27,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:48:27,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:48:27,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:48:27,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:48:27,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:48:27,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:48:27,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:48:27,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:48:27,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:48:27,461 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:48:27,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:48:27,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:48:27,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:48:27,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:48:27,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:48:27,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:48:27,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:48:27,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:48:27,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:48:27,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:48:27,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:48:27,470 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:48:27,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:48:27,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:48:27,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:48:27,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:48:27,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:48:27,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:48:27,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:48:27,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:48:27,473 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 08:48:27,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:48:27,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:48:27,484 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:48:27,484 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 08:48:27,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:48:27,485 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:48:27,485 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:48:27,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:48:27,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:48:27,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:48:27,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:48:27,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:48:27,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:48:27,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:48:27,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:48:27,486 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:48:27,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:48:27,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:48:27,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:48:27,486 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:48:27,486 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:48:27,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:48:27,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:48:27,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:48:27,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:48:27,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:48:27,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:48:27,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:48:27,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:48:27,488 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer 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 -> a91a998212d77a3e9dd6829139b4c40272a542d6 [2018-11-10 08:48:27,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:48:27,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:48:27,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:48:27,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:48:27,526 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:48:27,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c [2018-11-10 08:48:27,570 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/data/f152cf8f8/698d07ad3f904398b94cf4f58bf61ccf/FLAG4a272653b [2018-11-10 08:48:27,931 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:48:27,931 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/sv-benchmarks/c/eca-rers2012/Problem10_label24_false-unreach-call.c [2018-11-10 08:48:27,942 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/data/f152cf8f8/698d07ad3f904398b94cf4f58bf61ccf/FLAG4a272653b [2018-11-10 08:48:27,953 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/data/f152cf8f8/698d07ad3f904398b94cf4f58bf61ccf [2018-11-10 08:48:27,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:48:27,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 08:48:27,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:48:27,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:48:27,961 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:48:27,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:48:27" (1/1) ... [2018-11-10 08:48:27,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d64a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:27, skipping insertion in model container [2018-11-10 08:48:27,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:48:27" (1/1) ... [2018-11-10 08:48:27,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:48:28,004 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:48:28,207 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:48:28,210 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:48:28,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:48:28,284 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:48:28,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28 WrapperNode [2018-11-10 08:48:28,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:48:28,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:48:28,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:48:28,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:48:28,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (1/1) ... [2018-11-10 08:48:28,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (1/1) ... [2018-11-10 08:48:28,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (1/1) ... [2018-11-10 08:48:28,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (1/1) ... [2018-11-10 08:48:28,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (1/1) ... [2018-11-10 08:48:28,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (1/1) ... [2018-11-10 08:48:28,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (1/1) ... [2018-11-10 08:48:28,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:48:28,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:48:28,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:48:28,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:48:28,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/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-10 08:48:28,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:48:28,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:48:28,452 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 08:48:28,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:48:28,452 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 08:48:28,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 08:48:28,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 08:48:28,452 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 08:48:28,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:48:28,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:48:28,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:48:29,283 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:48:29,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:48:29 BoogieIcfgContainer [2018-11-10 08:48:29,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:48:29,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:48:29,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:48:29,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:48:29,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:48:27" (1/3) ... [2018-11-10 08:48:29,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7559e2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:48:29, skipping insertion in model container [2018-11-10 08:48:29,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:48:28" (2/3) ... [2018-11-10 08:48:29,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7559e2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:48:29, skipping insertion in model container [2018-11-10 08:48:29,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:48:29" (3/3) ... [2018-11-10 08:48:29,289 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label24_false-unreach-call.c [2018-11-10 08:48:29,295 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:48:29,301 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 08:48:29,310 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 08:48:29,332 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:48:29,332 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:48:29,333 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:48:29,333 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:48:29,333 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:48:29,333 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:48:29,333 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:48:29,333 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:48:29,333 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:48:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 08:48:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 08:48:29,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:29,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:29,356 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:48:29,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:29,360 INFO L82 PathProgramCache]: Analyzing trace with hash 823320841, now seen corresponding path program 1 times [2018-11-10 08:48:29,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:48:29,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:48:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:29,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:29,542 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-10 08:48:29,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:48:29,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:48:29,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:48:29,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:48:29,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:48:29,557 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-10 08:48:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:30,136 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-10 08:48:30,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:48:30,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 08:48:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:30,148 INFO L225 Difference]: With dead ends: 574 [2018-11-10 08:48:30,148 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 08:48:30,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:48:30,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 08:48:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 08:48:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 08:48:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 592 transitions. [2018-11-10 08:48:30,194 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 592 transitions. Word has length 21 [2018-11-10 08:48:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:30,194 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 592 transitions. [2018-11-10 08:48:30,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:48:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 592 transitions. [2018-11-10 08:48:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 08:48:30,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:30,197 INFO L375 BasicCegarLoop]: trace histogram [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-10 08:48:30,198 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:48:30,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1112402304, now seen corresponding path program 1 times [2018-11-10 08:48:30,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:48:30,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:48:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:30,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:48:30,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:48:30,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:48:30,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:48:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:48:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:48:30,360 INFO L87 Difference]: Start difference. First operand 356 states and 592 transitions. Second operand 6 states. [2018-11-10 08:48:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:31,281 INFO L93 Difference]: Finished difference Result 1002 states and 1689 transitions. [2018-11-10 08:48:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:48:31,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-10 08:48:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:31,288 INFO L225 Difference]: With dead ends: 1002 [2018-11-10 08:48:31,288 INFO L226 Difference]: Without dead ends: 652 [2018-11-10 08:48:31,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:48:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-11-10 08:48:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 640. [2018-11-10 08:48:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-10 08:48:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 960 transitions. [2018-11-10 08:48:31,313 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 960 transitions. Word has length 91 [2018-11-10 08:48:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:31,314 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 960 transitions. [2018-11-10 08:48:31,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:48:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 960 transitions. [2018-11-10 08:48:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 08:48:31,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:31,316 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 08:48:31,316 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:48:31,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2093526668, now seen corresponding path program 1 times [2018-11-10 08:48:31,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:48:31,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:48:31,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:31,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:48:31,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:48:31,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:48:31,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 08:48:31,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:48:31,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:48:31,403 INFO L87 Difference]: Start difference. First operand 640 states and 960 transitions. Second operand 4 states. [2018-11-10 08:48:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:32,053 INFO L93 Difference]: Finished difference Result 2128 states and 3336 transitions. [2018-11-10 08:48:32,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:48:32,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-10 08:48:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:32,058 INFO L225 Difference]: With dead ends: 2128 [2018-11-10 08:48:32,058 INFO L226 Difference]: Without dead ends: 904 [2018-11-10 08:48:32,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:48:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-10 08:48:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-11-10 08:48:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-10 08:48:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1277 transitions. [2018-11-10 08:48:32,084 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1277 transitions. Word has length 101 [2018-11-10 08:48:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:32,084 INFO L481 AbstractCegarLoop]: Abstraction has 904 states and 1277 transitions. [2018-11-10 08:48:32,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 08:48:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1277 transitions. [2018-11-10 08:48:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 08:48:32,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:32,087 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:48:32,087 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:48:32,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1920891619, now seen corresponding path program 1 times [2018-11-10 08:48:32,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:48:32,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:48:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:32,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:48:32,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:48:32,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:48:32,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:48:32,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:48:32,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:48:32,236 INFO L87 Difference]: Start difference. First operand 904 states and 1277 transitions. Second operand 6 states. [2018-11-10 08:48:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:32,680 INFO L93 Difference]: Finished difference Result 2127 states and 3078 transitions. [2018-11-10 08:48:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:48:32,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-11-10 08:48:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:32,685 INFO L225 Difference]: With dead ends: 2127 [2018-11-10 08:48:32,685 INFO L226 Difference]: Without dead ends: 1229 [2018-11-10 08:48:32,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:48:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-11-10 08:48:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1208. [2018-11-10 08:48:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-11-10 08:48:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1646 transitions. [2018-11-10 08:48:32,709 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1646 transitions. Word has length 144 [2018-11-10 08:48:32,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:32,709 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 1646 transitions. [2018-11-10 08:48:32,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:48:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1646 transitions. [2018-11-10 08:48:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 08:48:32,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:32,712 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:32,712 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:48:32,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1935153608, now seen corresponding path program 1 times [2018-11-10 08:48:32,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:48:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:48:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:32,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 28 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 08:48:32,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:32,824 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/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-10 08:48:32,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:32,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 08:48:32,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:48:32,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-10 08:48:32,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:48:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:48:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:48:32,969 INFO L87 Difference]: Start difference. First operand 1208 states and 1646 transitions. Second operand 6 states. [2018-11-10 08:48:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:36,157 INFO L93 Difference]: Finished difference Result 3713 states and 5128 transitions. [2018-11-10 08:48:36,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:48:36,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2018-11-10 08:48:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:36,167 INFO L225 Difference]: With dead ends: 3713 [2018-11-10 08:48:36,167 INFO L226 Difference]: Without dead ends: 2511 [2018-11-10 08:48:36,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:48:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2018-11-10 08:48:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2306. [2018-11-10 08:48:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2018-11-10 08:48:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3059 transitions. [2018-11-10 08:48:36,226 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3059 transitions. Word has length 192 [2018-11-10 08:48:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:36,226 INFO L481 AbstractCegarLoop]: Abstraction has 2306 states and 3059 transitions. [2018-11-10 08:48:36,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:48:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3059 transitions. [2018-11-10 08:48:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-10 08:48:36,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:36,233 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:36,234 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:48:36,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:36,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2141226182, now seen corresponding path program 1 times [2018-11-10 08:48:36,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:48:36,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:48:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:36,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 116 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 08:48:36,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:36,802 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/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-10 08:48:36,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:36,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 08:48:37,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:48:37,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2018-11-10 08:48:37,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 08:48:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 08:48:37,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:48:37,010 INFO L87 Difference]: Start difference. First operand 2306 states and 3059 transitions. Second operand 17 states. [2018-11-10 08:48:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:40,240 INFO L93 Difference]: Finished difference Result 6576 states and 9914 transitions. [2018-11-10 08:48:40,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 08:48:40,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 263 [2018-11-10 08:48:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:40,272 INFO L225 Difference]: With dead ends: 6576 [2018-11-10 08:48:40,272 INFO L226 Difference]: Without dead ends: 4276 [2018-11-10 08:48:40,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=649, Invalid=2107, Unknown=0, NotChecked=0, Total=2756 [2018-11-10 08:48:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2018-11-10 08:48:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4026. [2018-11-10 08:48:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4026 states. [2018-11-10 08:48:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 4994 transitions. [2018-11-10 08:48:40,410 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 4994 transitions. Word has length 263 [2018-11-10 08:48:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:40,411 INFO L481 AbstractCegarLoop]: Abstraction has 4026 states and 4994 transitions. [2018-11-10 08:48:40,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 08:48:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 4994 transitions. [2018-11-10 08:48:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-10 08:48:40,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:40,421 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:48:40,422 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:48:40,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1286612862, now seen corresponding path program 1 times [2018-11-10 08:48:40,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:48:40,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:48:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:40,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 42 proven. 140 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-10 08:48:40,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:40,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:48:40,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:40,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-10 08:48:40,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:48:40,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-10 08:48:40,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:48:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:48:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:48:40,735 INFO L87 Difference]: Start difference. First operand 4026 states and 4994 transitions. Second operand 9 states. [2018-11-10 08:48:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:48:41,730 INFO L93 Difference]: Finished difference Result 7969 states and 9981 transitions. [2018-11-10 08:48:41,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 08:48:41,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 267 [2018-11-10 08:48:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:48:41,738 INFO L225 Difference]: With dead ends: 7969 [2018-11-10 08:48:41,739 INFO L226 Difference]: Without dead ends: 4286 [2018-11-10 08:48:41,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2018-11-10 08:48:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2018-11-10 08:48:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 3739. [2018-11-10 08:48:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2018-11-10 08:48:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 4413 transitions. [2018-11-10 08:48:41,811 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 4413 transitions. Word has length 267 [2018-11-10 08:48:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:48:41,811 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 4413 transitions. [2018-11-10 08:48:41,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:48:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 4413 transitions. [2018-11-10 08:48:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-10 08:48:41,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:48:41,820 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 08:48:41,820 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:48:41,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:48:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash -573304603, now seen corresponding path program 1 times [2018-11-10 08:48:41,821 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:48:41,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:48:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:48:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 133 proven. 158 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 08:48:42,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:48:42,260 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:48:42,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:48:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:48:42,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:48:42,631 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 39 [2018-11-10 08:48:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 277 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 08:48:43,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:48:43,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2018-11-10 08:48:43,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 08:48:43,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 08:48:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-11-10 08:48:43,033 INFO L87 Difference]: Start difference. First operand 3739 states and 4413 transitions. Second operand 18 states. [2018-11-10 08:49:05,201 WARN L179 SmtUtils]: Spent 11.17 s on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-11-10 08:49:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:49:19,886 INFO L93 Difference]: Finished difference Result 11225 states and 13899 transitions. [2018-11-10 08:49:19,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 08:49:19,886 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 308 [2018-11-10 08:49:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:49:19,902 INFO L225 Difference]: With dead ends: 11225 [2018-11-10 08:49:19,902 INFO L226 Difference]: Without dead ends: 7637 [2018-11-10 08:49:19,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=558, Invalid=2198, Unknown=0, NotChecked=0, Total=2756 [2018-11-10 08:49:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7637 states. [2018-11-10 08:49:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7637 to 7189. [2018-11-10 08:49:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7189 states. [2018-11-10 08:49:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7189 states to 7189 states and 8515 transitions. [2018-11-10 08:49:20,022 INFO L78 Accepts]: Start accepts. Automaton has 7189 states and 8515 transitions. Word has length 308 [2018-11-10 08:49:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:49:20,023 INFO L481 AbstractCegarLoop]: Abstraction has 7189 states and 8515 transitions. [2018-11-10 08:49:20,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 08:49:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 7189 states and 8515 transitions. [2018-11-10 08:49:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-10 08:49:20,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:49:20,036 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 08:49:20,036 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:49:20,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:49:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash -372002746, now seen corresponding path program 1 times [2018-11-10 08:49:20,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:49:20,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:49:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:20,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:49:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:49:20,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:49:20,567 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:49:20,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:49:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:49:20,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:50:50,115 WARN L179 SmtUtils]: Spent 1.30 m on a formula simplification. DAG size of input: 1629 DAG size of output: 281 [2018-11-10 08:50:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 48 proven. 167 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 08:50:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:50:50,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2018-11-10 08:50:50,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 08:50:50,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 08:50:50,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=317, Unknown=4, NotChecked=0, Total=380 [2018-11-10 08:50:50,588 INFO L87 Difference]: Start difference. First operand 7189 states and 8515 transitions. Second operand 20 states. [2018-11-10 08:52:09,194 WARN L179 SmtUtils]: Spent 55.62 s on a formula simplification. DAG size of input: 294 DAG size of output: 269 [2018-11-10 08:53:45,007 WARN L179 SmtUtils]: Spent 58.43 s on a formula simplification that was a NOOP. DAG size: 288 [2018-11-10 08:54:15,746 WARN L179 SmtUtils]: Spent 12.21 s on a formula simplification. DAG size of input: 290 DAG size of output: 57 [2018-11-10 08:54:59,590 WARN L179 SmtUtils]: Spent 26.39 s on a formula simplification that was a NOOP. DAG size: 287 [2018-11-10 08:55:06,055 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~a10~0 |c_old(~a10~0)|)) (.cse43 (= c_~a12~0 0)) (.cse45 (= c_~a4~0 14))) (and .cse0 (or (exists ((v_prenex_99 Int)) (let ((.cse4 (* 9 v_prenex_99))) (let ((.cse1 (div .cse4 10))) (let ((.cse3 (+ .cse1 1))) (let ((.cse2 (mod .cse3 299993))) (and (= 0 (mod .cse1 299993)) (<= |c_old(~a1~0)| v_prenex_99) (= (mod .cse2 5) 0) (<= 0 .cse3) (<= (+ c_~a1~0 75819) (div (+ .cse2 (- 300005)) 5)) (not (= (mod .cse4 10) 0)) (< .cse4 0))))))) (exists ((v_prenex_98 Int)) (let ((.cse7 (* 9 v_prenex_98))) (let ((.cse5 (div .cse7 10))) (let ((.cse6 (mod .cse5 299993))) (and (= (mod (+ .cse5 1) 299993) 0) (<= |c_old(~a1~0)| v_prenex_98) (< .cse6 300005) (<= (+ c_~a1~0 75818) (div (+ .cse6 (- 300005)) 5)) (= 0 .cse6) (= (mod .cse7 10) 0) (not (= (mod .cse6 5) 0))))))) (exists ((v_prenex_86 Int)) (let ((.cse8 (* 9 v_prenex_86))) (let ((.cse10 (div .cse8 10))) (let ((.cse9 (mod .cse10 299993))) (and (<= 0 .cse8) (<= (+ c_~a1~0 75818) (div (+ .cse9 (- 300005)) 5)) (<= 0 .cse10) (<= |c_old(~a1~0)| v_prenex_86) (<= 0 (+ .cse10 1)) (< .cse9 300005) (not (= (mod .cse9 5) 0))))))) (exists ((v_prenex_36 Int)) (let ((.cse12 (* 9 v_prenex_36))) (let ((.cse14 (div .cse12 10))) (let ((.cse13 (+ .cse14 1))) (let ((.cse11 (mod .cse13 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse11 (- 300005)) 5)) (< .cse11 300005) (not (= (mod .cse11 5) 0)) (< .cse12 0) (<= |c_old(~a1~0)| v_prenex_36) (<= 0 .cse13) (not (= (mod .cse12 10) 0)) (not (= 0 (mod .cse14 299993))) (< .cse14 0))))))) (exists ((v_prenex_67 Int)) (let ((.cse17 (* 9 v_prenex_67))) (let ((.cse16 (div .cse17 10))) (let ((.cse15 (mod (+ .cse16 1) 299993))) (and (<= |c_old(~a1~0)| v_prenex_67) (not (= (mod .cse15 5) 0)) (< .cse16 0) (not (= 0 (mod .cse16 299993))) (<= (+ c_~a1~0 75818) (div (+ .cse15 (- 300005)) 5)) (= .cse15 0) (< .cse17 0) (not (= (mod .cse17 10) 0)) (< .cse15 300005)))))) (exists ((v_prenex_76 Int)) (let ((.cse20 (* 9 v_prenex_76))) (let ((.cse18 (div .cse20 10))) (let ((.cse19 (mod (+ .cse18 1) 299993))) (and (= 0 (mod .cse18 299993)) (<= |c_old(~a1~0)| v_prenex_76) (<= (+ c_~a1~0 75818) (div (+ .cse19 (- 300005)) 5)) (not (= (mod .cse19 5) 0)) (= .cse19 0) (not (= (mod .cse20 10) 0)) (< .cse20 0) (< .cse19 300005)))))) (exists ((v_prenex_41 Int)) (let ((.cse22 (* 9 v_prenex_41))) (let ((.cse21 (div .cse22 10))) (let ((.cse23 (mod .cse21 299993))) (and (<= |c_old(~a1~0)| v_prenex_41) (<= 0 .cse21) (<= 0 .cse22) (<= 0 (+ .cse21 1)) (= (mod .cse23 5) 0) (<= (+ c_~a1~0 75819) (div (+ .cse23 (- 300005)) 5))))))) (exists ((v_prenex_96 Int)) (let ((.cse26 (* 9 v_prenex_96))) (let ((.cse24 (div .cse26 10))) (let ((.cse25 (mod .cse24 299993))) (and (< .cse24 0) (<= |c_old(~a1~0)| v_prenex_96) (= (mod (+ .cse24 1) 299993) 0) (not (= 0 .cse25)) (<= (+ c_~a1~0 75818) (div (+ .cse25 (- 599998)) 5)) (not (= (mod (+ .cse25 2) 5) 0)) (< .cse25 599998) (= (mod .cse26 10) 0)))))) (exists ((v_prenex_53 Int)) (let ((.cse28 (* 9 v_prenex_53))) (let ((.cse30 (div .cse28 10))) (let ((.cse29 (+ .cse30 1))) (let ((.cse27 (mod .cse29 299993))) (and (< .cse27 599998) (not (= (mod .cse28 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse27 (- 599998)) 5)) (not (= .cse27 0)) (< .cse29 0) (< .cse28 0) (not (= 0 (mod (+ .cse27 2) 5))) (< .cse30 0) (<= |c_old(~a1~0)| v_prenex_53) (not (= 0 (mod .cse30 299993))))))))) (exists ((v_prenex_90 Int)) (let ((.cse31 (* 9 v_prenex_90))) (let ((.cse34 (div .cse31 10))) (let ((.cse33 (+ .cse34 1))) (let ((.cse32 (mod .cse33 299993))) (and (not (= (mod .cse31 10) 0)) (<= |c_old(~a1~0)| v_prenex_90) (<= (+ c_~a1~0 75819) (div (+ .cse32 (- 300005)) 5)) (<= 0 .cse33) (= (mod .cse32 5) 0) (not (= 0 (mod .cse34 299993))) (< .cse31 0) (< .cse34 0))))))) (exists ((v_prenex_35 Int)) (let ((.cse37 (* 9 v_prenex_35))) (let ((.cse36 (div .cse37 10))) (let ((.cse35 (+ .cse36 1)) (.cse38 (mod .cse36 299993))) (and (not (= (mod .cse35 299993) 0)) (< .cse36 0) (<= |c_old(~a1~0)| v_prenex_35) (= (mod .cse37 10) 0) (< .cse35 0) (<= (+ c_~a1~0 75818) (div (+ .cse38 (- 599998)) 5)) (< .cse38 599998) (not (= 0 .cse38)) (not (= (mod (+ .cse38 2) 5) 0))))))) (exists ((v_prenex_30 Int)) (let ((.cse39 (* 9 v_prenex_30))) (let ((.cse42 (div .cse39 10))) (let ((.cse40 (mod .cse42 299993)) (.cse41 (+ .cse42 1))) (and (= (mod .cse39 10) 0) (not (= (mod .cse40 5) 0)) (< .cse41 0) (<= (+ c_~a1~0 75818) (div (+ .cse40 (- 300005)) 5)) (< .cse40 300005) (= 0 .cse40) (not (= (mod .cse41 299993) 0)) (<= |c_old(~a1~0)| v_prenex_30))))))) .cse43 (= c_~a19~0 |c_old(~a19~0)|) (or (let ((.cse44 (= 0 c_~a10~0))) (and (or .cse44 .cse0) (or (and (= |c_old(~a19~0)| c_~a19~0) (not (= c_~a19~0 9))) (not .cse44)))) (not .cse45) (not .cse43) (< 0 (+ c_~a1~0 13))) .cse45 (= c_~a1~0 |c_old(~a1~0)|))) is different from false [2018-11-10 08:55:08,367 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse42 (= c_~a12~0 0)) (.cse44 (= c_~a4~0 14))) (and (<= c_~a1~0 |c_old(~a1~0)|) (or (exists ((v_prenex_99 Int)) (let ((.cse3 (* 9 v_prenex_99))) (let ((.cse0 (div .cse3 10))) (let ((.cse2 (+ .cse0 1))) (let ((.cse1 (mod .cse2 299993))) (and (= 0 (mod .cse0 299993)) (<= |c_old(~a1~0)| v_prenex_99) (= (mod .cse1 5) 0) (<= 0 .cse2) (<= (+ c_~a1~0 75819) (div (+ .cse1 (- 300005)) 5)) (not (= (mod .cse3 10) 0)) (< .cse3 0))))))) (exists ((v_prenex_98 Int)) (let ((.cse6 (* 9 v_prenex_98))) (let ((.cse4 (div .cse6 10))) (let ((.cse5 (mod .cse4 299993))) (and (= (mod (+ .cse4 1) 299993) 0) (<= |c_old(~a1~0)| v_prenex_98) (< .cse5 300005) (<= (+ c_~a1~0 75818) (div (+ .cse5 (- 300005)) 5)) (= 0 .cse5) (= (mod .cse6 10) 0) (not (= (mod .cse5 5) 0))))))) (exists ((v_prenex_86 Int)) (let ((.cse7 (* 9 v_prenex_86))) (let ((.cse9 (div .cse7 10))) (let ((.cse8 (mod .cse9 299993))) (and (<= 0 .cse7) (<= (+ c_~a1~0 75818) (div (+ .cse8 (- 300005)) 5)) (<= 0 .cse9) (<= |c_old(~a1~0)| v_prenex_86) (<= 0 (+ .cse9 1)) (< .cse8 300005) (not (= (mod .cse8 5) 0))))))) (exists ((v_prenex_36 Int)) (let ((.cse11 (* 9 v_prenex_36))) (let ((.cse13 (div .cse11 10))) (let ((.cse12 (+ .cse13 1))) (let ((.cse10 (mod .cse12 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse10 (- 300005)) 5)) (< .cse10 300005) (not (= (mod .cse10 5) 0)) (< .cse11 0) (<= |c_old(~a1~0)| v_prenex_36) (<= 0 .cse12) (not (= (mod .cse11 10) 0)) (not (= 0 (mod .cse13 299993))) (< .cse13 0))))))) (exists ((v_prenex_67 Int)) (let ((.cse16 (* 9 v_prenex_67))) (let ((.cse15 (div .cse16 10))) (let ((.cse14 (mod (+ .cse15 1) 299993))) (and (<= |c_old(~a1~0)| v_prenex_67) (not (= (mod .cse14 5) 0)) (< .cse15 0) (not (= 0 (mod .cse15 299993))) (<= (+ c_~a1~0 75818) (div (+ .cse14 (- 300005)) 5)) (= .cse14 0) (< .cse16 0) (not (= (mod .cse16 10) 0)) (< .cse14 300005)))))) (exists ((v_prenex_76 Int)) (let ((.cse19 (* 9 v_prenex_76))) (let ((.cse17 (div .cse19 10))) (let ((.cse18 (mod (+ .cse17 1) 299993))) (and (= 0 (mod .cse17 299993)) (<= |c_old(~a1~0)| v_prenex_76) (<= (+ c_~a1~0 75818) (div (+ .cse18 (- 300005)) 5)) (not (= (mod .cse18 5) 0)) (= .cse18 0) (not (= (mod .cse19 10) 0)) (< .cse19 0) (< .cse18 300005)))))) (exists ((v_prenex_41 Int)) (let ((.cse21 (* 9 v_prenex_41))) (let ((.cse20 (div .cse21 10))) (let ((.cse22 (mod .cse20 299993))) (and (<= |c_old(~a1~0)| v_prenex_41) (<= 0 .cse20) (<= 0 .cse21) (<= 0 (+ .cse20 1)) (= (mod .cse22 5) 0) (<= (+ c_~a1~0 75819) (div (+ .cse22 (- 300005)) 5))))))) (exists ((v_prenex_96 Int)) (let ((.cse25 (* 9 v_prenex_96))) (let ((.cse23 (div .cse25 10))) (let ((.cse24 (mod .cse23 299993))) (and (< .cse23 0) (<= |c_old(~a1~0)| v_prenex_96) (= (mod (+ .cse23 1) 299993) 0) (not (= 0 .cse24)) (<= (+ c_~a1~0 75818) (div (+ .cse24 (- 599998)) 5)) (not (= (mod (+ .cse24 2) 5) 0)) (< .cse24 599998) (= (mod .cse25 10) 0)))))) (exists ((v_prenex_53 Int)) (let ((.cse27 (* 9 v_prenex_53))) (let ((.cse29 (div .cse27 10))) (let ((.cse28 (+ .cse29 1))) (let ((.cse26 (mod .cse28 299993))) (and (< .cse26 599998) (not (= (mod .cse27 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse26 (- 599998)) 5)) (not (= .cse26 0)) (< .cse28 0) (< .cse27 0) (not (= 0 (mod (+ .cse26 2) 5))) (< .cse29 0) (<= |c_old(~a1~0)| v_prenex_53) (not (= 0 (mod .cse29 299993))))))))) (exists ((v_prenex_90 Int)) (let ((.cse30 (* 9 v_prenex_90))) (let ((.cse33 (div .cse30 10))) (let ((.cse32 (+ .cse33 1))) (let ((.cse31 (mod .cse32 299993))) (and (not (= (mod .cse30 10) 0)) (<= |c_old(~a1~0)| v_prenex_90) (<= (+ c_~a1~0 75819) (div (+ .cse31 (- 300005)) 5)) (<= 0 .cse32) (= (mod .cse31 5) 0) (not (= 0 (mod .cse33 299993))) (< .cse30 0) (< .cse33 0))))))) (exists ((v_prenex_35 Int)) (let ((.cse36 (* 9 v_prenex_35))) (let ((.cse35 (div .cse36 10))) (let ((.cse34 (+ .cse35 1)) (.cse37 (mod .cse35 299993))) (and (not (= (mod .cse34 299993) 0)) (< .cse35 0) (<= |c_old(~a1~0)| v_prenex_35) (= (mod .cse36 10) 0) (< .cse34 0) (<= (+ c_~a1~0 75818) (div (+ .cse37 (- 599998)) 5)) (< .cse37 599998) (not (= 0 .cse37)) (not (= (mod (+ .cse37 2) 5) 0))))))) (exists ((v_prenex_30 Int)) (let ((.cse38 (* 9 v_prenex_30))) (let ((.cse41 (div .cse38 10))) (let ((.cse39 (mod .cse41 299993)) (.cse40 (+ .cse41 1))) (and (= (mod .cse38 10) 0) (not (= (mod .cse39 5) 0)) (< .cse40 0) (<= (+ c_~a1~0 75818) (div (+ .cse39 (- 300005)) 5)) (< .cse39 300005) (= 0 .cse39) (not (= (mod .cse40 299993) 0)) (<= |c_old(~a1~0)| v_prenex_30))))))) .cse42 (or (let ((.cse43 (= 0 c_~a10~0))) (and (or .cse43 (= c_~a10~0 |c_old(~a10~0)|)) (or (and (= |c_old(~a19~0)| c_~a19~0) (not (= c_~a19~0 9))) (not .cse43)))) (not .cse44) (not .cse42) (< 0 (+ c_~a1~0 13))) .cse44)) is different from false [2018-11-10 08:58:50,637 WARN L179 SmtUtils]: Spent 2.00 m on a formula simplification. DAG size of input: 309 DAG size of output: 279 [2018-11-10 08:59:01,302 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~a10~0 |c_old(~a10~0)|)) (.cse43 (= c_~a12~0 0)) (.cse45 (= c_~a4~0 14))) (and .cse0 (or (exists ((v_prenex_99 Int)) (let ((.cse4 (* 9 v_prenex_99))) (let ((.cse1 (div .cse4 10))) (let ((.cse3 (+ .cse1 1))) (let ((.cse2 (mod .cse3 299993))) (and (= 0 (mod .cse1 299993)) (<= |c_old(~a1~0)| v_prenex_99) (= (mod .cse2 5) 0) (<= 0 .cse3) (<= (+ c_~a1~0 75819) (div (+ .cse2 (- 300005)) 5)) (not (= (mod .cse4 10) 0)) (< .cse4 0))))))) (exists ((v_prenex_98 Int)) (let ((.cse7 (* 9 v_prenex_98))) (let ((.cse5 (div .cse7 10))) (let ((.cse6 (mod .cse5 299993))) (and (= (mod (+ .cse5 1) 299993) 0) (<= |c_old(~a1~0)| v_prenex_98) (< .cse6 300005) (<= (+ c_~a1~0 75818) (div (+ .cse6 (- 300005)) 5)) (= 0 .cse6) (= (mod .cse7 10) 0) (not (= (mod .cse6 5) 0))))))) (exists ((v_prenex_86 Int)) (let ((.cse8 (* 9 v_prenex_86))) (let ((.cse10 (div .cse8 10))) (let ((.cse9 (mod .cse10 299993))) (and (<= 0 .cse8) (<= (+ c_~a1~0 75818) (div (+ .cse9 (- 300005)) 5)) (<= 0 .cse10) (<= |c_old(~a1~0)| v_prenex_86) (<= 0 (+ .cse10 1)) (< .cse9 300005) (not (= (mod .cse9 5) 0))))))) (exists ((v_prenex_36 Int)) (let ((.cse12 (* 9 v_prenex_36))) (let ((.cse14 (div .cse12 10))) (let ((.cse13 (+ .cse14 1))) (let ((.cse11 (mod .cse13 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse11 (- 300005)) 5)) (< .cse11 300005) (not (= (mod .cse11 5) 0)) (< .cse12 0) (<= |c_old(~a1~0)| v_prenex_36) (<= 0 .cse13) (not (= (mod .cse12 10) 0)) (not (= 0 (mod .cse14 299993))) (< .cse14 0))))))) (exists ((v_prenex_67 Int)) (let ((.cse17 (* 9 v_prenex_67))) (let ((.cse16 (div .cse17 10))) (let ((.cse15 (mod (+ .cse16 1) 299993))) (and (<= |c_old(~a1~0)| v_prenex_67) (not (= (mod .cse15 5) 0)) (< .cse16 0) (not (= 0 (mod .cse16 299993))) (<= (+ c_~a1~0 75818) (div (+ .cse15 (- 300005)) 5)) (= .cse15 0) (< .cse17 0) (not (= (mod .cse17 10) 0)) (< .cse15 300005)))))) (exists ((v_prenex_76 Int)) (let ((.cse20 (* 9 v_prenex_76))) (let ((.cse18 (div .cse20 10))) (let ((.cse19 (mod (+ .cse18 1) 299993))) (and (= 0 (mod .cse18 299993)) (<= |c_old(~a1~0)| v_prenex_76) (<= (+ c_~a1~0 75818) (div (+ .cse19 (- 300005)) 5)) (not (= (mod .cse19 5) 0)) (= .cse19 0) (not (= (mod .cse20 10) 0)) (< .cse20 0) (< .cse19 300005)))))) (exists ((v_prenex_41 Int)) (let ((.cse22 (* 9 v_prenex_41))) (let ((.cse21 (div .cse22 10))) (let ((.cse23 (mod .cse21 299993))) (and (<= |c_old(~a1~0)| v_prenex_41) (<= 0 .cse21) (<= 0 .cse22) (<= 0 (+ .cse21 1)) (= (mod .cse23 5) 0) (<= (+ c_~a1~0 75819) (div (+ .cse23 (- 300005)) 5))))))) (exists ((v_prenex_96 Int)) (let ((.cse26 (* 9 v_prenex_96))) (let ((.cse24 (div .cse26 10))) (let ((.cse25 (mod .cse24 299993))) (and (< .cse24 0) (<= |c_old(~a1~0)| v_prenex_96) (= (mod (+ .cse24 1) 299993) 0) (not (= 0 .cse25)) (<= (+ c_~a1~0 75818) (div (+ .cse25 (- 599998)) 5)) (not (= (mod (+ .cse25 2) 5) 0)) (< .cse25 599998) (= (mod .cse26 10) 0)))))) (exists ((v_prenex_53 Int)) (let ((.cse28 (* 9 v_prenex_53))) (let ((.cse30 (div .cse28 10))) (let ((.cse29 (+ .cse30 1))) (let ((.cse27 (mod .cse29 299993))) (and (< .cse27 599998) (not (= (mod .cse28 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse27 (- 599998)) 5)) (not (= .cse27 0)) (< .cse29 0) (< .cse28 0) (not (= 0 (mod (+ .cse27 2) 5))) (< .cse30 0) (<= |c_old(~a1~0)| v_prenex_53) (not (= 0 (mod .cse30 299993))))))))) (exists ((v_prenex_90 Int)) (let ((.cse31 (* 9 v_prenex_90))) (let ((.cse34 (div .cse31 10))) (let ((.cse33 (+ .cse34 1))) (let ((.cse32 (mod .cse33 299993))) (and (not (= (mod .cse31 10) 0)) (<= |c_old(~a1~0)| v_prenex_90) (<= (+ c_~a1~0 75819) (div (+ .cse32 (- 300005)) 5)) (<= 0 .cse33) (= (mod .cse32 5) 0) (not (= 0 (mod .cse34 299993))) (< .cse31 0) (< .cse34 0))))))) (exists ((v_prenex_35 Int)) (let ((.cse37 (* 9 v_prenex_35))) (let ((.cse36 (div .cse37 10))) (let ((.cse35 (+ .cse36 1)) (.cse38 (mod .cse36 299993))) (and (not (= (mod .cse35 299993) 0)) (< .cse36 0) (<= |c_old(~a1~0)| v_prenex_35) (= (mod .cse37 10) 0) (< .cse35 0) (<= (+ c_~a1~0 75818) (div (+ .cse38 (- 599998)) 5)) (< .cse38 599998) (not (= 0 .cse38)) (not (= (mod (+ .cse38 2) 5) 0))))))) (exists ((v_prenex_30 Int)) (let ((.cse39 (* 9 v_prenex_30))) (let ((.cse42 (div .cse39 10))) (let ((.cse40 (mod .cse42 299993)) (.cse41 (+ .cse42 1))) (and (= (mod .cse39 10) 0) (not (= (mod .cse40 5) 0)) (< .cse41 0) (<= (+ c_~a1~0 75818) (div (+ .cse40 (- 300005)) 5)) (< .cse40 300005) (= 0 .cse40) (not (= (mod .cse41 299993) 0)) (<= |c_old(~a1~0)| v_prenex_30))))))) .cse43 (= c_~a19~0 |c_old(~a19~0)|) (or (let ((.cse44 (= 0 c_~a10~0))) (and (or .cse44 .cse0) (or (and (= |c_old(~a19~0)| c_~a19~0) (not (= c_~a19~0 9))) (not .cse44)))) (not .cse45) (not .cse43) (< 0 (+ c_~a1~0 13))) .cse45)) is different from false [2018-11-10 09:00:11,929 WARN L832 $PredicateComparison]: unable to prove that (and (= 0 c_~a10~0) (= c_~a10~0 |c_old(~a10~0)|) (or (exists ((v_prenex_99 Int)) (let ((.cse3 (* 9 v_prenex_99))) (let ((.cse0 (div .cse3 10))) (let ((.cse2 (+ .cse0 1))) (let ((.cse1 (mod .cse2 299993))) (and (= 0 (mod .cse0 299993)) (<= |c_old(~a1~0)| v_prenex_99) (= (mod .cse1 5) 0) (<= 0 .cse2) (<= (+ c_~a1~0 75819) (div (+ .cse1 (- 300005)) 5)) (not (= (mod .cse3 10) 0)) (< .cse3 0))))))) (exists ((v_prenex_98 Int)) (let ((.cse6 (* 9 v_prenex_98))) (let ((.cse4 (div .cse6 10))) (let ((.cse5 (mod .cse4 299993))) (and (= (mod (+ .cse4 1) 299993) 0) (<= |c_old(~a1~0)| v_prenex_98) (< .cse5 300005) (<= (+ c_~a1~0 75818) (div (+ .cse5 (- 300005)) 5)) (= 0 .cse5) (= (mod .cse6 10) 0) (not (= (mod .cse5 5) 0))))))) (exists ((v_prenex_86 Int)) (let ((.cse7 (* 9 v_prenex_86))) (let ((.cse9 (div .cse7 10))) (let ((.cse8 (mod .cse9 299993))) (and (<= 0 .cse7) (<= (+ c_~a1~0 75818) (div (+ .cse8 (- 300005)) 5)) (<= 0 .cse9) (<= |c_old(~a1~0)| v_prenex_86) (<= 0 (+ .cse9 1)) (< .cse8 300005) (not (= (mod .cse8 5) 0))))))) (exists ((v_prenex_36 Int)) (let ((.cse11 (* 9 v_prenex_36))) (let ((.cse13 (div .cse11 10))) (let ((.cse12 (+ .cse13 1))) (let ((.cse10 (mod .cse12 299993))) (and (<= (+ c_~a1~0 75818) (div (+ .cse10 (- 300005)) 5)) (< .cse10 300005) (not (= (mod .cse10 5) 0)) (< .cse11 0) (<= |c_old(~a1~0)| v_prenex_36) (<= 0 .cse12) (not (= (mod .cse11 10) 0)) (not (= 0 (mod .cse13 299993))) (< .cse13 0))))))) (exists ((v_prenex_67 Int)) (let ((.cse16 (* 9 v_prenex_67))) (let ((.cse15 (div .cse16 10))) (let ((.cse14 (mod (+ .cse15 1) 299993))) (and (<= |c_old(~a1~0)| v_prenex_67) (not (= (mod .cse14 5) 0)) (< .cse15 0) (not (= 0 (mod .cse15 299993))) (<= (+ c_~a1~0 75818) (div (+ .cse14 (- 300005)) 5)) (= .cse14 0) (< .cse16 0) (not (= (mod .cse16 10) 0)) (< .cse14 300005)))))) (exists ((v_prenex_76 Int)) (let ((.cse19 (* 9 v_prenex_76))) (let ((.cse17 (div .cse19 10))) (let ((.cse18 (mod (+ .cse17 1) 299993))) (and (= 0 (mod .cse17 299993)) (<= |c_old(~a1~0)| v_prenex_76) (<= (+ c_~a1~0 75818) (div (+ .cse18 (- 300005)) 5)) (not (= (mod .cse18 5) 0)) (= .cse18 0) (not (= (mod .cse19 10) 0)) (< .cse19 0) (< .cse18 300005)))))) (exists ((v_prenex_41 Int)) (let ((.cse21 (* 9 v_prenex_41))) (let ((.cse20 (div .cse21 10))) (let ((.cse22 (mod .cse20 299993))) (and (<= |c_old(~a1~0)| v_prenex_41) (<= 0 .cse20) (<= 0 .cse21) (<= 0 (+ .cse20 1)) (= (mod .cse22 5) 0) (<= (+ c_~a1~0 75819) (div (+ .cse22 (- 300005)) 5))))))) (exists ((v_prenex_96 Int)) (let ((.cse25 (* 9 v_prenex_96))) (let ((.cse23 (div .cse25 10))) (let ((.cse24 (mod .cse23 299993))) (and (< .cse23 0) (<= |c_old(~a1~0)| v_prenex_96) (= (mod (+ .cse23 1) 299993) 0) (not (= 0 .cse24)) (<= (+ c_~a1~0 75818) (div (+ .cse24 (- 599998)) 5)) (not (= (mod (+ .cse24 2) 5) 0)) (< .cse24 599998) (= (mod .cse25 10) 0)))))) (exists ((v_prenex_53 Int)) (let ((.cse27 (* 9 v_prenex_53))) (let ((.cse29 (div .cse27 10))) (let ((.cse28 (+ .cse29 1))) (let ((.cse26 (mod .cse28 299993))) (and (< .cse26 599998) (not (= (mod .cse27 10) 0)) (<= (+ c_~a1~0 75818) (div (+ .cse26 (- 599998)) 5)) (not (= .cse26 0)) (< .cse28 0) (< .cse27 0) (not (= 0 (mod (+ .cse26 2) 5))) (< .cse29 0) (<= |c_old(~a1~0)| v_prenex_53) (not (= 0 (mod .cse29 299993))))))))) (exists ((v_prenex_90 Int)) (let ((.cse30 (* 9 v_prenex_90))) (let ((.cse33 (div .cse30 10))) (let ((.cse32 (+ .cse33 1))) (let ((.cse31 (mod .cse32 299993))) (and (not (= (mod .cse30 10) 0)) (<= |c_old(~a1~0)| v_prenex_90) (<= (+ c_~a1~0 75819) (div (+ .cse31 (- 300005)) 5)) (<= 0 .cse32) (= (mod .cse31 5) 0) (not (= 0 (mod .cse33 299993))) (< .cse30 0) (< .cse33 0))))))) (exists ((v_prenex_35 Int)) (let ((.cse36 (* 9 v_prenex_35))) (let ((.cse35 (div .cse36 10))) (let ((.cse34 (+ .cse35 1)) (.cse37 (mod .cse35 299993))) (and (not (= (mod .cse34 299993) 0)) (< .cse35 0) (<= |c_old(~a1~0)| v_prenex_35) (= (mod .cse36 10) 0) (< .cse34 0) (<= (+ c_~a1~0 75818) (div (+ .cse37 (- 599998)) 5)) (< .cse37 599998) (not (= 0 .cse37)) (not (= (mod (+ .cse37 2) 5) 0))))))) (exists ((v_prenex_30 Int)) (let ((.cse38 (* 9 v_prenex_30))) (let ((.cse41 (div .cse38 10))) (let ((.cse39 (mod .cse41 299993)) (.cse40 (+ .cse41 1))) (and (= (mod .cse38 10) 0) (not (= (mod .cse39 5) 0)) (< .cse40 0) (<= (+ c_~a1~0 75818) (div (+ .cse39 (- 300005)) 5)) (< .cse39 300005) (= 0 .cse39) (not (= (mod .cse40 299993) 0)) (<= |c_old(~a1~0)| v_prenex_30))))))) (= c_~a12~0 0) (= c_~a19~0 |c_old(~a19~0)|) (= c_~a4~0 14) (= 9 c_~a19~0) (= c_~a1~0 |c_old(~a1~0)|)) is different from false [2018-11-10 09:00:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:00:26,972 INFO L93 Difference]: Finished difference Result 17111 states and 21357 transitions. [2018-11-10 09:00:26,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-10 09:00:26,984 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 327 [2018-11-10 09:00:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:00:27,013 INFO L225 Difference]: With dead ends: 17111 [2018-11-10 09:00:27,013 INFO L226 Difference]: Without dead ends: 9920 [2018-11-10 09:00:27,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 506.1s TimeCoverageRelationStatistics Valid=1206, Invalid=5548, Unknown=68, NotChecked=660, Total=7482 [2018-11-10 09:00:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9920 states. [2018-11-10 09:00:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9920 to 8709. [2018-11-10 09:00:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8709 states. [2018-11-10 09:00:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 10394 transitions. [2018-11-10 09:00:27,232 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 10394 transitions. Word has length 327 [2018-11-10 09:00:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:00:27,232 INFO L481 AbstractCegarLoop]: Abstraction has 8709 states and 10394 transitions. [2018-11-10 09:00:27,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 09:00:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 10394 transitions. [2018-11-10 09:00:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-11-10 09:00:27,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:00:27,291 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:00:27,292 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:00:27,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:00:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash 249953308, now seen corresponding path program 1 times [2018-11-10 09:00:27,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:00:27,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:00:27,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:27,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:27,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 134 proven. 82 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 09:00:27,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:27,809 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:00:27,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:27,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:00:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 280 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 09:00:27,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:00:27,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-10 09:00:27,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 09:00:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 09:00:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:00:27,953 INFO L87 Difference]: Start difference. First operand 8709 states and 10394 transitions. Second operand 15 states. [2018-11-10 09:00:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:00:30,676 INFO L93 Difference]: Finished difference Result 17835 states and 21918 transitions. [2018-11-10 09:00:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 09:00:30,677 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 331 [2018-11-10 09:00:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:00:30,699 INFO L225 Difference]: With dead ends: 17835 [2018-11-10 09:00:30,699 INFO L226 Difference]: Without dead ends: 9276 [2018-11-10 09:00:30,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=584, Invalid=1866, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 09:00:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2018-11-10 09:00:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9152. [2018-11-10 09:00:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9152 states. [2018-11-10 09:00:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9152 states to 9152 states and 10665 transitions. [2018-11-10 09:00:30,910 INFO L78 Accepts]: Start accepts. Automaton has 9152 states and 10665 transitions. Word has length 331 [2018-11-10 09:00:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:00:30,910 INFO L481 AbstractCegarLoop]: Abstraction has 9152 states and 10665 transitions. [2018-11-10 09:00:30,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 09:00:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9152 states and 10665 transitions. [2018-11-10 09:00:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-10 09:00:30,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:00:30,916 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:30,917 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:00:30,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:00:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 558776319, now seen corresponding path program 1 times [2018-11-10 09:00:30,917 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:00:30,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:00:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:30,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 214 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:00:31,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:31,280 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:00:31,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:31,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:00:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 09:00:32,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:00:32,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 15 [2018-11-10 09:00:32,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 09:00:32,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 09:00:32,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:00:32,839 INFO L87 Difference]: Start difference. First operand 9152 states and 10665 transitions. Second operand 15 states. [2018-11-10 09:00:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:00:38,828 INFO L93 Difference]: Finished difference Result 21789 states and 26077 transitions. [2018-11-10 09:00:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-10 09:00:38,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 336 [2018-11-10 09:00:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:00:38,854 INFO L225 Difference]: With dead ends: 21789 [2018-11-10 09:00:38,855 INFO L226 Difference]: Without dead ends: 12937 [2018-11-10 09:00:38,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=625, Invalid=2237, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 09:00:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12937 states. [2018-11-10 09:00:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12937 to 11175. [2018-11-10 09:00:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11175 states. [2018-11-10 09:00:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11175 states to 11175 states and 12911 transitions. [2018-11-10 09:00:39,083 INFO L78 Accepts]: Start accepts. Automaton has 11175 states and 12911 transitions. Word has length 336 [2018-11-10 09:00:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:00:39,083 INFO L481 AbstractCegarLoop]: Abstraction has 11175 states and 12911 transitions. [2018-11-10 09:00:39,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 09:00:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11175 states and 12911 transitions. [2018-11-10 09:00:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-10 09:00:39,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:00:39,090 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:00:39,091 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:00:39,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:00:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1236242983, now seen corresponding path program 1 times [2018-11-10 09:00:39,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:00:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:00:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:39,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 119 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-10 09:00:39,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:39,367 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:00:39,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:39,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:00:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-10 09:00:39,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:00:39,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-10 09:00:39,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 09:00:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:00:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:00:39,540 INFO L87 Difference]: Start difference. First operand 11175 states and 12911 transitions. Second operand 11 states. [2018-11-10 09:00:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:00:40,809 INFO L93 Difference]: Finished difference Result 21827 states and 25590 transitions. [2018-11-10 09:00:40,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 09:00:40,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 346 [2018-11-10 09:00:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:00:40,829 INFO L225 Difference]: With dead ends: 21827 [2018-11-10 09:00:40,829 INFO L226 Difference]: Without dead ends: 10950 [2018-11-10 09:00:40,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 353 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-11-10 09:00:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2018-11-10 09:00:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 10366. [2018-11-10 09:00:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10366 states. [2018-11-10 09:00:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10366 states to 10366 states and 11762 transitions. [2018-11-10 09:00:41,034 INFO L78 Accepts]: Start accepts. Automaton has 10366 states and 11762 transitions. Word has length 346 [2018-11-10 09:00:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:00:41,035 INFO L481 AbstractCegarLoop]: Abstraction has 10366 states and 11762 transitions. [2018-11-10 09:00:41,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 09:00:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 10366 states and 11762 transitions. [2018-11-10 09:00:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-10 09:00:41,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:00:41,042 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-10 09:00:41,043 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:00:41,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:00:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1572418731, now seen corresponding path program 1 times [2018-11-10 09:00:41,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:00:41,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:00:41,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:41,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:41,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:00:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 132 proven. 122 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 09:00:41,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:00:41,439 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:00:41,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:00:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:00:41,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:00:45,868 WARN L179 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-10 09:00:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:00:48,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:00:48,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-11-10 09:00:48,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 09:00:48,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 09:00:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=282, Unknown=2, NotChecked=0, Total=342 [2018-11-10 09:00:48,091 INFO L87 Difference]: Start difference. First operand 10366 states and 11762 transitions. Second operand 19 states. [2018-11-10 09:01:00,673 WARN L179 SmtUtils]: Spent 12.02 s on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2018-11-10 09:01:39,557 WARN L179 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2018-11-10 09:01:57,674 WARN L179 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-11-10 09:02:16,496 WARN L179 SmtUtils]: Spent 11.96 s on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2018-11-10 09:02:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:37,672 INFO L93 Difference]: Finished difference Result 26262 states and 31107 transitions. [2018-11-10 09:02:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-10 09:02:37,675 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 364 [2018-11-10 09:02:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:02:37,703 INFO L225 Difference]: With dead ends: 26262 [2018-11-10 09:02:37,703 INFO L226 Difference]: Without dead ends: 16194 [2018-11-10 09:02:37,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 368 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=585, Invalid=2828, Unknown=9, NotChecked=0, Total=3422 [2018-11-10 09:02:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16194 states. [2018-11-10 09:02:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16194 to 14016. [2018-11-10 09:02:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14016 states. [2018-11-10 09:02:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14016 states to 14016 states and 15732 transitions. [2018-11-10 09:02:37,950 INFO L78 Accepts]: Start accepts. Automaton has 14016 states and 15732 transitions. Word has length 364 [2018-11-10 09:02:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:02:37,951 INFO L481 AbstractCegarLoop]: Abstraction has 14016 states and 15732 transitions. [2018-11-10 09:02:37,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 09:02:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14016 states and 15732 transitions. [2018-11-10 09:02:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-10 09:02:37,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:02:37,960 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-10 09:02:37,960 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:02:37,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash -887559243, now seen corresponding path program 1 times [2018-11-10 09:02:37,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:37,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:37,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:37,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:37,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:38,110 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 09:02:38,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:02:38 BoogieIcfgContainer [2018-11-10 09:02:38,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:02:38,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:02:38,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:02:38,210 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:02:38,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:48:29" (3/4) ... [2018-11-10 09:02:38,213 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 09:02:38,346 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_13e476db-e8f9-493c-8393-8a3d43bce7e0/bin-2019/uautomizer/witness.graphml [2018-11-10 09:02:38,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:02:38,347 INFO L168 Benchmark]: Toolchain (without parser) took 850390.75 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 727.2 MB). Free memory was 951.1 MB in the beginning and 1.0 GB in the end (delta: -76.6 MB). Peak memory consumption was 650.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:02:38,348 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:02:38,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 921.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:02:38,348 INFO L168 Benchmark]: Boogie Preprocessor took 117.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 921.6 MB in the beginning and 1.1 GB in the end (delta: -210.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:02:38,348 INFO L168 Benchmark]: RCFGBuilder took 880.31 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: 108.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:02:38,348 INFO L168 Benchmark]: TraceAbstraction took 848925.25 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 583.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -38.0 MB). Peak memory consumption was 545.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:02:38,349 INFO L168 Benchmark]: Witness Printer took 136.38 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:02:38,350 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 921.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 921.6 MB in the beginning and 1.1 GB in the end (delta: -210.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 880.31 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: 108.5 MB). Peak memory consumption was 108.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 848925.25 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 583.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -38.0 MB). Peak memory consumption was 545.6 MB. Max. memory is 11.5 GB. * Witness Printer took 136.38 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 46]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [\old(a1)=167155, \old(a10)=167159, \old(a12)=167163, \old(a19)=167156, \old(a4)=167160, \old(inputB)=167162, \old(inputC)=167161, \old(inputD)=167157, \old(inputE)=167154, \old(inputF)=167158, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=23, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] RET return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=25, a1=169, a10=1, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=169, a10=1, a12=0, a19=9, a4=14, calculate_output(input)=25, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, a1=169, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L461] a1 = (((a1 / 5) + 105416) + 61704) [L462] a10 = 4 [L464] RET return 24; VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=3, \result=24, a1=167153, a10=4, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=167153, a10=4, a12=0, a19=9, a4=14, calculate_output(input)=24, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, a1=167153, a10=4, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND TRUE ((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)) [L272] a1 = (((((a1 % 25)+ -8) * 5) % 25)+ 13) [L273] a10 = 1 [L274] a19 = 7 [L276] RET return -1; VAL [\old(a1)=167153, \old(a10)=4, \old(a19)=9, \old(input)=5, \result=-1, a1=13, a10=1, a12=0, a19=7, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=13, a10=1, a12=0, a19=7, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND TRUE (((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] __VERIFIER_error() VAL [\old(a1)=13, \old(a10)=1, \old(a19)=7, \old(input)=3, a1=13, a10=1, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 848.8s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 743.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 26343 SDslu, 3018 SDs, 0 SdLazy, 39502 SolverSat, 7330 SolverUnsat, 121 SolverUnknown, 0 SolverNotchecked, 262.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3312 GetRequests, 2891 SyntacticMatches, 16 SemanticMatches, 405 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6049 ImplicationChecksByTransitivity, 573.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14016occurred in iteration=13, 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: 1.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 7342 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 101.6s InterpolantComputationTime, 6189 NumberOfCodeBlocks, 6189 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5803 ConstructedInterpolants, 40 QuantifiedInterpolants, 10570261 SizeOfPredicates, 15 NumberOfNonLiveVariables, 4598 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 3613/5054 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...