./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label17.c -s /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5448130a61126fa432661a8acbadf20086ca8615 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:47:13,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:47:13,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:47:13,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:47:13,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:47:13,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:47:13,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:47:13,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:47:13,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:47:13,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:47:13,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:47:13,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:47:13,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:47:13,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:47:13,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:47:13,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:47:13,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:47:13,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:47:13,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:47:13,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:47:13,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:47:13,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:47:13,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:47:13,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:47:13,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:47:13,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:47:13,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:47:13,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:47:13,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:47:13,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:47:13,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:47:13,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:47:13,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:47:13,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:47:13,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:47:13,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:47:13,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:47:13,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:47:13,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:47:13,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:47:13,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:47:13,830 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:47:13,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:47:13,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:47:13,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:47:13,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:47:13,840 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:47:13,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:47:13,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:47:13,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:47:13,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:47:13,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:47:13,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:47:13,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:47:13,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:47:13,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:47:13,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:47:13,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:47:13,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:47:13,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:47:13,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:47:13,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:47:13,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:47:13,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:47:13,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:47:13,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:47:13,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:47:13,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:47:13,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:47:13,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:47:13,843 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:47:13,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5448130a61126fa432661a8acbadf20086ca8615 [2019-12-07 18:47:13,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:47:13,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:47:13,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:47:13,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:47:13,954 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:47:13,954 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label17.c [2019-12-07 18:47:13,990 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/data/2702adae8/7f0ad721014a4b4ca73d3b617363d4f8/FLAG0d26dfe66 [2019-12-07 18:47:14,484 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:47:14,485 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/sv-benchmarks/c/eca-rers2012/Problem03_label17.c [2019-12-07 18:47:14,496 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/data/2702adae8/7f0ad721014a4b4ca73d3b617363d4f8/FLAG0d26dfe66 [2019-12-07 18:47:14,506 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/data/2702adae8/7f0ad721014a4b4ca73d3b617363d4f8 [2019-12-07 18:47:14,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:47:14,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:47:14,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:47:14,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:47:14,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:47:14,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:47:14" (1/1) ... [2019-12-07 18:47:14,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffc5a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:14, skipping insertion in model container [2019-12-07 18:47:14,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:47:14" (1/1) ... [2019-12-07 18:47:14,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:47:14,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:47:14,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:47:14,968 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:47:15,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:47:15,118 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:47:15,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15 WrapperNode [2019-12-07 18:47:15,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:47:15,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:47:15,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:47:15,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:47:15,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:47:15,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:47:15,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:47:15,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:47:15,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... [2019-12-07 18:47:15,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:47:15,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:47:15,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:47:15,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:47:15,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:47:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:47:15,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:47:16,478 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:47:16,479 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:47:16,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:47:16 BoogieIcfgContainer [2019-12-07 18:47:16,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:47:16,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:47:16,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:47:16,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:47:16,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:47:14" (1/3) ... [2019-12-07 18:47:16,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c33ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:47:16, skipping insertion in model container [2019-12-07 18:47:16,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:47:15" (2/3) ... [2019-12-07 18:47:16,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c33ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:47:16, skipping insertion in model container [2019-12-07 18:47:16,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:47:16" (3/3) ... [2019-12-07 18:47:16,484 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label17.c [2019-12-07 18:47:16,491 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:47:16,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:47:16,504 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:47:16,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:47:16,524 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:47:16,524 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:47:16,524 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:47:16,524 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:47:16,524 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:47:16,524 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:47:16,524 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:47:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 18:47:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-07 18:47:16,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:16,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:16,554 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1830500685, now seen corresponding path program 1 times [2019-12-07 18:47:16,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:16,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851816471] [2019-12-07 18:47:16,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:47:16,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851816471] [2019-12-07 18:47:16,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:16,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:16,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114228468] [2019-12-07 18:47:16,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:47:16,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:47:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:16,980 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-12-07 18:47:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:18,380 INFO L93 Difference]: Finished difference Result 1071 states and 1917 transitions. [2019-12-07 18:47:18,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:47:18,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-12-07 18:47:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:18,400 INFO L225 Difference]: With dead ends: 1071 [2019-12-07 18:47:18,401 INFO L226 Difference]: Without dead ends: 673 [2019-12-07 18:47:18,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-12-07 18:47:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 458. [2019-12-07 18:47:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-07 18:47:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 702 transitions. [2019-12-07 18:47:18,462 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 702 transitions. Word has length 199 [2019-12-07 18:47:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:18,463 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 702 transitions. [2019-12-07 18:47:18,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:47:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 702 transitions. [2019-12-07 18:47:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-12-07 18:47:18,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:18,469 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:18,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1740724172, now seen corresponding path program 1 times [2019-12-07 18:47:18,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:18,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284583167] [2019-12-07 18:47:18,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:47:18,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284583167] [2019-12-07 18:47:18,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:18,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:47:18,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758489144] [2019-12-07 18:47:18,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:18,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:18,555 INFO L87 Difference]: Start difference. First operand 458 states and 702 transitions. Second operand 3 states. [2019-12-07 18:47:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:19,333 INFO L93 Difference]: Finished difference Result 1339 states and 2070 transitions. [2019-12-07 18:47:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:19,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-12-07 18:47:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:19,337 INFO L225 Difference]: With dead ends: 1339 [2019-12-07 18:47:19,337 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 18:47:19,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 18:47:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 867. [2019-12-07 18:47:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-12-07 18:47:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1309 transitions. [2019-12-07 18:47:19,359 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1309 transitions. Word has length 207 [2019-12-07 18:47:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:19,359 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1309 transitions. [2019-12-07 18:47:19,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1309 transitions. [2019-12-07 18:47:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-12-07 18:47:19,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:19,362 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:19,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:19,363 INFO L82 PathProgramCache]: Analyzing trace with hash -672491987, now seen corresponding path program 1 times [2019-12-07 18:47:19,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:19,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095086475] [2019-12-07 18:47:19,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 18:47:19,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095086475] [2019-12-07 18:47:19,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:19,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:47:19,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337523116] [2019-12-07 18:47:19,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:19,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:19,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:19,425 INFO L87 Difference]: Start difference. First operand 867 states and 1309 transitions. Second operand 3 states. [2019-12-07 18:47:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:19,705 INFO L93 Difference]: Finished difference Result 2582 states and 3905 transitions. [2019-12-07 18:47:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:19,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-12-07 18:47:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:19,713 INFO L225 Difference]: With dead ends: 2582 [2019-12-07 18:47:19,713 INFO L226 Difference]: Without dead ends: 1717 [2019-12-07 18:47:19,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2019-12-07 18:47:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1713. [2019-12-07 18:47:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2019-12-07 18:47:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2587 transitions. [2019-12-07 18:47:19,744 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2587 transitions. Word has length 219 [2019-12-07 18:47:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:19,744 INFO L462 AbstractCegarLoop]: Abstraction has 1713 states and 2587 transitions. [2019-12-07 18:47:19,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2587 transitions. [2019-12-07 18:47:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-12-07 18:47:19,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:19,748 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:19,748 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1528061328, now seen corresponding path program 1 times [2019-12-07 18:47:19,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:19,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937797608] [2019-12-07 18:47:19,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:47:19,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937797608] [2019-12-07 18:47:19,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:19,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:19,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100605687] [2019-12-07 18:47:19,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:47:19,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:47:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:19,830 INFO L87 Difference]: Start difference. First operand 1713 states and 2587 transitions. Second operand 4 states. [2019-12-07 18:47:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:20,978 INFO L93 Difference]: Finished difference Result 6700 states and 10148 transitions. [2019-12-07 18:47:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:47:20,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-12-07 18:47:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:20,997 INFO L225 Difference]: With dead ends: 6700 [2019-12-07 18:47:20,997 INFO L226 Difference]: Without dead ends: 4989 [2019-12-07 18:47:21,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4989 states. [2019-12-07 18:47:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4989 to 3345. [2019-12-07 18:47:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3345 states. [2019-12-07 18:47:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 4800 transitions. [2019-12-07 18:47:21,058 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 4800 transitions. Word has length 222 [2019-12-07 18:47:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:21,058 INFO L462 AbstractCegarLoop]: Abstraction has 3345 states and 4800 transitions. [2019-12-07 18:47:21,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:47:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 4800 transitions. [2019-12-07 18:47:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-12-07 18:47:21,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:21,063 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:21,063 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash -188708987, now seen corresponding path program 1 times [2019-12-07 18:47:21,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:21,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436801075] [2019-12-07 18:47:21,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 18:47:21,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436801075] [2019-12-07 18:47:21,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:21,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:47:21,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164459248] [2019-12-07 18:47:21,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:21,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:21,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:21,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:21,130 INFO L87 Difference]: Start difference. First operand 3345 states and 4800 transitions. Second operand 3 states. [2019-12-07 18:47:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:21,503 INFO L93 Difference]: Finished difference Result 6638 states and 9530 transitions. [2019-12-07 18:47:21,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:21,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-12-07 18:47:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:21,516 INFO L225 Difference]: With dead ends: 6638 [2019-12-07 18:47:21,516 INFO L226 Difference]: Without dead ends: 3295 [2019-12-07 18:47:21,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2019-12-07 18:47:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3295. [2019-12-07 18:47:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3295 states. [2019-12-07 18:47:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 4640 transitions. [2019-12-07 18:47:21,565 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 4640 transitions. Word has length 234 [2019-12-07 18:47:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:21,566 INFO L462 AbstractCegarLoop]: Abstraction has 3295 states and 4640 transitions. [2019-12-07 18:47:21,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 4640 transitions. [2019-12-07 18:47:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-12-07 18:47:21,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:21,572 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:21,572 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:21,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash -625869969, now seen corresponding path program 1 times [2019-12-07 18:47:21,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:21,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314557622] [2019-12-07 18:47:21,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:47:21,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314557622] [2019-12-07 18:47:21,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:21,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:47:21,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351048059] [2019-12-07 18:47:21,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:47:21,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:21,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:47:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:47:21,699 INFO L87 Difference]: Start difference. First operand 3295 states and 4640 transitions. Second operand 5 states. [2019-12-07 18:47:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:22,994 INFO L93 Difference]: Finished difference Result 7623 states and 10825 transitions. [2019-12-07 18:47:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:47:22,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-12-07 18:47:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:23,010 INFO L225 Difference]: With dead ends: 7623 [2019-12-07 18:47:23,010 INFO L226 Difference]: Without dead ends: 4330 [2019-12-07 18:47:23,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:47:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2019-12-07 18:47:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3701. [2019-12-07 18:47:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2019-12-07 18:47:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 5192 transitions. [2019-12-07 18:47:23,059 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 5192 transitions. Word has length 237 [2019-12-07 18:47:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:23,060 INFO L462 AbstractCegarLoop]: Abstraction has 3701 states and 5192 transitions. [2019-12-07 18:47:23,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:47:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 5192 transitions. [2019-12-07 18:47:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-12-07 18:47:23,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:23,064 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:23,064 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:23,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1535297082, now seen corresponding path program 1 times [2019-12-07 18:47:23,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:23,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945582784] [2019-12-07 18:47:23,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:47:23,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945582784] [2019-12-07 18:47:23,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:23,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:23,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140195649] [2019-12-07 18:47:23,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:23,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:23,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:23,131 INFO L87 Difference]: Start difference. First operand 3701 states and 5192 transitions. Second operand 3 states. [2019-12-07 18:47:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:23,715 INFO L93 Difference]: Finished difference Result 10660 states and 14919 transitions. [2019-12-07 18:47:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:23,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-12-07 18:47:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:23,737 INFO L225 Difference]: With dead ends: 10660 [2019-12-07 18:47:23,737 INFO L226 Difference]: Without dead ends: 6961 [2019-12-07 18:47:23,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6961 states. [2019-12-07 18:47:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6961 to 6955. [2019-12-07 18:47:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6955 states. [2019-12-07 18:47:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 9298 transitions. [2019-12-07 18:47:23,809 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 9298 transitions. Word has length 237 [2019-12-07 18:47:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:23,809 INFO L462 AbstractCegarLoop]: Abstraction has 6955 states and 9298 transitions. [2019-12-07 18:47:23,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 9298 transitions. [2019-12-07 18:47:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-12-07 18:47:23,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:23,815 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:23,815 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:23,816 INFO L82 PathProgramCache]: Analyzing trace with hash 29142852, now seen corresponding path program 1 times [2019-12-07 18:47:23,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:23,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080341441] [2019-12-07 18:47:23,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:47:23,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080341441] [2019-12-07 18:47:23,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:23,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:47:23,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297275367] [2019-12-07 18:47:23,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:23,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:23,889 INFO L87 Difference]: Start difference. First operand 6955 states and 9298 transitions. Second operand 3 states. [2019-12-07 18:47:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:24,489 INFO L93 Difference]: Finished difference Result 16976 states and 22678 transitions. [2019-12-07 18:47:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:24,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-12-07 18:47:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:24,510 INFO L225 Difference]: With dead ends: 16976 [2019-12-07 18:47:24,510 INFO L226 Difference]: Without dead ends: 10023 [2019-12-07 18:47:24,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10023 states. [2019-12-07 18:47:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10023 to 10021. [2019-12-07 18:47:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10021 states. [2019-12-07 18:47:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10021 states to 10021 states and 13282 transitions. [2019-12-07 18:47:24,601 INFO L78 Accepts]: Start accepts. Automaton has 10021 states and 13282 transitions. Word has length 240 [2019-12-07 18:47:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:24,601 INFO L462 AbstractCegarLoop]: Abstraction has 10021 states and 13282 transitions. [2019-12-07 18:47:24,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 10021 states and 13282 transitions. [2019-12-07 18:47:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-12-07 18:47:24,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:24,609 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:24,609 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:24,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1951980600, now seen corresponding path program 1 times [2019-12-07 18:47:24,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:24,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303542270] [2019-12-07 18:47:24,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 18:47:24,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303542270] [2019-12-07 18:47:24,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:24,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:24,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497585707] [2019-12-07 18:47:24,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:24,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:24,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:24,665 INFO L87 Difference]: Start difference. First operand 10021 states and 13282 transitions. Second operand 3 states. [2019-12-07 18:47:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:25,360 INFO L93 Difference]: Finished difference Result 27555 states and 36427 transitions. [2019-12-07 18:47:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:25,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-12-07 18:47:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:25,386 INFO L225 Difference]: With dead ends: 27555 [2019-12-07 18:47:25,386 INFO L226 Difference]: Without dead ends: 17536 [2019-12-07 18:47:25,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17536 states. [2019-12-07 18:47:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17536 to 17532. [2019-12-07 18:47:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-12-07 18:47:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20868 transitions. [2019-12-07 18:47:25,580 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20868 transitions. Word has length 243 [2019-12-07 18:47:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:25,580 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20868 transitions. [2019-12-07 18:47:25,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20868 transitions. [2019-12-07 18:47:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-12-07 18:47:25,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:25,591 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:25,591 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash -430896145, now seen corresponding path program 1 times [2019-12-07 18:47:25,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:25,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711134692] [2019-12-07 18:47:25,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:47:25,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711134692] [2019-12-07 18:47:25,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174769587] [2019-12-07 18:47:25,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:47:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:25,806 INFO L264 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:47:25,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:47:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:47:25,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:47:25,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 18:47:25,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510984584] [2019-12-07 18:47:25,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:25,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:47:25,893 INFO L87 Difference]: Start difference. First operand 17532 states and 20868 transitions. Second operand 3 states. [2019-12-07 18:47:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:26,627 INFO L93 Difference]: Finished difference Result 45235 states and 54146 transitions. [2019-12-07 18:47:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:26,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-12-07 18:47:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:26,656 INFO L225 Difference]: With dead ends: 45235 [2019-12-07 18:47:26,656 INFO L226 Difference]: Without dead ends: 27705 [2019-12-07 18:47:26,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:47:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27705 states. [2019-12-07 18:47:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27705 to 24032. [2019-12-07 18:47:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-07 18:47:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 29227 transitions. [2019-12-07 18:47:26,952 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 29227 transitions. Word has length 247 [2019-12-07 18:47:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:26,952 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 29227 transitions. [2019-12-07 18:47:26,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 29227 transitions. [2019-12-07 18:47:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-12-07 18:47:26,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:26,989 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:27,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:47:27,190 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash -865985874, now seen corresponding path program 1 times [2019-12-07 18:47:27,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:27,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496640126] [2019-12-07 18:47:27,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 18:47:27,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496640126] [2019-12-07 18:47:27,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:27,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:47:27,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379535580] [2019-12-07 18:47:27,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:27,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:27,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:27,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:27,275 INFO L87 Difference]: Start difference. First operand 24032 states and 29227 transitions. Second operand 3 states. [2019-12-07 18:47:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:27,920 INFO L93 Difference]: Finished difference Result 55979 states and 68785 transitions. [2019-12-07 18:47:27,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:27,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-12-07 18:47:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:27,949 INFO L225 Difference]: With dead ends: 55979 [2019-12-07 18:47:27,949 INFO L226 Difference]: Without dead ends: 31949 [2019-12-07 18:47:27,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31949 states. [2019-12-07 18:47:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31949 to 31949. [2019-12-07 18:47:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31949 states. [2019-12-07 18:47:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31949 states to 31949 states and 37306 transitions. [2019-12-07 18:47:28,240 INFO L78 Accepts]: Start accepts. Automaton has 31949 states and 37306 transitions. Word has length 266 [2019-12-07 18:47:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:28,240 INFO L462 AbstractCegarLoop]: Abstraction has 31949 states and 37306 transitions. [2019-12-07 18:47:28,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 31949 states and 37306 transitions. [2019-12-07 18:47:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-12-07 18:47:28,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:28,260 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:28,260 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2004368065, now seen corresponding path program 1 times [2019-12-07 18:47:28,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:28,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491310410] [2019-12-07 18:47:28,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 18:47:28,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491310410] [2019-12-07 18:47:28,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:28,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:47:28,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840118315] [2019-12-07 18:47:28,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:28,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:28,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:28,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:28,357 INFO L87 Difference]: Start difference. First operand 31949 states and 37306 transitions. Second operand 3 states. [2019-12-07 18:47:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:29,264 INFO L93 Difference]: Finished difference Result 81393 states and 95040 transitions. [2019-12-07 18:47:29,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:29,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-12-07 18:47:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:29,305 INFO L225 Difference]: With dead ends: 81393 [2019-12-07 18:47:29,305 INFO L226 Difference]: Without dead ends: 49446 [2019-12-07 18:47:29,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49446 states. [2019-12-07 18:47:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49446 to 49444. [2019-12-07 18:47:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49444 states. [2019-12-07 18:47:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49444 states to 49444 states and 57599 transitions. [2019-12-07 18:47:29,733 INFO L78 Accepts]: Start accepts. Automaton has 49444 states and 57599 transitions. Word has length 301 [2019-12-07 18:47:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:29,733 INFO L462 AbstractCegarLoop]: Abstraction has 49444 states and 57599 transitions. [2019-12-07 18:47:29,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 49444 states and 57599 transitions. [2019-12-07 18:47:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-12-07 18:47:29,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:29,751 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:29,751 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash 288746998, now seen corresponding path program 1 times [2019-12-07 18:47:29,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:29,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751843563] [2019-12-07 18:47:29,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 18:47:29,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751843563] [2019-12-07 18:47:29,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728531411] [2019-12-07 18:47:29,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:47:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:29,964 INFO L264 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:47:29,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:47:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 18:47:30,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:47:30,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-12-07 18:47:30,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874461605] [2019-12-07 18:47:30,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:30,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:30,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:30,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:47:30,057 INFO L87 Difference]: Start difference. First operand 49444 states and 57599 transitions. Second operand 3 states. [2019-12-07 18:47:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:31,315 INFO L93 Difference]: Finished difference Result 98081 states and 114236 transitions. [2019-12-07 18:47:31,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:31,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-12-07 18:47:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:31,355 INFO L225 Difference]: With dead ends: 98081 [2019-12-07 18:47:31,355 INFO L226 Difference]: Without dead ends: 48639 [2019-12-07 18:47:31,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:47:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48639 states. [2019-12-07 18:47:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48639 to 48629. [2019-12-07 18:47:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48629 states. [2019-12-07 18:47:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48629 states to 48629 states and 55433 transitions. [2019-12-07 18:47:31,758 INFO L78 Accepts]: Start accepts. Automaton has 48629 states and 55433 transitions. Word has length 308 [2019-12-07 18:47:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:31,758 INFO L462 AbstractCegarLoop]: Abstraction has 48629 states and 55433 transitions. [2019-12-07 18:47:31,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 48629 states and 55433 transitions. [2019-12-07 18:47:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-12-07 18:47:31,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:31,783 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:31,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:47:31,984 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1469760061, now seen corresponding path program 1 times [2019-12-07 18:47:31,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:31,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054655602] [2019-12-07 18:47:31,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 18:47:32,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054655602] [2019-12-07 18:47:32,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:32,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:32,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383390710] [2019-12-07 18:47:32,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:32,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:32,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:32,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:32,145 INFO L87 Difference]: Start difference. First operand 48629 states and 55433 transitions. Second operand 3 states. [2019-12-07 18:47:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:32,564 INFO L93 Difference]: Finished difference Result 130815 states and 149179 transitions. [2019-12-07 18:47:32,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:32,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 367 [2019-12-07 18:47:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:32,630 INFO L225 Difference]: With dead ends: 130815 [2019-12-07 18:47:32,630 INFO L226 Difference]: Without dead ends: 82188 [2019-12-07 18:47:32,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82188 states. [2019-12-07 18:47:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82188 to 82186. [2019-12-07 18:47:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82186 states. [2019-12-07 18:47:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82186 states to 82186 states and 93055 transitions. [2019-12-07 18:47:33,422 INFO L78 Accepts]: Start accepts. Automaton has 82186 states and 93055 transitions. Word has length 367 [2019-12-07 18:47:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:33,422 INFO L462 AbstractCegarLoop]: Abstraction has 82186 states and 93055 transitions. [2019-12-07 18:47:33,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 82186 states and 93055 transitions. [2019-12-07 18:47:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-12-07 18:47:33,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:33,465 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:33,466 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:33,466 INFO L82 PathProgramCache]: Analyzing trace with hash -330589520, now seen corresponding path program 1 times [2019-12-07 18:47:33,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:33,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450834691] [2019-12-07 18:47:33,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-12-07 18:47:33,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450834691] [2019-12-07 18:47:33,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:33,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:33,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026180116] [2019-12-07 18:47:33,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:47:33,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:33,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:47:33,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:33,601 INFO L87 Difference]: Start difference. First operand 82186 states and 93055 transitions. Second operand 4 states. [2019-12-07 18:47:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:34,895 INFO L93 Difference]: Finished difference Result 234473 states and 264413 transitions. [2019-12-07 18:47:34,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:47:34,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-12-07 18:47:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:35,030 INFO L225 Difference]: With dead ends: 234473 [2019-12-07 18:47:35,030 INFO L226 Difference]: Without dead ends: 152289 [2019-12-07 18:47:35,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152289 states. [2019-12-07 18:47:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152289 to 152275. [2019-12-07 18:47:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152275 states. [2019-12-07 18:47:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152275 states to 152275 states and 171220 transitions. [2019-12-07 18:47:36,375 INFO L78 Accepts]: Start accepts. Automaton has 152275 states and 171220 transitions. Word has length 403 [2019-12-07 18:47:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:36,376 INFO L462 AbstractCegarLoop]: Abstraction has 152275 states and 171220 transitions. [2019-12-07 18:47:36,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:47:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 152275 states and 171220 transitions. [2019-12-07 18:47:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-12-07 18:47:36,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:36,434 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:36,434 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash -273747068, now seen corresponding path program 1 times [2019-12-07 18:47:36,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:36,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340604174] [2019-12-07 18:47:36,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-12-07 18:47:36,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340604174] [2019-12-07 18:47:36,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:36,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:36,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365334157] [2019-12-07 18:47:36,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:36,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:36,771 INFO L87 Difference]: Start difference. First operand 152275 states and 171220 transitions. Second operand 3 states. [2019-12-07 18:47:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:37,854 INFO L93 Difference]: Finished difference Result 305618 states and 343046 transitions. [2019-12-07 18:47:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:37,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2019-12-07 18:47:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:37,993 INFO L225 Difference]: With dead ends: 305618 [2019-12-07 18:47:37,993 INFO L226 Difference]: Without dead ends: 153345 [2019-12-07 18:47:38,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153345 states. [2019-12-07 18:47:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153345 to 153282. [2019-12-07 18:47:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153282 states. [2019-12-07 18:47:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153282 states to 153282 states and 169962 transitions. [2019-12-07 18:47:39,619 INFO L78 Accepts]: Start accepts. Automaton has 153282 states and 169962 transitions. Word has length 411 [2019-12-07 18:47:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:39,619 INFO L462 AbstractCegarLoop]: Abstraction has 153282 states and 169962 transitions. [2019-12-07 18:47:39,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 153282 states and 169962 transitions. [2019-12-07 18:47:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-12-07 18:47:39,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:39,677 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:39,677 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash -28669086, now seen corresponding path program 1 times [2019-12-07 18:47:39,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:39,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500504840] [2019-12-07 18:47:39,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:47:39,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500504840] [2019-12-07 18:47:39,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:39,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:47:39,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338846108] [2019-12-07 18:47:39,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:47:39,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:39,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:47:39,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:39,842 INFO L87 Difference]: Start difference. First operand 153282 states and 169962 transitions. Second operand 4 states. [2019-12-07 18:47:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:41,245 INFO L93 Difference]: Finished difference Result 542198 states and 601990 transitions. [2019-12-07 18:47:41,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:47:41,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2019-12-07 18:47:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:41,618 INFO L225 Difference]: With dead ends: 542198 [2019-12-07 18:47:41,618 INFO L226 Difference]: Without dead ends: 388918 [2019-12-07 18:47:41,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388918 states. [2019-12-07 18:47:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388918 to 262241. [2019-12-07 18:47:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262241 states. [2019-12-07 18:47:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262241 states to 262241 states and 291219 transitions. [2019-12-07 18:47:46,873 INFO L78 Accepts]: Start accepts. Automaton has 262241 states and 291219 transitions. Word has length 423 [2019-12-07 18:47:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:46,874 INFO L462 AbstractCegarLoop]: Abstraction has 262241 states and 291219 transitions. [2019-12-07 18:47:46,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:47:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 262241 states and 291219 transitions. [2019-12-07 18:47:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-12-07 18:47:46,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:46,996 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:46,996 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash 925038289, now seen corresponding path program 1 times [2019-12-07 18:47:46,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:46,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267015908] [2019-12-07 18:47:46,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-12-07 18:47:47,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267015908] [2019-12-07 18:47:47,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:47,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:47,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669229457] [2019-12-07 18:47:47,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:47,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:47,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:47,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:47,304 INFO L87 Difference]: Start difference. First operand 262241 states and 291219 transitions. Second operand 3 states. [2019-12-07 18:47:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:48,910 INFO L93 Difference]: Finished difference Result 516370 states and 573269 transitions. [2019-12-07 18:47:48,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:48,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2019-12-07 18:47:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:49,174 INFO L225 Difference]: With dead ends: 516370 [2019-12-07 18:47:49,174 INFO L226 Difference]: Without dead ends: 254131 [2019-12-07 18:47:49,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:47:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254131 states. [2019-12-07 18:47:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254131 to 251257. [2019-12-07 18:47:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251257 states. [2019-12-07 18:47:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251257 states to 251257 states and 273794 transitions. [2019-12-07 18:47:52,015 INFO L78 Accepts]: Start accepts. Automaton has 251257 states and 273794 transitions. Word has length 479 [2019-12-07 18:47:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:52,016 INFO L462 AbstractCegarLoop]: Abstraction has 251257 states and 273794 transitions. [2019-12-07 18:47:52,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 251257 states and 273794 transitions. [2019-12-07 18:47:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-12-07 18:47:52,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:52,131 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:52,132 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash -729549899, now seen corresponding path program 1 times [2019-12-07 18:47:52,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:52,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882263278] [2019-12-07 18:47:52,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 440 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-07 18:47:52,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882263278] [2019-12-07 18:47:52,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110195785] [2019-12-07 18:47:52,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:47:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:52,748 INFO L264 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:47:52,754 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:47:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-12-07 18:47:52,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:47:52,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-12-07 18:47:52,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146858660] [2019-12-07 18:47:52,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:47:52,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:47:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:47:52,928 INFO L87 Difference]: Start difference. First operand 251257 states and 273794 transitions. Second operand 3 states. [2019-12-07 18:47:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:47:54,510 INFO L93 Difference]: Finished difference Result 499096 states and 543910 transitions. [2019-12-07 18:47:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:47:54,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-12-07 18:47:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:47:54,754 INFO L225 Difference]: With dead ends: 499096 [2019-12-07 18:47:54,754 INFO L226 Difference]: Without dead ends: 247841 [2019-12-07 18:47:54,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:47:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247841 states. [2019-12-07 18:47:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247841 to 245370. [2019-12-07 18:47:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245370 states. [2019-12-07 18:47:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245370 states to 245370 states and 266247 transitions. [2019-12-07 18:47:57,252 INFO L78 Accepts]: Start accepts. Automaton has 245370 states and 266247 transitions. Word has length 496 [2019-12-07 18:47:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:47:57,253 INFO L462 AbstractCegarLoop]: Abstraction has 245370 states and 266247 transitions. [2019-12-07 18:47:57,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:47:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 245370 states and 266247 transitions. [2019-12-07 18:47:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-12-07 18:47:57,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:47:57,446 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:47:57,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:47:57,647 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:47:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:47:57,648 INFO L82 PathProgramCache]: Analyzing trace with hash -160888231, now seen corresponding path program 1 times [2019-12-07 18:47:57,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:47:57,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613155171] [2019-12-07 18:47:57,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:47:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:47:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2019-12-07 18:47:59,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613155171] [2019-12-07 18:47:59,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:47:59,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:47:59,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616159680] [2019-12-07 18:47:59,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:47:59,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:47:59,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:47:59,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:47:59,484 INFO L87 Difference]: Start difference. First operand 245370 states and 266247 transitions. Second operand 4 states. [2019-12-07 18:48:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:48:01,546 INFO L93 Difference]: Finished difference Result 517387 states and 562253 transitions. [2019-12-07 18:48:01,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:48:01,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 645 [2019-12-07 18:48:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:48:01,808 INFO L225 Difference]: With dead ends: 517387 [2019-12-07 18:48:01,808 INFO L226 Difference]: Without dead ends: 268365 [2019-12-07 18:48:01,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:48:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268365 states. [2019-12-07 18:48:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268365 to 237839. [2019-12-07 18:48:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237839 states. [2019-12-07 18:48:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237839 states to 237839 states and 254965 transitions. [2019-12-07 18:48:04,514 INFO L78 Accepts]: Start accepts. Automaton has 237839 states and 254965 transitions. Word has length 645 [2019-12-07 18:48:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:48:04,515 INFO L462 AbstractCegarLoop]: Abstraction has 237839 states and 254965 transitions. [2019-12-07 18:48:04,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:48:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 237839 states and 254965 transitions. [2019-12-07 18:48:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-12-07 18:48:04,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:48:04,698 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:48:04,698 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:48:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:48:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash -921639282, now seen corresponding path program 2 times [2019-12-07 18:48:04,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:48:04,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169583265] [2019-12-07 18:48:04,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:48:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:48:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 708 proven. 8 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-12-07 18:48:05,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169583265] [2019-12-07 18:48:05,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972775729] [2019-12-07 18:48:05,292 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:48:05,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:48:05,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:48:05,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:48:05,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:48:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 695 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2019-12-07 18:48:05,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:48:05,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 18:48:05,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490104091] [2019-12-07 18:48:05,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:48:05,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:48:05,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:48:05,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:48:05,665 INFO L87 Difference]: Start difference. First operand 237839 states and 254965 transitions. Second operand 3 states. [2019-12-07 18:48:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:48:07,300 INFO L93 Difference]: Finished difference Result 615064 states and 658819 transitions. [2019-12-07 18:48:07,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:48:07,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 652 [2019-12-07 18:48:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:48:07,661 INFO L225 Difference]: With dead ends: 615064 [2019-12-07 18:48:07,661 INFO L226 Difference]: Without dead ends: 377227 [2019-12-07 18:48:07,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:48:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377227 states. [2019-12-07 18:48:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377227 to 363609. [2019-12-07 18:48:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363609 states. [2019-12-07 18:48:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363609 states to 363609 states and 387230 transitions. [2019-12-07 18:48:11,749 INFO L78 Accepts]: Start accepts. Automaton has 363609 states and 387230 transitions. Word has length 652 [2019-12-07 18:48:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:48:11,750 INFO L462 AbstractCegarLoop]: Abstraction has 363609 states and 387230 transitions. [2019-12-07 18:48:11,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:48:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 363609 states and 387230 transitions. [2019-12-07 18:48:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2019-12-07 18:48:12,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:48:12,001 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:48:12,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:48:12,202 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:48:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:48:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1889137020, now seen corresponding path program 1 times [2019-12-07 18:48:12,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:48:12,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641489275] [2019-12-07 18:48:12,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:48:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:48:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2019-12-07 18:48:12,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641489275] [2019-12-07 18:48:12,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:48:12,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:48:12,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356022957] [2019-12-07 18:48:12,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:48:12,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:48:12,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:48:12,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:48:12,625 INFO L87 Difference]: Start difference. First operand 363609 states and 387230 transitions. Second operand 4 states. [2019-12-07 18:48:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:48:15,521 INFO L93 Difference]: Finished difference Result 901053 states and 958975 transitions. [2019-12-07 18:48:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:48:15,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 745 [2019-12-07 18:48:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:48:16,462 INFO L225 Difference]: With dead ends: 901053 [2019-12-07 18:48:16,462 INFO L226 Difference]: Without dead ends: 537446 [2019-12-07 18:48:16,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:48:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537446 states. [2019-12-07 18:48:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537446 to 524454. [2019-12-07 18:48:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524454 states. [2019-12-07 18:48:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524454 states to 524454 states and 558221 transitions. [2019-12-07 18:48:24,202 INFO L78 Accepts]: Start accepts. Automaton has 524454 states and 558221 transitions. Word has length 745 [2019-12-07 18:48:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:48:24,202 INFO L462 AbstractCegarLoop]: Abstraction has 524454 states and 558221 transitions. [2019-12-07 18:48:24,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:48:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 524454 states and 558221 transitions. [2019-12-07 18:48:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-12-07 18:48:24,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:48:24,481 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:48:24,481 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:48:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:48:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash 230182986, now seen corresponding path program 1 times [2019-12-07 18:48:24,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:48:24,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116510533] [2019-12-07 18:48:24,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:48:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:48:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2228 backedges. 920 proven. 8 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-12-07 18:48:25,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116510533] [2019-12-07 18:48:25,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068526330] [2019-12-07 18:48:25,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:48:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:48:25,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:48:25,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:48:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2228 backedges. 1394 proven. 0 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2019-12-07 18:48:25,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:48:25,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 18:48:25,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348115407] [2019-12-07 18:48:25,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:48:25,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:48:25,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:48:25,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:48:25,915 INFO L87 Difference]: Start difference. First operand 524454 states and 558221 transitions. Second operand 3 states. [2019-12-07 18:48:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:48:29,250 INFO L93 Difference]: Finished difference Result 1348932 states and 1435391 transitions. [2019-12-07 18:48:29,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:48:29,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 748 [2019-12-07 18:48:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:48:30,216 INFO L225 Difference]: With dead ends: 1348932 [2019-12-07 18:48:30,216 INFO L226 Difference]: Without dead ends: 824480 [2019-12-07 18:48:30,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:48:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824480 states. [2019-12-07 18:48:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824480 to 810452. [2019-12-07 18:48:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810452 states. [2019-12-07 18:48:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810452 states to 810452 states and 859429 transitions. [2019-12-07 18:48:42,790 INFO L78 Accepts]: Start accepts. Automaton has 810452 states and 859429 transitions. Word has length 748 [2019-12-07 18:48:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:48:42,790 INFO L462 AbstractCegarLoop]: Abstraction has 810452 states and 859429 transitions. [2019-12-07 18:48:42,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:48:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 810452 states and 859429 transitions. [2019-12-07 18:48:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2019-12-07 18:48:43,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:48:43,283 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:48:43,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:48:43,484 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:48:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:48:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash -569413216, now seen corresponding path program 1 times [2019-12-07 18:48:43,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:48:43,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624299827] [2019-12-07 18:48:43,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:48:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:48:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 968 proven. 8 refuted. 0 times theorem prover too weak. 1234 trivial. 0 not checked. [2019-12-07 18:48:44,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624299827] [2019-12-07 18:48:44,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062603996] [2019-12-07 18:48:44,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:48:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:48:44,491 INFO L264 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:48:44,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:48:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1410 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-12-07 18:48:44,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:48:44,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 18:48:44,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421758655] [2019-12-07 18:48:44,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:48:44,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:48:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:48:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:48:44,751 INFO L87 Difference]: Start difference. First operand 810452 states and 859429 transitions. Second operand 3 states. [2019-12-07 18:48:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:48:48,650 INFO L93 Difference]: Finished difference Result 1482276 states and 1571642 transitions. [2019-12-07 18:48:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:48:48,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 773 [2019-12-07 18:48:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:48:48,651 INFO L225 Difference]: With dead ends: 1482276 [2019-12-07 18:48:48,651 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:48:49,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 772 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:48:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:48:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:48:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:48:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:48:49,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 773 [2019-12-07 18:48:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:48:49,248 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:48:49,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:48:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:48:49,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:48:49,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:48:49,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:50:52,292 WARN L192 SmtUtils]: Spent 2.05 m on a formula simplification. DAG size of input: 5741 DAG size of output: 3808 [2019-12-07 18:52:55,193 WARN L192 SmtUtils]: Spent 2.05 m on a formula simplification. DAG size of input: 5741 DAG size of output: 3808 [2019-12-07 18:55:16,023 WARN L192 SmtUtils]: Spent 2.35 m on a formula simplification. DAG size of input: 3687 DAG size of output: 176 [2019-12-07 18:57:37,003 WARN L192 SmtUtils]: Spent 2.35 m on a formula simplification. DAG size of input: 3687 DAG size of output: 176 [2019-12-07 18:57:37,008 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 18:57:37,008 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 18:57:37,008 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,008 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,008 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,008 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,008 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,009 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,010 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,011 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,012 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,013 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,014 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,015 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 18:57:37,016 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,017 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,018 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 18:57:37,019 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 18:57:37,020 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 18:57:37,021 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 18:57:37,021 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 18:57:37,021 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 18:57:37,021 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 18:57:37,021 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,021 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,021 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,023 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse16 (= 1 ~a6~0)) (.cse5 (= ~a11~0 1)) (.cse1 (= ~a27~0 1))) (let ((.cse22 (not .cse1)) (.cse13 (= ~a14~0 1)) (.cse3 (= ~a12~0 1)) (.cse8 (<= 2 ~a3~0)) (.cse18 (= 1 ~a8~0)) (.cse19 (= ~a23~0 1)) (.cse0 (<= ~a3~0 0)) (.cse9 (not .cse5)) (.cse4 (= ~a29~0 1)) (.cse10 (= ~a16~0 1)) (.cse21 (= ~a15~0 1)) (.cse17 (not (= ~a20~0 1))) (.cse11 (not (= 1 ~a7~0))) (.cse6 (= ~a26~0 1)) (.cse14 (<= ~a12~0 0)) (.cse20 (= ~a20~0 0)) (.cse15 (= 1 ~a3~0)) (.cse2 (= 1 ~a5~0)) (.cse12 (<= ~a26~0 0)) (.cse7 (not .cse16))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse6) (and .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse0 .cse2 .cse3 .cse11 .cse9 .cse7 .cse12) (and .cse13 .cse2 .cse1 .cse3 .cse11 .cse9 .cse7 .cse4 .cse6) (and .cse14 .cse1 .cse2 .cse11 .cse12 .cse5 .cse7 .cse10) (and .cse0 .cse14 .cse1 .cse2 .cse12 .cse4 .cse5 .cse7) (and .cse15 .cse2 .cse16 .cse3 .cse11 .cse9 .cse6) (and .cse17 .cse14 .cse1 .cse15 .cse2 .cse9 .cse12 .cse10) (and .cse14 .cse8 .cse2 .cse16 .cse18 .cse19 .cse5 .cse6) (and .cse8 .cse2 .cse3 .cse11 .cse7 .cse6) (and .cse14 .cse20 .cse1 .cse15 .cse2 .cse9 .cse12) (and .cse14 .cse8 .cse1 .cse2 .cse11 .cse12 .cse19 .cse5) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse10) (and .cse0 .cse17 .cse14 .cse13 .cse1 .cse2 .cse9 .cse4 .cse12) (and .cse14 .cse2 .cse16 .cse11 .cse4 .cse9 .cse6) (and .cse0 .cse17 .cse14 .cse1 .cse2 .cse12 .cse5) (and .cse0 .cse14 .cse2 .cse1 .cse9 .cse7 .cse6 .cse21) (and .cse15 .cse2 .cse16 .cse3 .cse22 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse14 .cse1 .cse2 .cse16 .cse11 .cse9 .cse6 .cse21) (and .cse0 .cse14 .cse1 .cse2 .cse16 .cse11 .cse9 .cse10) (and .cse17 .cse14 .cse8 .cse2 .cse22 .cse7 .cse12 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse9 .cse10 .cse6) (and .cse17 .cse14 .cse8 .cse2 .cse16 .cse22 .cse9 .cse10 .cse6) (and .cse0 .cse13 .cse2 .cse16 .cse3 .cse11 .cse5 .cse6) (and .cse0 .cse17 .cse2 .cse3 .cse9 .cse7 .cse6 .cse10 (<= ~a27~0 0)) (and .cse14 .cse20 .cse8 .cse2 .cse1 .cse9 .cse7 .cse12) (and .cse0 .cse17 .cse1 .cse2 .cse16 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse1 .cse3 .cse18 .cse9 .cse7 .cse6 .cse21) (and .cse8 .cse1 .cse2 .cse16 .cse3 .cse11 .cse12 .cse5 .cse10) (and .cse8 .cse2 .cse3 .cse22 .cse9 .cse10 .cse6) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse12 .cse4 .cse21) (and .cse14 .cse1 .cse2 .cse16 .cse11 .cse9 .cse12 .cse10) (and .cse14 .cse8 .cse1 .cse2 .cse5 .cse7 .cse6 .cse10) (and .cse0 .cse2 .cse1 .cse3 .cse11 .cse9 .cse7 .cse6 .cse10) (and .cse8 .cse2 .cse3 .cse22 .cse7 .cse10 .cse6) (and .cse14 .cse8 .cse2 .cse16 .cse12 .cse9) (and .cse17 .cse14 .cse8 .cse2 .cse1 .cse12 .cse7 .cse5) (and .cse17 .cse14 .cse8 .cse1 .cse2 .cse16 .cse9 .cse6) (and .cse14 .cse1 .cse2 .cse16 .cse9 .cse12 .cse4 .cse10) (and .cse17 .cse14 .cse2 .cse15 .cse9 .cse7 .cse12) (and .cse8 .cse1 .cse2 .cse16 .cse3 .cse11 .cse9 .cse12 .cse4) (and .cse15 .cse2 .cse3 .cse5 .cse7 .cse6) (and .cse0 .cse17 .cse2 .cse16 .cse3 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse18 .cse9 .cse7 .cse12 .cse19) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse7 .cse10 .cse21) (and .cse14 .cse8 .cse2 .cse11 .cse12 .cse5 .cse7) (and .cse14 .cse8 .cse1 .cse2 .cse16 .cse12 .cse19 .cse21) (and .cse14 .cse15 .cse2 .cse11 .cse6 .cse10) (and .cse17 .cse13 .cse8 .cse2 .cse1 .cse3 .cse11 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse18 .cse5 .cse21) (and .cse15 .cse2 .cse16 .cse3 .cse11 .cse12 .cse9) (and .cse0 .cse2 .cse16 .cse3 .cse22 .cse5 .cse6 .cse10) (and .cse0 .cse17 .cse2 .cse1 .cse3 .cse9 .cse7 .cse6) (and .cse0 .cse13 .cse1 .cse2 .cse16 .cse3 .cse11 .cse10 .cse21) (and .cse2 .cse3 .cse22 .cse18 .cse7 .cse5 .cse10 .cse6) (and .cse0 .cse14 .cse2 .cse16 .cse11 .cse6) (and .cse14 .cse1 .cse2 .cse16 .cse11 .cse9 .cse6 .cse10) (and .cse0 .cse17 .cse14 .cse1 .cse2 .cse9 .cse12 .cse21) (and .cse14 .cse1 .cse15 .cse2 .cse11 .cse6 .cse21) (and .cse2 .cse3 .cse22 .cse11 .cse7 .cse4 .cse5 .cse10 .cse6) (and .cse0 .cse14 .cse1 .cse2 .cse16 .cse9 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse3 .cse11 .cse9 .cse6) (and .cse17 .cse14 .cse2 .cse1 .cse9 .cse7 .cse12 .cse4 .cse21) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse16 .cse3 .cse9 .cse12 .cse4 .cse10) (and .cse0 .cse14 .cse2 .cse1 .cse9 .cse7 .cse12 .cse4 .cse10) (and .cse17 .cse14 .cse1 .cse15 .cse2 .cse9 .cse6) (and .cse8 .cse2 .cse3 .cse9 .cse7 .cse6) (and .cse14 .cse15 .cse2 .cse9 .cse7 .cse6) (and .cse0 .cse17 .cse14 .cse1 .cse2 .cse11 .cse9 .cse12) (and .cse0 .cse14 .cse2 .cse16 .cse5 .cse6) (and .cse1 .cse2 .cse16 .cse3 .cse11 .cse9 .cse4 .cse6) (and .cse8 .cse2 .cse3 .cse4 .cse7 .cse6) (and .cse0 .cse14 .cse1 .cse2 .cse11 .cse5 .cse7 .cse10) (and .cse14 .cse8 .cse1 .cse2 .cse5 .cse7 .cse6 .cse21) (and .cse0 .cse13 .cse1 .cse2 .cse16 .cse3 .cse9 .cse10 .cse21) (and .cse0 .cse14 .cse1 .cse2 .cse11 .cse9 .cse12 .cse4) (and .cse14 .cse8 .cse1 .cse2 .cse16 .cse4 .cse6 .cse10) (and .cse1 .cse2 .cse16 .cse3 .cse9 .cse6 .cse21) (and .cse17 .cse14 .cse1 .cse2 .cse9 .cse7 .cse6 .cse21) (and .cse2 .cse16 .cse3 .cse22 .cse11 .cse9 .cse12 .cse10) (and .cse17 .cse2 .cse1 .cse15 .cse3 .cse5 .cse6 .cse10 .cse21) (and .cse0 .cse17 .cse1 .cse2 .cse16 .cse3 .cse5 .cse21) (and .cse14 .cse15 .cse2 .cse16 .cse11 .cse6) (and .cse8 .cse2 .cse1 .cse3 .cse18 .cse9 .cse7 .cse12) (and .cse14 .cse8 .cse1 .cse2 .cse4 .cse5 .cse7 .cse6) (and .cse17 .cse14 .cse2 .cse16 .cse5 .cse6) (and .cse14 .cse13 .cse1 .cse15 .cse2 .cse16 .cse9 .cse12 .cse4) (and .cse8 .cse1 .cse2 .cse16 .cse3 .cse9 .cse12 .cse4 .cse21) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse6 .cse21) (and .cse14 .cse8 .cse1 .cse2 .cse16 .cse12 .cse19 .cse10) (and .cse14 .cse1 .cse15 .cse2 .cse16 .cse18 .cse19 .cse6) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse4 .cse10 .cse21) (and .cse17 .cse14 .cse2 .cse16 .cse11 .cse6) (and .cse14 .cse20 .cse1 .cse15 .cse2 .cse12 .cse7)))) [2019-12-07 18:57:37,023 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,023 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,023 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,023 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1632) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,024 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,025 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 18:57:37,026 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 18:57:37,026 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse16 (= 1 ~a6~0)) (.cse5 (= ~a11~0 1)) (.cse1 (= ~a27~0 1))) (let ((.cse22 (not .cse1)) (.cse13 (= ~a14~0 1)) (.cse3 (= ~a12~0 1)) (.cse8 (<= 2 ~a3~0)) (.cse18 (= 1 ~a8~0)) (.cse19 (= ~a23~0 1)) (.cse0 (<= ~a3~0 0)) (.cse9 (not .cse5)) (.cse4 (= ~a29~0 1)) (.cse10 (= ~a16~0 1)) (.cse21 (= ~a15~0 1)) (.cse17 (not (= ~a20~0 1))) (.cse11 (not (= 1 ~a7~0))) (.cse6 (= ~a26~0 1)) (.cse14 (<= ~a12~0 0)) (.cse20 (= ~a20~0 0)) (.cse15 (= 1 ~a3~0)) (.cse2 (= 1 ~a5~0)) (.cse12 (<= ~a26~0 0)) (.cse7 (not .cse16))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse6) (and .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse0 .cse2 .cse3 .cse11 .cse9 .cse7 .cse12) (and .cse13 .cse2 .cse1 .cse3 .cse11 .cse9 .cse7 .cse4 .cse6) (and .cse14 .cse1 .cse2 .cse11 .cse12 .cse5 .cse7 .cse10) (and .cse0 .cse14 .cse1 .cse2 .cse12 .cse4 .cse5 .cse7) (and .cse15 .cse2 .cse16 .cse3 .cse11 .cse9 .cse6) (and .cse17 .cse14 .cse1 .cse15 .cse2 .cse9 .cse12 .cse10) (and .cse14 .cse8 .cse2 .cse16 .cse18 .cse19 .cse5 .cse6) (and .cse8 .cse2 .cse3 .cse11 .cse7 .cse6) (and .cse14 .cse20 .cse1 .cse15 .cse2 .cse9 .cse12) (and .cse14 .cse8 .cse1 .cse2 .cse11 .cse12 .cse19 .cse5) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse10) (and .cse0 .cse17 .cse14 .cse13 .cse1 .cse2 .cse9 .cse4 .cse12) (and .cse14 .cse2 .cse16 .cse11 .cse4 .cse9 .cse6) (and .cse0 .cse17 .cse14 .cse1 .cse2 .cse12 .cse5) (and .cse0 .cse14 .cse2 .cse1 .cse9 .cse7 .cse6 .cse21) (and .cse15 .cse2 .cse16 .cse3 .cse22 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse14 .cse1 .cse2 .cse16 .cse11 .cse9 .cse6 .cse21) (and .cse0 .cse14 .cse1 .cse2 .cse16 .cse11 .cse9 .cse10) (and .cse17 .cse14 .cse8 .cse2 .cse22 .cse7 .cse12 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse9 .cse10 .cse6) (and .cse17 .cse14 .cse8 .cse2 .cse16 .cse22 .cse9 .cse10 .cse6) (and .cse0 .cse13 .cse2 .cse16 .cse3 .cse11 .cse5 .cse6) (and .cse0 .cse17 .cse2 .cse3 .cse9 .cse7 .cse6 .cse10 (<= ~a27~0 0)) (and .cse14 .cse20 .cse8 .cse2 .cse1 .cse9 .cse7 .cse12) (and .cse0 .cse17 .cse1 .cse2 .cse16 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse1 .cse3 .cse18 .cse9 .cse7 .cse6 .cse21) (and .cse8 .cse1 .cse2 .cse16 .cse3 .cse11 .cse12 .cse5 .cse10) (and .cse8 .cse2 .cse3 .cse22 .cse9 .cse10 .cse6) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse12 .cse4 .cse21) (and .cse14 .cse1 .cse2 .cse16 .cse11 .cse9 .cse12 .cse10) (and .cse14 .cse8 .cse1 .cse2 .cse5 .cse7 .cse6 .cse10) (and .cse0 .cse2 .cse1 .cse3 .cse11 .cse9 .cse7 .cse6 .cse10) (and .cse8 .cse2 .cse3 .cse22 .cse7 .cse10 .cse6) (and .cse14 .cse8 .cse2 .cse16 .cse12 .cse9) (and .cse17 .cse14 .cse8 .cse2 .cse1 .cse12 .cse7 .cse5) (and .cse17 .cse14 .cse8 .cse1 .cse2 .cse16 .cse9 .cse6) (and .cse14 .cse1 .cse2 .cse16 .cse9 .cse12 .cse4 .cse10) (and .cse17 .cse14 .cse2 .cse15 .cse9 .cse7 .cse12) (and .cse8 .cse1 .cse2 .cse16 .cse3 .cse11 .cse9 .cse12 .cse4) (and .cse15 .cse2 .cse3 .cse5 .cse7 .cse6) (and .cse0 .cse17 .cse2 .cse16 .cse3 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse18 .cse9 .cse7 .cse12 .cse19) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse7 .cse10 .cse21) (and .cse14 .cse8 .cse2 .cse11 .cse12 .cse5 .cse7) (and .cse14 .cse8 .cse1 .cse2 .cse16 .cse12 .cse19 .cse21) (and .cse14 .cse15 .cse2 .cse11 .cse6 .cse10) (and .cse17 .cse13 .cse8 .cse2 .cse1 .cse3 .cse11 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse18 .cse5 .cse21) (and .cse15 .cse2 .cse16 .cse3 .cse11 .cse12 .cse9) (and .cse0 .cse2 .cse16 .cse3 .cse22 .cse5 .cse6 .cse10) (and .cse0 .cse17 .cse2 .cse1 .cse3 .cse9 .cse7 .cse6) (and .cse0 .cse13 .cse1 .cse2 .cse16 .cse3 .cse11 .cse10 .cse21) (and .cse2 .cse3 .cse22 .cse18 .cse7 .cse5 .cse10 .cse6) (and .cse0 .cse14 .cse2 .cse16 .cse11 .cse6) (and .cse14 .cse1 .cse2 .cse16 .cse11 .cse9 .cse6 .cse10) (and .cse0 .cse17 .cse14 .cse1 .cse2 .cse9 .cse12 .cse21) (and .cse14 .cse1 .cse15 .cse2 .cse11 .cse6 .cse21) (and .cse2 .cse3 .cse22 .cse11 .cse7 .cse4 .cse5 .cse10 .cse6) (and .cse0 .cse14 .cse1 .cse2 .cse16 .cse9 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse3 .cse11 .cse9 .cse6) (and .cse17 .cse14 .cse2 .cse1 .cse9 .cse7 .cse12 .cse4 .cse21) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse16 .cse3 .cse9 .cse12 .cse4 .cse10) (and .cse0 .cse14 .cse2 .cse1 .cse9 .cse7 .cse12 .cse4 .cse10) (and .cse17 .cse14 .cse1 .cse15 .cse2 .cse9 .cse6) (and .cse8 .cse2 .cse3 .cse9 .cse7 .cse6) (and .cse14 .cse15 .cse2 .cse9 .cse7 .cse6) (and .cse0 .cse17 .cse14 .cse1 .cse2 .cse11 .cse9 .cse12) (and .cse0 .cse14 .cse2 .cse16 .cse5 .cse6) (and .cse1 .cse2 .cse16 .cse3 .cse11 .cse9 .cse4 .cse6) (and .cse8 .cse2 .cse3 .cse4 .cse7 .cse6) (and .cse0 .cse14 .cse1 .cse2 .cse11 .cse5 .cse7 .cse10) (and .cse14 .cse8 .cse1 .cse2 .cse5 .cse7 .cse6 .cse21) (and .cse0 .cse13 .cse1 .cse2 .cse16 .cse3 .cse9 .cse10 .cse21) (and .cse0 .cse14 .cse1 .cse2 .cse11 .cse9 .cse12 .cse4) (and .cse14 .cse8 .cse1 .cse2 .cse16 .cse4 .cse6 .cse10) (and .cse1 .cse2 .cse16 .cse3 .cse9 .cse6 .cse21) (and .cse17 .cse14 .cse1 .cse2 .cse9 .cse7 .cse6 .cse21) (and .cse2 .cse16 .cse3 .cse22 .cse11 .cse9 .cse12 .cse10) (and .cse17 .cse2 .cse1 .cse15 .cse3 .cse5 .cse6 .cse10 .cse21) (and .cse0 .cse17 .cse1 .cse2 .cse16 .cse3 .cse5 .cse21) (and .cse14 .cse15 .cse2 .cse16 .cse11 .cse6) (and .cse8 .cse2 .cse1 .cse3 .cse18 .cse9 .cse7 .cse12) (and .cse14 .cse8 .cse1 .cse2 .cse4 .cse5 .cse7 .cse6) (and .cse17 .cse14 .cse2 .cse16 .cse5 .cse6) (and .cse14 .cse13 .cse1 .cse15 .cse2 .cse16 .cse9 .cse12 .cse4) (and .cse8 .cse1 .cse2 .cse16 .cse3 .cse9 .cse12 .cse4 .cse21) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse6 .cse21) (and .cse14 .cse8 .cse1 .cse2 .cse16 .cse12 .cse19 .cse10) (and .cse14 .cse1 .cse15 .cse2 .cse16 .cse18 .cse19 .cse6) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse4 .cse10 .cse21) (and .cse17 .cse14 .cse2 .cse16 .cse11 .cse6) (and .cse14 .cse20 .cse1 .cse15 .cse2 .cse12 .cse7)))) [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,027 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,028 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,029 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 18:57:37,030 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,031 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,032 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,033 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 18:57:37,034 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 18:57:37,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:57:37 BoogieIcfgContainer [2019-12-07 18:57:37,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:57:37,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:57:37,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:57:37,100 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:57:37,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:47:16" (3/4) ... [2019-12-07 18:57:37,103 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:57:37,128 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:57:37,130 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:57:37,257 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_44fe5913-30f1-49fe-a93c-799f3e13b662/bin/uautomizer/witness.graphml [2019-12-07 18:57:37,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:57:37,258 INFO L168 Benchmark]: Toolchain (without parser) took 622749.03 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 939.9 MB in the beginning and 1.3 GB in the end (delta: -403.7 MB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. [2019-12-07 18:57:37,258 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:57:37,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.9 MB in the beginning and 1.0 GB in the end (delta: -90.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:57:37,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:57:37,259 INFO L168 Benchmark]: Boogie Preprocessor took 59.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:57:37,259 INFO L168 Benchmark]: RCFGBuilder took 1220.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.8 MB in the end (delta: 20.9 MB). Peak memory consumption was 198.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:57:37,259 INFO L168 Benchmark]: TraceAbstraction took 620619.74 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.1 GB). Free memory was 987.8 MB in the beginning and 1.4 GB in the end (delta: -438.8 MB). Peak memory consumption was 6.9 GB. Max. memory is 11.5 GB. [2019-12-07 18:57:37,259 INFO L168 Benchmark]: Witness Printer took 156.98 ms. Allocated memory is still 7.3 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 83.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:57:37,261 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.9 MB in the beginning and 1.0 GB in the end (delta: -90.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1220.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.8 MB in the end (delta: 20.9 MB). Peak memory consumption was 198.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 620619.74 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.1 GB). Free memory was 987.8 MB in the beginning and 1.4 GB in the end (delta: -438.8 MB). Peak memory consumption was 6.9 GB. Max. memory is 11.5 GB. * Witness Printer took 156.98 ms. Allocated memory is still 7.3 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 83.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1632]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a29 == 1) && a11 == 1) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || ((((((2 <= a3 && 1 == a5) && a12 == 1) && a29 == 1) && !(a11 == 1)) && a26 == 1) && a16 == 1)) || ((((((a3 <= 0 && 1 == a5) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0)) || ((((((((a14 == 1 && 1 == a5) && a27 == 1) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && !(1 == a6)) && a29 == 1) && a26 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a11 == 1) && !(1 == a6)) && a16 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && a26 <= 0) && a29 == 1) && a11 == 1) && !(1 == a6))) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a26 == 1)) || (((((((!(a20 == 1) && a12 <= 0) && a27 == 1) && 1 == a3) && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || (((((((a12 <= 0 && 2 <= a3) && 1 == a5) && 1 == a6) && 1 == a8) && a23 == 1) && a11 == 1) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && a12 == 1) && !(1 == a7)) && !(1 == a6)) && a26 == 1)) || ((((((a12 <= 0 && a20 == 0) && a27 == 1) && 1 == a3) && 1 == a5) && !(a11 == 1)) && a26 <= 0)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a23 == 1) && a11 == 1)) || (((((a3 <= 0 && a12 <= 0) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((((((a3 <= 0 && !(a20 == 1)) && a12 <= 0) && a14 == 1) && a27 == 1) && 1 == a5) && !(a11 == 1)) && a29 == 1) && a26 <= 0)) || ((((((a12 <= 0 && 1 == a5) && 1 == a6) && !(1 == a7)) && a29 == 1) && !(a11 == 1)) && a26 == 1)) || ((((((a3 <= 0 && !(a20 == 1)) && a12 <= 0) && a27 == 1) && 1 == a5) && a26 <= 0) && a11 == 1)) || (((((((a3 <= 0 && a12 <= 0) && 1 == a5) && a27 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a15 == 1)) || (((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(a27 == 1)) && !(1 == a7)) && a26 <= 0) && a16 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a26 == 1) && a15 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1)) || ((((((((!(a20 == 1) && a12 <= 0) && 2 <= a3) && 1 == a5) && !(a27 == 1)) && !(1 == a6)) && a26 <= 0) && a11 == 1) && a16 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a16 == 1) && a26 == 1)) || ((((((((!(a20 == 1) && a12 <= 0) && 2 <= a3) && 1 == a5) && 1 == a6) && !(a27 == 1)) && !(a11 == 1)) && a16 == 1) && a26 == 1)) || (((((((a3 <= 0 && a14 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a11 == 1) && a26 == 1)) || ((((((((a3 <= 0 && !(a20 == 1)) && 1 == a5) && a12 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a16 == 1) && a27 <= 0)) || (((((((a12 <= 0 && a20 == 0) && 2 <= a3) && 1 == a5) && a27 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0)) || (((((((a3 <= 0 && !(a20 == 1)) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a26 == 1)) || ((((((((a3 <= 0 && 1 == a5) && a27 == 1) && a12 == 1) && 1 == a8) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a15 == 1)) || ((((((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a26 <= 0) && a11 == 1) && a16 == 1)) || ((((((2 <= a3 && 1 == a5) && a12 == 1) && !(a27 == 1)) && !(a11 == 1)) && a16 == 1) && a26 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a29 == 1) && a15 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1)) || ((((((((a3 <= 0 && 1 == a5) && a27 == 1) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a16 == 1)) || ((((((2 <= a3 && 1 == a5) && a12 == 1) && !(a27 == 1)) && !(1 == a6)) && a16 == 1) && a26 == 1)) || (((((a12 <= 0 && 2 <= a3) && 1 == a5) && 1 == a6) && a26 <= 0) && !(a11 == 1))) || (((((((!(a20 == 1) && a12 <= 0) && 2 <= a3) && 1 == a5) && a27 == 1) && a26 <= 0) && !(1 == a6)) && a11 == 1)) || (((((((!(a20 == 1) && a12 <= 0) && 2 <= a3) && a27 == 1) && 1 == a5) && 1 == a6) && !(a11 == 1)) && a26 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a11 == 1)) && a26 <= 0) && a29 == 1) && a16 == 1)) || ((((((!(a20 == 1) && a12 <= 0) && 1 == a5) && 1 == a3) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0)) || ((((((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0) && a29 == 1)) || (((((1 == a3 && 1 == a5) && a12 == 1) && a11 == 1) && !(1 == a6)) && a26 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a11 == 1) && a26 == 1)) || (((((((a3 <= 0 && 1 == a5) && a12 == 1) && 1 == a8) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0) && a23 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && a29 == 1) && !(1 == a6)) && a16 == 1) && a15 == 1)) || ((((((a12 <= 0 && 2 <= a3) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a11 == 1) && !(1 == a6))) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && 1 == a6) && a26 <= 0) && a23 == 1) && a15 == 1)) || (((((a12 <= 0 && 1 == a3) && 1 == a5) && !(1 == a7)) && a26 == 1) && a16 == 1)) || (((((((((!(a20 == 1) && a14 == 1) && 2 <= a3) && 1 == a5) && a27 == 1) && a12 == 1) && !(1 == a7)) && a29 == 1) && a26 == 1) && a16 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && 1 == a8) && a11 == 1) && a15 == 1)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a26 <= 0) && !(a11 == 1))) || (((((((a3 <= 0 && 1 == a5) && 1 == a6) && a12 == 1) && !(a27 == 1)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && 1 == a5) && a27 == 1) && a12 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 == 1)) || ((((((((a3 <= 0 && a14 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a16 == 1) && a15 == 1)) || (((((((1 == a5 && a12 == 1) && !(a27 == 1)) && 1 == a8) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1)) || (((((a3 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a26 == 1) && a16 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && a12 <= 0) && a27 == 1) && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a15 == 1)) || ((((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && !(1 == a7)) && a26 == 1) && a15 == 1)) || ((((((((1 == a5 && a12 == 1) && !(a27 == 1)) && !(1 == a7)) && !(1 == a6)) && a29 == 1) && a11 == 1) && a16 == 1) && a26 == 1)) || ((((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a16 == 1)) || (((((2 <= a3 && 1 == a5) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a26 == 1)) || ((((((((!(a20 == 1) && a12 <= 0) && 1 == a5) && a27 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a15 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a11 == 1) && a26 == 1)) || ((((((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 <= 0) && a29 == 1) && a16 == 1)) || ((((((((a3 <= 0 && a12 <= 0) && 1 == a5) && a27 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a16 == 1)) || ((((((!(a20 == 1) && a12 <= 0) && a27 == 1) && 1 == a3) && 1 == a5) && !(a11 == 1)) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && a12 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 == 1)) || (((((a12 <= 0 && 1 == a3) && 1 == a5) && !(a11 == 1)) && !(1 == a6)) && a26 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0)) || (((((a3 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || (((((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && a12 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 == 1) && !(1 == a6)) && a16 == 1)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a15 == 1)) || ((((((((a3 <= 0 && a14 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0) && a29 == 1)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && 1 == a6) && a29 == 1) && a26 == 1) && a16 == 1)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) && a15 == 1)) || (((((((!(a20 == 1) && a12 <= 0) && a27 == 1) && 1 == a5) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a15 == 1)) || (((((((1 == a5 && 1 == a6) && a12 == 1) && !(a27 == 1)) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || ((((((((!(a20 == 1) && 1 == a5) && a27 == 1) && 1 == a3) && a12 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a15 == 1)) || (((((a12 <= 0 && 1 == a3) && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 == 1)) || (((((((2 <= a3 && 1 == a5) && a27 == 1) && a12 == 1) && 1 == a8) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && a29 == 1) && a11 == 1) && !(1 == a6)) && a26 == 1)) || (((((!(a20 == 1) && a12 <= 0) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((((((a12 <= 0 && a14 == 1) && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && !(a11 == 1)) && a26 <= 0) && a29 == 1)) || ((((((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 <= 0) && a29 == 1) && a15 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a26 == 1) && a15 == 1)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && 1 == a6) && a26 <= 0) && a23 == 1) && a16 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && 1 == a8) && a23 == 1) && a26 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && !(a11 == 1)) && a29 == 1) && a16 == 1) && a15 == 1)) || (((((!(a20 == 1) && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 == 1)) || ((((((a12 <= 0 && a20 == 0) && a27 == 1) && 1 == a3) && 1 == a5) && a26 <= 0) && !(1 == a6)) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a29 == 1) && a11 == 1) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || ((((((2 <= a3 && 1 == a5) && a12 == 1) && a29 == 1) && !(a11 == 1)) && a26 == 1) && a16 == 1)) || ((((((a3 <= 0 && 1 == a5) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0)) || ((((((((a14 == 1 && 1 == a5) && a27 == 1) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && !(1 == a6)) && a29 == 1) && a26 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a11 == 1) && !(1 == a6)) && a16 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && a26 <= 0) && a29 == 1) && a11 == 1) && !(1 == a6))) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a26 == 1)) || (((((((!(a20 == 1) && a12 <= 0) && a27 == 1) && 1 == a3) && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || (((((((a12 <= 0 && 2 <= a3) && 1 == a5) && 1 == a6) && 1 == a8) && a23 == 1) && a11 == 1) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && a12 == 1) && !(1 == a7)) && !(1 == a6)) && a26 == 1)) || ((((((a12 <= 0 && a20 == 0) && a27 == 1) && 1 == a3) && 1 == a5) && !(a11 == 1)) && a26 <= 0)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a23 == 1) && a11 == 1)) || (((((a3 <= 0 && a12 <= 0) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((((((a3 <= 0 && !(a20 == 1)) && a12 <= 0) && a14 == 1) && a27 == 1) && 1 == a5) && !(a11 == 1)) && a29 == 1) && a26 <= 0)) || ((((((a12 <= 0 && 1 == a5) && 1 == a6) && !(1 == a7)) && a29 == 1) && !(a11 == 1)) && a26 == 1)) || ((((((a3 <= 0 && !(a20 == 1)) && a12 <= 0) && a27 == 1) && 1 == a5) && a26 <= 0) && a11 == 1)) || (((((((a3 <= 0 && a12 <= 0) && 1 == a5) && a27 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a15 == 1)) || (((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(a27 == 1)) && !(1 == a7)) && a26 <= 0) && a16 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a26 == 1) && a15 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1)) || ((((((((!(a20 == 1) && a12 <= 0) && 2 <= a3) && 1 == a5) && !(a27 == 1)) && !(1 == a6)) && a26 <= 0) && a11 == 1) && a16 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a16 == 1) && a26 == 1)) || ((((((((!(a20 == 1) && a12 <= 0) && 2 <= a3) && 1 == a5) && 1 == a6) && !(a27 == 1)) && !(a11 == 1)) && a16 == 1) && a26 == 1)) || (((((((a3 <= 0 && a14 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a11 == 1) && a26 == 1)) || ((((((((a3 <= 0 && !(a20 == 1)) && 1 == a5) && a12 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a16 == 1) && a27 <= 0)) || (((((((a12 <= 0 && a20 == 0) && 2 <= a3) && 1 == a5) && a27 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0)) || (((((((a3 <= 0 && !(a20 == 1)) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a26 == 1)) || ((((((((a3 <= 0 && 1 == a5) && a27 == 1) && a12 == 1) && 1 == a8) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a15 == 1)) || ((((((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a26 <= 0) && a11 == 1) && a16 == 1)) || ((((((2 <= a3 && 1 == a5) && a12 == 1) && !(a27 == 1)) && !(a11 == 1)) && a16 == 1) && a26 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a29 == 1) && a15 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1)) || ((((((((a3 <= 0 && 1 == a5) && a27 == 1) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a16 == 1)) || ((((((2 <= a3 && 1 == a5) && a12 == 1) && !(a27 == 1)) && !(1 == a6)) && a16 == 1) && a26 == 1)) || (((((a12 <= 0 && 2 <= a3) && 1 == a5) && 1 == a6) && a26 <= 0) && !(a11 == 1))) || (((((((!(a20 == 1) && a12 <= 0) && 2 <= a3) && 1 == a5) && a27 == 1) && a26 <= 0) && !(1 == a6)) && a11 == 1)) || (((((((!(a20 == 1) && a12 <= 0) && 2 <= a3) && a27 == 1) && 1 == a5) && 1 == a6) && !(a11 == 1)) && a26 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a11 == 1)) && a26 <= 0) && a29 == 1) && a16 == 1)) || ((((((!(a20 == 1) && a12 <= 0) && 1 == a5) && 1 == a3) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0)) || ((((((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0) && a29 == 1)) || (((((1 == a3 && 1 == a5) && a12 == 1) && a11 == 1) && !(1 == a6)) && a26 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a11 == 1) && a26 == 1)) || (((((((a3 <= 0 && 1 == a5) && a12 == 1) && 1 == a8) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0) && a23 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && a29 == 1) && !(1 == a6)) && a16 == 1) && a15 == 1)) || ((((((a12 <= 0 && 2 <= a3) && 1 == a5) && !(1 == a7)) && a26 <= 0) && a11 == 1) && !(1 == a6))) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && 1 == a6) && a26 <= 0) && a23 == 1) && a15 == 1)) || (((((a12 <= 0 && 1 == a3) && 1 == a5) && !(1 == a7)) && a26 == 1) && a16 == 1)) || (((((((((!(a20 == 1) && a14 == 1) && 2 <= a3) && 1 == a5) && a27 == 1) && a12 == 1) && !(1 == a7)) && a29 == 1) && a26 == 1) && a16 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && 1 == a8) && a11 == 1) && a15 == 1)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a26 <= 0) && !(a11 == 1))) || (((((((a3 <= 0 && 1 == a5) && 1 == a6) && a12 == 1) && !(a27 == 1)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && 1 == a5) && a27 == 1) && a12 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 == 1)) || ((((((((a3 <= 0 && a14 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a16 == 1) && a15 == 1)) || (((((((1 == a5 && a12 == 1) && !(a27 == 1)) && 1 == a8) && !(1 == a6)) && a11 == 1) && a16 == 1) && a26 == 1)) || (((((a3 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a26 == 1) && a16 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && a12 <= 0) && a27 == 1) && 1 == a5) && !(a11 == 1)) && a26 <= 0) && a15 == 1)) || ((((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && !(1 == a7)) && a26 == 1) && a15 == 1)) || ((((((((1 == a5 && a12 == 1) && !(a27 == 1)) && !(1 == a7)) && !(1 == a6)) && a29 == 1) && a11 == 1) && a16 == 1) && a26 == 1)) || ((((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && 1 == a6) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a16 == 1)) || (((((2 <= a3 && 1 == a5) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a26 == 1)) || ((((((((!(a20 == 1) && a12 <= 0) && 1 == a5) && a27 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a15 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a11 == 1) && a26 == 1)) || ((((((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 <= 0) && a29 == 1) && a16 == 1)) || ((((((((a3 <= 0 && a12 <= 0) && 1 == a5) && a27 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0) && a29 == 1) && a16 == 1)) || ((((((!(a20 == 1) && a12 <= 0) && a27 == 1) && 1 == a3) && 1 == a5) && !(a11 == 1)) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && a12 == 1) && !(a11 == 1)) && !(1 == a6)) && a26 == 1)) || (((((a12 <= 0 && 1 == a3) && 1 == a5) && !(a11 == 1)) && !(1 == a6)) && a26 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0)) || (((((a3 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || (((((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && a12 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a7)) && a11 == 1) && !(1 == a6)) && a16 == 1)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a15 == 1)) || ((((((((a3 <= 0 && a14 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0) && a29 == 1)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && 1 == a6) && a29 == 1) && a26 == 1) && a16 == 1)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) && a15 == 1)) || (((((((!(a20 == 1) && a12 <= 0) && a27 == 1) && 1 == a5) && !(a11 == 1)) && !(1 == a6)) && a26 == 1) && a15 == 1)) || (((((((1 == a5 && 1 == a6) && a12 == 1) && !(a27 == 1)) && !(1 == a7)) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || ((((((((!(a20 == 1) && 1 == a5) && a27 == 1) && 1 == a3) && a12 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || (((((((a3 <= 0 && !(a20 == 1)) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) && a15 == 1)) || (((((a12 <= 0 && 1 == a3) && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 == 1)) || (((((((2 <= a3 && 1 == a5) && a27 == 1) && a12 == 1) && 1 == a8) && !(a11 == 1)) && !(1 == a6)) && a26 <= 0)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && a29 == 1) && a11 == 1) && !(1 == a6)) && a26 == 1)) || (((((!(a20 == 1) && a12 <= 0) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((((((a12 <= 0 && a14 == 1) && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && !(a11 == 1)) && a26 <= 0) && a29 == 1)) || ((((((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 <= 0) && a29 == 1) && a15 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a26 == 1) && a15 == 1)) || (((((((a12 <= 0 && 2 <= a3) && a27 == 1) && 1 == a5) && 1 == a6) && a26 <= 0) && a23 == 1) && a16 == 1)) || (((((((a12 <= 0 && a27 == 1) && 1 == a3) && 1 == a5) && 1 == a6) && 1 == a8) && a23 == 1) && a26 == 1)) || (((((((a3 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5) && !(a11 == 1)) && a29 == 1) && a16 == 1) && a15 == 1)) || (((((!(a20 == 1) && a12 <= 0) && 1 == a5) && 1 == a6) && !(1 == a7)) && a26 == 1)) || ((((((a12 <= 0 && a20 == 0) && a27 == 1) && 1 == a3) && 1 == a5) && a26 <= 0) && !(1 == a6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 92.9s, OverallIterations: 24, TraceHistogramMax: 13, AutomataDifference: 37.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 527.5s, HoareTripleCheckerStatistics: 5690 SDtfs, 7485 SDslu, 2484 SDs, 0 SdLazy, 14328 SolverSat, 2404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3305 GetRequests, 3243 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810452occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 209470 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 6408 NumberOfFragments, 4993 HoareAnnotationTreeSize, 3 FomulaSimplifications, 402762 FormulaSimplificationTreeSizeReduction, 245.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 463886 FormulaSimplificationTreeSizeReductionInter, 281.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 12526 NumberOfCodeBlocks, 12526 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 12496 ConstructedInterpolants, 0 QuantifiedInterpolants, 15513281 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5338 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 18523/18573 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...