./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.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_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f300f737133e82ccd4d7d6f0d6ac5569b27b6d9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-10-27 00:30:21,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:30:21,227 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:30:21,237 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:30:21,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:30:21,238 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:30:21,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:30:21,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:30:21,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:30:21,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:30:21,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:30:21,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:30:21,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:30:21,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:30:21,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:30:21,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:30:21,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:30:21,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:30:21,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:30:21,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:30:21,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:30:21,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:30:21,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:30:21,257 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:30:21,257 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:30:21,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:30:21,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:30:21,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:30:21,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:30:21,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:30:21,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:30:21,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:30:21,263 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:30:21,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:30:21,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:30:21,266 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:30:21,266 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-27 00:30:21,279 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:30:21,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:30:21,280 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:30:21,281 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 00:30:21,281 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 00:30:21,281 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 00:30:21,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:30:21,282 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:30:21,282 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:30:21,282 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:30:21,282 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:30:21,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:30:21,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:30:21,283 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:30:21,283 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:30:21,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:30:21,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:30:21,283 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-27 00:30:21,284 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-27 00:30:21,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:30:21,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:30:21,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-27 00:30:21,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:30:21,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:30:21,287 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:30:21,287 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-27 00:30:21,287 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:30:21,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:30:21,288 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_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak 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 -> Kojak 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 -> 9f300f737133e82ccd4d7d6f0d6ac5569b27b6d9 [2018-10-27 00:30:21,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:30:21,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:30:21,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:30:21,337 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:30:21,337 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:30:21,338 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c [2018-10-27 00:30:21,393 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/data/e2d4d3b99/60e7ea40c2bf484c89cd577919c5109b/FLAGff07a06a7 [2018-10-27 00:30:21,903 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:30:21,903 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c [2018-10-27 00:30:21,914 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/data/e2d4d3b99/60e7ea40c2bf484c89cd577919c5109b/FLAGff07a06a7 [2018-10-27 00:30:21,928 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/data/e2d4d3b99/60e7ea40c2bf484c89cd577919c5109b [2018-10-27 00:30:21,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:30:21,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:30:21,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:30:21,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:30:21,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:30:21,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:30:21" (1/1) ... [2018-10-27 00:30:21,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e01e64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:21, skipping insertion in model container [2018-10-27 00:30:21,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:30:21" (1/1) ... [2018-10-27 00:30:21,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:30:21,997 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:30:22,385 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:30:22,390 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:30:22,493 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:30:22,509 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:30:22,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22 WrapperNode [2018-10-27 00:30:22,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:30:22,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:30:22,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:30:22,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:30:22,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:30:22,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:30:22,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:30:22,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:30:22,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... [2018-10-27 00:30:22,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:30:22,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:30:22,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:30:22,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:30:22,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-10-27 00:30:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 00:30:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:30:22,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:30:28,657 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:30:28,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:30:28 BoogieIcfgContainer [2018-10-27 00:30:28,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:30:28,659 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-27 00:30:28,659 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-27 00:30:28,671 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-27 00:30:28,671 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:30:28" (1/1) ... [2018-10-27 00:30:28,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-10-27 00:30:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-10-27 00:30:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-27 00:30:28,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 165 states and 253 transitions. [2018-10-27 00:30:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 253 transitions. [2018-10-27 00:30:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 00:30:30,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 244 states and 344 transitions. [2018-10-27 00:30:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 344 transitions. [2018-10-27 00:30:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:30:31,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 249 states and 351 transitions. [2018-10-27 00:30:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 351 transitions. [2018-10-27 00:30:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-27 00:30:31,995 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 259 states and 363 transitions. [2018-10-27 00:30:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2018-10-27 00:30:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-27 00:30:32,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 264 states and 368 transitions. [2018-10-27 00:30:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 368 transitions. [2018-10-27 00:30:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-27 00:30:32,407 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 00:30:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 275 states and 383 transitions. [2018-10-27 00:30:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 383 transitions. [2018-10-27 00:30:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-27 00:30:32,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 00:30:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 278 states and 386 transitions. [2018-10-27 00:30:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 386 transitions. [2018-10-27 00:30:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-27 00:30:33,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 00:30:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 279 states and 387 transitions. [2018-10-27 00:30:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 387 transitions. [2018-10-27 00:30:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-27 00:30:33,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:30:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 284 states and 393 transitions. [2018-10-27 00:30:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 393 transitions. [2018-10-27 00:30:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 00:30:33,292 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 00:30:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 285 states and 394 transitions. [2018-10-27 00:30:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 394 transitions. [2018-10-27 00:30:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:30:33,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 292 states and 401 transitions. [2018-10-27 00:30:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 401 transitions. [2018-10-27 00:30:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 00:30:33,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 00:30:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 299 states and 408 transitions. [2018-10-27 00:30:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 408 transitions. [2018-10-27 00:30:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 00:30:34,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 305 states and 414 transitions. [2018-10-27 00:30:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 414 transitions. [2018-10-27 00:30:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 00:30:34,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 325 states and 436 transitions. [2018-10-27 00:30:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 436 transitions. [2018-10-27 00:30:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 00:30:35,464 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:30:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 344 states and 458 transitions. [2018-10-27 00:30:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 458 transitions. [2018-10-27 00:30:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 00:30:36,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 424 states and 545 transitions. [2018-10-27 00:30:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 545 transitions. [2018-10-27 00:30:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-27 00:30:37,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:38,418 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 00:30:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:40,665 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 00:30:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 458 states and 587 transitions. [2018-10-27 00:30:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 587 transitions. [2018-10-27 00:30:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-27 00:30:41,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 471 states and 603 transitions. [2018-10-27 00:30:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 603 transitions. [2018-10-27 00:30:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-27 00:30:42,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:30:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 558 states and 694 transitions. [2018-10-27 00:30:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 694 transitions. [2018-10-27 00:30:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 00:30:43,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:30:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 569 states and 708 transitions. [2018-10-27 00:30:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 708 transitions. [2018-10-27 00:30:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 00:30:44,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 590 states and 734 transitions. [2018-10-27 00:30:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 734 transitions. [2018-10-27 00:30:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-27 00:30:45,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:30:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 601 states and 749 transitions. [2018-10-27 00:30:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 749 transitions. [2018-10-27 00:30:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-27 00:30:45,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:30:48,971 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:30:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 615 states and 769 transitions. [2018-10-27 00:30:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 769 transitions. [2018-10-27 00:30:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-27 00:30:49,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 00:30:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 624 states and 778 transitions. [2018-10-27 00:30:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 778 transitions. [2018-10-27 00:30:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-27 00:30:50,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:30:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 657 states and 818 transitions. [2018-10-27 00:30:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 818 transitions. [2018-10-27 00:30:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 00:30:51,089 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:30:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 664 states and 828 transitions. [2018-10-27 00:30:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 828 transitions. [2018-10-27 00:30:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 00:30:51,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:53,397 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:30:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:30:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 688 states and 860 transitions. [2018-10-27 00:30:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 860 transitions. [2018-10-27 00:30:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 00:30:55,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:30:56,165 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 00:30:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 701 states and 874 transitions. [2018-10-27 00:30:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 874 transitions. [2018-10-27 00:30:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 00:30:56,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:30:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 709 states and 885 transitions. [2018-10-27 00:30:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 885 transitions. [2018-10-27 00:30:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 00:30:57,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 00:30:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 711 states and 887 transitions. [2018-10-27 00:30:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 887 transitions. [2018-10-27 00:30:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 00:30:57,997 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 716 states and 894 transitions. [2018-10-27 00:30:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 894 transitions. [2018-10-27 00:30:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 00:30:58,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 00:30:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:30:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 729 states and 907 transitions. [2018-10-27 00:30:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 907 transitions. [2018-10-27 00:30:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 00:30:59,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:30:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:31:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 747 states and 927 transitions. [2018-10-27 00:31:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 927 transitions. [2018-10-27 00:31:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 00:31:00,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-27 00:31:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 771 states and 955 transitions. [2018-10-27 00:31:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 955 transitions. [2018-10-27 00:31:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 00:31:02,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:31:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 791 states and 981 transitions. [2018-10-27 00:31:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 981 transitions. [2018-10-27 00:31:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-27 00:31:03,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 00:31:03,989 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 00:31:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 813 states and 1008 transitions. [2018-10-27 00:31:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1008 transitions. [2018-10-27 00:31:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-27 00:31:05,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-27 00:31:05,929 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 00:31:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 819 states and 1014 transitions. [2018-10-27 00:31:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1014 transitions. [2018-10-27 00:31:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-27 00:31:07,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:31:07,689 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 00:31:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 852 states and 1050 transitions. [2018-10-27 00:31:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1050 transitions. [2018-10-27 00:31:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-27 00:31:09,096 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:31:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 886 states and 1097 transitions. [2018-10-27 00:31:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1097 transitions. [2018-10-27 00:31:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 00:31:10,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-27 00:31:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 891 states and 1106 transitions. [2018-10-27 00:31:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1106 transitions. [2018-10-27 00:31:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 00:31:11,054 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 00:31:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 895 states and 1110 transitions. [2018-10-27 00:31:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1110 transitions. [2018-10-27 00:31:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 00:31:11,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 00:31:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 899 states and 1114 transitions. [2018-10-27 00:31:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1114 transitions. [2018-10-27 00:31:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 00:31:11,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 00:31:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 906 states and 1121 transitions. [2018-10-27 00:31:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1121 transitions. [2018-10-27 00:31:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 00:31:12,040 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 00:31:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 908 states and 1122 transitions. [2018-10-27 00:31:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1122 transitions. [2018-10-27 00:31:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 00:31:12,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:31:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 917 states and 1136 transitions. [2018-10-27 00:31:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1136 transitions. [2018-10-27 00:31:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 00:31:13,166 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:31:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 925 states and 1144 transitions. [2018-10-27 00:31:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1144 transitions. [2018-10-27 00:31:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-27 00:31:13,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:31:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 950 states and 1178 transitions. [2018-10-27 00:31:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1178 transitions. [2018-10-27 00:31:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-27 00:31:14,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:31:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 969 states and 1208 transitions. [2018-10-27 00:31:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1208 transitions. [2018-10-27 00:31:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-27 00:31:16,562 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:31:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 977 states and 1217 transitions. [2018-10-27 00:31:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1217 transitions. [2018-10-27 00:31:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:31:16,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-27 00:31:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 984 states and 1224 transitions. [2018-10-27 00:31:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1224 transitions. [2018-10-27 00:31:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:31:17,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-27 00:31:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1000 states and 1244 transitions. [2018-10-27 00:31:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1244 transitions. [2018-10-27 00:31:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:31:18,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-27 00:31:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1016 states and 1264 transitions. [2018-10-27 00:31:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1264 transitions. [2018-10-27 00:31:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:31:19,712 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-27 00:31:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1021 states and 1271 transitions. [2018-10-27 00:31:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1271 transitions. [2018-10-27 00:31:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:31:20,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-27 00:31:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1029 states and 1280 transitions. [2018-10-27 00:31:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1280 transitions. [2018-10-27 00:31:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:31:20,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:31:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1035 states and 1289 transitions. [2018-10-27 00:31:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1289 transitions. [2018-10-27 00:31:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:31:21,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:31:22,795 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 00:31:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1088 states and 1352 transitions. [2018-10-27 00:31:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1352 transitions. [2018-10-27 00:31:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:31:24,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-27 00:31:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1104 states and 1369 transitions. [2018-10-27 00:31:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1369 transitions. [2018-10-27 00:31:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 00:31:25,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 00:31:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1127 states and 1403 transitions. [2018-10-27 00:31:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1403 transitions. [2018-10-27 00:31:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 00:31:26,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 00:31:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1129 states and 1405 transitions. [2018-10-27 00:31:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1405 transitions. [2018-10-27 00:31:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 00:31:26,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-27 00:31:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1137 states and 1412 transitions. [2018-10-27 00:31:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1412 transitions. [2018-10-27 00:31:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-27 00:31:27,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:31:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1146 states and 1421 transitions. [2018-10-27 00:31:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1421 transitions. [2018-10-27 00:31:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:31:27,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:31:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1162 states and 1436 transitions. [2018-10-27 00:31:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1436 transitions. [2018-10-27 00:31:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:31:28,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 00:31:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1164 states and 1439 transitions. [2018-10-27 00:31:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1439 transitions. [2018-10-27 00:31:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-27 00:31:28,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:31:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1233 states and 1519 transitions. [2018-10-27 00:31:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1519 transitions. [2018-10-27 00:31:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:31:34,272 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:31:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1269 states and 1561 transitions. [2018-10-27 00:31:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1561 transitions. [2018-10-27 00:31:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:31:38,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:31:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1286 states and 1583 transitions. [2018-10-27 00:31:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1583 transitions. [2018-10-27 00:31:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-27 00:31:39,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 00:31:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1306 states and 1606 transitions. [2018-10-27 00:31:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1606 transitions. [2018-10-27 00:31:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-27 00:31:41,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-27 00:31:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1309 states and 1613 transitions. [2018-10-27 00:31:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1613 transitions. [2018-10-27 00:31:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-27 00:31:41,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:31:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1326 states and 1631 transitions. [2018-10-27 00:31:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1631 transitions. [2018-10-27 00:31:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-27 00:31:42,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 00:31:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1362 states and 1668 transitions. [2018-10-27 00:31:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1668 transitions. [2018-10-27 00:31:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 00:31:48,125 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 00:31:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1431 states and 1737 transitions. [2018-10-27 00:31:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1737 transitions. [2018-10-27 00:31:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 00:31:54,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 00:31:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1464 states and 1769 transitions. [2018-10-27 00:31:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1769 transitions. [2018-10-27 00:31:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-27 00:31:58,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 121 proven. 1 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-27 00:31:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:31:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1483 states and 1789 transitions. [2018-10-27 00:31:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1789 transitions. [2018-10-27 00:31:59,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:31:59,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:31:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:31:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:32:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:32:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1503 states and 1813 transitions. [2018-10-27 00:32:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1813 transitions. [2018-10-27 00:32:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:32:00,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:32:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:32:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:32:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:32:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1507 states and 1816 transitions. [2018-10-27 00:32:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1816 transitions. [2018-10-27 00:32:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 00:32:00,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:32:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:32:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:32:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:32:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1509 states and 1817 transitions. [2018-10-27 00:32:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1817 transitions. [2018-10-27 00:32:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-27 00:32:01,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:32:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:32:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:32:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:32:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:32:01,865 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 77 iterations. [2018-10-27 00:32:02,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 27.10 12:32:02 ImpRootNode [2018-10-27 00:32:02,033 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-27 00:32:02,033 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:32:02,033 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:32:02,034 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:32:02,036 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:30:28" (3/4) ... [2018-10-27 00:32:02,038 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 00:32:02,227 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_258019c7-5557-4e9b-af61-7fb8abfca492/bin-2019/ukojak/witness.graphml [2018-10-27 00:32:02,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:32:02,229 INFO L168 Benchmark]: Toolchain (without parser) took 100297.20 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 951.8 MB in the beginning and 1.7 GB in the end (delta: -776.7 MB). Peak memory consumption was 333.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:32:02,230 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:32:02,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.70 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-27 00:32:02,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 922.2 MB in the beginning and 1.1 GB in the end (delta: -227.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-10-27 00:32:02,231 INFO L168 Benchmark]: Boogie Preprocessor took 82.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 00:32:02,231 INFO L168 Benchmark]: RCFGBuilder took 5895.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 906.1 MB in the end (delta: 238.0 MB). Peak memory consumption was 238.0 MB. Max. memory is 11.5 GB. [2018-10-27 00:32:02,232 INFO L168 Benchmark]: CodeCheck took 93374.31 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 953.7 MB). Free memory was 906.1 MB in the beginning and 1.8 GB in the end (delta: -845.9 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:32:02,232 INFO L168 Benchmark]: Witness Printer took 194.27 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2018-10-27 00:32:02,237 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 228 locations, 1 error locations. UNSAFE Result, 93.1s OverallTime, 77 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1079007744 SDtfs, -2079081466 SDslu, 1115879424 SDs, 0 SdLazy, -195699394 SolverSat, -1020596708 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 419.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70336 GetRequests, 69020 SyntacticMatches, 544 SemanticMatches, 772 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397598 ImplicationChecksByTransitivity, 76.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 10632 NumberOfCodeBlocks, 10632 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 10375 ConstructedInterpolants, 0 QuantifiedInterpolants, 3882803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 67 PerfectInterpolantSequences, 6268/6308 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 430]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L166] a25 = 1 [L167] a28 = 9 [L168] RET return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND TRUE ((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))) [L369] a11 = 1 [L370] a19 = 0 [L371] a25 = 1 [L372] a17 = 7 [L373] a28 = 9 [L374] RET return -1; VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L429] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] __VERIFIER_error() VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 576.70 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 168.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 922.2 MB in the beginning and 1.1 GB in the end (delta: -227.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5895.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 906.1 MB in the end (delta: 238.0 MB). Peak memory consumption was 238.0 MB. Max. memory is 11.5 GB. * CodeCheck took 93374.31 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 953.7 MB). Free memory was 906.1 MB in the beginning and 1.8 GB in the end (delta: -845.9 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. * Witness Printer took 194.27 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...