./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label21.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_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label21.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 79a2b9b3df0deda592133ad8079a83707bf29ec3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:33:32,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:33:32,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:33:32,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:33:32,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:33:32,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:33:32,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:33:32,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:33:32,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:33:32,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:33:32,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:33:32,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:33:32,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:33:32,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:33:32,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:33:32,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:33:32,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:33:32,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:33:32,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:33:32,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:33:32,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:33:32,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:33:32,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:33:32,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:33:32,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:33:32,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:33:32,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:33:32,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:33:32,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:33:32,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:33:32,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:33:32,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:33:32,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:33:32,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:33:32,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:33:32,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:33:32,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:33:32,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:33:32,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:33:32,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:33:32,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:33:32,844 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:33:32,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:33:32,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:33:32,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:33:32,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:33:32,854 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:33:32,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:33:32,855 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:33:32,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:33:32,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:33:32,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:33:32,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:33:32,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:33:32,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:33:32,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:33:32,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:33:32,856 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:33:32,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:33:32,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:33:32,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:33:32,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:33:32,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:33:32,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:33:32,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:33:32,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:33:32,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:33:32,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:33:32,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:33:32,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:33:32,857 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:33:32,857 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_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 -> 79a2b9b3df0deda592133ad8079a83707bf29ec3 [2019-12-07 11:33:32,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:33:32,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:33:32,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:33:32,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:33:32,974 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:33:32,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem17_label21.c [2019-12-07 11:33:33,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/data/5e74a25c5/d60e5a09fe2a4b5580f2d01034a19c54/FLAG27cc2838b [2019-12-07 11:33:33,576 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:33:33,577 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/sv-benchmarks/c/eca-rers2012/Problem17_label21.c [2019-12-07 11:33:33,591 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/data/5e74a25c5/d60e5a09fe2a4b5580f2d01034a19c54/FLAG27cc2838b [2019-12-07 11:33:34,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/data/5e74a25c5/d60e5a09fe2a4b5580f2d01034a19c54 [2019-12-07 11:33:34,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:33:34,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:33:34,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:33:34,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:33:34,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:33:34,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:34,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34, skipping insertion in model container [2019-12-07 11:33:34,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:34,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:33:34,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:33:34,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:33:34,658 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:33:34,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:33:34,901 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:33:34,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34 WrapperNode [2019-12-07 11:33:34,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:33:34,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:33:34,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:33:34,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:33:34,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:34,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:35,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:33:35,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:33:35,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:33:35,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:33:35,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:35,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:35,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:35,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:35,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:35,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:35,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... [2019-12-07 11:33:35,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:33:35,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:33:35,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:33:35,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:33:35,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 11:33:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:33:35,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:33:37,741 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:33:37,742 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 11:33:37,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:37 BoogieIcfgContainer [2019-12-07 11:33:37,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:33:37,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:33:37,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:33:37,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:33:37,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:33:34" (1/3) ... [2019-12-07 11:33:37,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581dd88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:33:37, skipping insertion in model container [2019-12-07 11:33:37,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:33:34" (2/3) ... [2019-12-07 11:33:37,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581dd88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:33:37, skipping insertion in model container [2019-12-07 11:33:37,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:37" (3/3) ... [2019-12-07 11:33:37,748 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label21.c [2019-12-07 11:33:37,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:33:37,759 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:33:37,767 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:33:37,788 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:33:37,788 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:33:37,788 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:33:37,788 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:33:37,788 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:33:37,788 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:33:37,789 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:33:37,789 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:33:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-12-07 11:33:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:33:37,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:37,813 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] [2019-12-07 11:33:37,814 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:37,817 INFO L82 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2019-12-07 11:33:37,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:37,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905124687] [2019-12-07 11:33:37,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:38,002 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 11:33:38,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905124687] [2019-12-07 11:33:38,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:38,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:33:38,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663756716] [2019-12-07 11:33:38,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:38,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:38,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:38,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:38,018 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-12-07 11:33:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:42,352 INFO L93 Difference]: Finished difference Result 2089 states and 3897 transitions. [2019-12-07 11:33:42,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:33:42,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 11:33:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:42,376 INFO L225 Difference]: With dead ends: 2089 [2019-12-07 11:33:42,376 INFO L226 Difference]: Without dead ends: 1419 [2019-12-07 11:33:42,381 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 11:33:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-12-07 11:33:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1412. [2019-12-07 11:33:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-12-07 11:33:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2069 transitions. [2019-12-07 11:33:42,448 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2069 transitions. Word has length 59 [2019-12-07 11:33:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:42,449 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2069 transitions. [2019-12-07 11:33:42,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2069 transitions. [2019-12-07 11:33:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 11:33:42,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:42,453 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, 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] [2019-12-07 11:33:42,454 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:42,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1960864468, now seen corresponding path program 1 times [2019-12-07 11:33:42,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:42,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486254807] [2019-12-07 11:33:42,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:42,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486254807] [2019-12-07 11:33:42,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449344342] [2019-12-07 11:33:42,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 11:33:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:42,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:42,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:42,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:42,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:42,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:42,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:42,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:42,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:42,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:42,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:44,761 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-12-07 11:33:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:44,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:33:44,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 11:33:44,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352941778] [2019-12-07 11:33:44,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:44,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:44,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:44,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:44,871 INFO L87 Difference]: Start difference. First operand 1412 states and 2069 transitions. Second operand 4 states. [2019-12-07 11:33:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:54,505 INFO L93 Difference]: Finished difference Result 5459 states and 8041 transitions. [2019-12-07 11:33:54,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:33:54,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-12-07 11:33:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:54,525 INFO L225 Difference]: With dead ends: 5459 [2019-12-07 11:33:54,525 INFO L226 Difference]: Without dead ends: 4049 [2019-12-07 11:33:54,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2019-12-07 11:33:54,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 4007. [2019-12-07 11:33:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-12-07 11:33:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5465 transitions. [2019-12-07 11:33:54,590 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5465 transitions. Word has length 129 [2019-12-07 11:33:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:54,591 INFO L462 AbstractCegarLoop]: Abstraction has 4007 states and 5465 transitions. [2019-12-07 11:33:54,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5465 transitions. [2019-12-07 11:33:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 11:33:54,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:54,595 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, 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] [2019-12-07 11:33:54,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:33:54,796 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash -902571425, now seen corresponding path program 1 times [2019-12-07 11:33:54,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:54,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370900281] [2019-12-07 11:33:54,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:54,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370900281] [2019-12-07 11:33:54,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:54,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:33:54,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104202182] [2019-12-07 11:33:54,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:54,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:54,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:54,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:54,898 INFO L87 Difference]: Start difference. First operand 4007 states and 5465 transitions. Second operand 3 states. [2019-12-07 11:33:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:56,775 INFO L93 Difference]: Finished difference Result 11843 states and 16152 transitions. [2019-12-07 11:33:56,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:56,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-12-07 11:33:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:56,798 INFO L225 Difference]: With dead ends: 11843 [2019-12-07 11:33:56,798 INFO L226 Difference]: Without dead ends: 6554 [2019-12-07 11:33:56,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:33:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6554 states. [2019-12-07 11:33:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6554 to 5273. [2019-12-07 11:33:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5273 states. [2019-12-07 11:33:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 6520 transitions. [2019-12-07 11:33:56,883 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 6520 transitions. Word has length 170 [2019-12-07 11:33:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:56,884 INFO L462 AbstractCegarLoop]: Abstraction has 5273 states and 6520 transitions. [2019-12-07 11:33:56,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 6520 transitions. [2019-12-07 11:33:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 11:33:56,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:56,887 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:56,887 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:56,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1929248696, now seen corresponding path program 1 times [2019-12-07 11:33:56,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:56,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964917845] [2019-12-07 11:33:56,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:56,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964917845] [2019-12-07 11:33:56,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:56,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:33:56,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987252025] [2019-12-07 11:33:56,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:56,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:56,990 INFO L87 Difference]: Start difference. First operand 5273 states and 6520 transitions. Second operand 3 states. [2019-12-07 11:33:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:58,683 INFO L93 Difference]: Finished difference Result 13952 states and 17585 transitions. [2019-12-07 11:33:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:58,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-12-07 11:33:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:58,711 INFO L225 Difference]: With dead ends: 13952 [2019-12-07 11:33:58,711 INFO L226 Difference]: Without dead ends: 8681 [2019-12-07 11:33:58,715 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 11:33:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8681 states. [2019-12-07 11:33:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8681 to 8681. [2019-12-07 11:33:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8681 states. [2019-12-07 11:33:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8681 states to 8681 states and 10515 transitions. [2019-12-07 11:33:58,805 INFO L78 Accepts]: Start accepts. Automaton has 8681 states and 10515 transitions. Word has length 220 [2019-12-07 11:33:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:58,806 INFO L462 AbstractCegarLoop]: Abstraction has 8681 states and 10515 transitions. [2019-12-07 11:33:58,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8681 states and 10515 transitions. [2019-12-07 11:33:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-12-07 11:33:58,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:58,809 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:58,809 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash 843993686, now seen corresponding path program 1 times [2019-12-07 11:33:58,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:58,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553689171] [2019-12-07 11:33:58,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:59,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553689171] [2019-12-07 11:33:59,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083217894] [2019-12-07 11:33:59,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 11:33:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:59,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:33:59,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:59,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:59,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 252 proven. 70 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 11:33:59,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:33:59,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 10 [2019-12-07 11:33:59,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443459239] [2019-12-07 11:33:59,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:33:59,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:59,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:33:59,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:33:59,282 INFO L87 Difference]: Start difference. First operand 8681 states and 10515 transitions. Second operand 11 states. [2019-12-07 11:34:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:15,103 INFO L93 Difference]: Finished difference Result 56929 states and 70235 transitions. [2019-12-07 11:34:15,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:34:15,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 283 [2019-12-07 11:34:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:15,174 INFO L225 Difference]: With dead ends: 56929 [2019-12-07 11:34:15,174 INFO L226 Difference]: Without dead ends: 38020 [2019-12-07 11:34:15,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:34:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38020 states. [2019-12-07 11:34:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38020 to 32893. [2019-12-07 11:34:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32893 states. [2019-12-07 11:34:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32893 states to 32893 states and 36571 transitions. [2019-12-07 11:34:15,516 INFO L78 Accepts]: Start accepts. Automaton has 32893 states and 36571 transitions. Word has length 283 [2019-12-07 11:34:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:15,516 INFO L462 AbstractCegarLoop]: Abstraction has 32893 states and 36571 transitions. [2019-12-07 11:34:15,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:34:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 32893 states and 36571 transitions. [2019-12-07 11:34:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-12-07 11:34:15,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:15,524 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, 3, 3, 3, 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, 1, 1, 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 11:34:15,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:15,725 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:15,726 INFO L82 PathProgramCache]: Analyzing trace with hash -297153547, now seen corresponding path program 1 times [2019-12-07 11:34:15,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:15,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705946468] [2019-12-07 11:34:15,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-12-07 11:34:15,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705946468] [2019-12-07 11:34:15,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:15,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:34:15,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005674712] [2019-12-07 11:34:15,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:34:15,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:15,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:34:15,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:34:15,941 INFO L87 Difference]: Start difference. First operand 32893 states and 36571 transitions. Second operand 4 states. [2019-12-07 11:34:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:18,710 INFO L93 Difference]: Finished difference Result 84929 states and 94359 transitions. [2019-12-07 11:34:18,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:34:18,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-12-07 11:34:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:18,770 INFO L225 Difference]: With dead ends: 84929 [2019-12-07 11:34:18,770 INFO L226 Difference]: Without dead ends: 51603 [2019-12-07 11:34:18,795 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 11:34:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51603 states. [2019-12-07 11:34:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51603 to 45207. [2019-12-07 11:34:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45207 states. [2019-12-07 11:34:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45207 states to 45207 states and 49091 transitions. [2019-12-07 11:34:19,270 INFO L78 Accepts]: Start accepts. Automaton has 45207 states and 49091 transitions. Word has length 371 [2019-12-07 11:34:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:19,270 INFO L462 AbstractCegarLoop]: Abstraction has 45207 states and 49091 transitions. [2019-12-07 11:34:19,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:34:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 45207 states and 49091 transitions. [2019-12-07 11:34:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2019-12-07 11:34:19,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:19,283 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:19,283 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1172474053, now seen corresponding path program 1 times [2019-12-07 11:34:19,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:19,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743111536] [2019-12-07 11:34:19,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 11:34:19,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743111536] [2019-12-07 11:34:19,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:19,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:34:19,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39410429] [2019-12-07 11:34:19,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:19,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:19,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:19,597 INFO L87 Difference]: Start difference. First operand 45207 states and 49091 transitions. Second operand 3 states. [2019-12-07 11:34:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:21,392 INFO L93 Difference]: Finished difference Result 89986 states and 97752 transitions. [2019-12-07 11:34:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:21,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 544 [2019-12-07 11:34:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:21,425 INFO L225 Difference]: With dead ends: 89986 [2019-12-07 11:34:21,425 INFO L226 Difference]: Without dead ends: 45205 [2019-12-07 11:34:21,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 11:34:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45205 states. [2019-12-07 11:34:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45205 to 45205. [2019-12-07 11:34:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45205 states. [2019-12-07 11:34:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45205 states to 45205 states and 49082 transitions. [2019-12-07 11:34:21,875 INFO L78 Accepts]: Start accepts. Automaton has 45205 states and 49082 transitions. Word has length 544 [2019-12-07 11:34:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:21,876 INFO L462 AbstractCegarLoop]: Abstraction has 45205 states and 49082 transitions. [2019-12-07 11:34:21,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 45205 states and 49082 transitions. [2019-12-07 11:34:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-12-07 11:34:21,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:21,897 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:21,897 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash -596677162, now seen corresponding path program 1 times [2019-12-07 11:34:21,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:21,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640118308] [2019-12-07 11:34:21,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-12-07 11:34:22,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640118308] [2019-12-07 11:34:22,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:22,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:34:22,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819031344] [2019-12-07 11:34:22,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:22,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:22,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:22,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:22,173 INFO L87 Difference]: Start difference. First operand 45205 states and 49082 transitions. Second operand 3 states. [2019-12-07 11:34:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:24,000 INFO L93 Difference]: Finished difference Result 92538 states and 100453 transitions. [2019-12-07 11:34:24,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:24,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2019-12-07 11:34:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:24,033 INFO L225 Difference]: With dead ends: 92538 [2019-12-07 11:34:24,034 INFO L226 Difference]: Without dead ends: 47760 [2019-12-07 11:34:24,050 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 11:34:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47760 states. [2019-12-07 11:34:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47760 to 46481. [2019-12-07 11:34:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46481 states. [2019-12-07 11:34:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46481 states to 46481 states and 50065 transitions. [2019-12-07 11:34:24,403 INFO L78 Accepts]: Start accepts. Automaton has 46481 states and 50065 transitions. Word has length 645 [2019-12-07 11:34:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:24,404 INFO L462 AbstractCegarLoop]: Abstraction has 46481 states and 50065 transitions. [2019-12-07 11:34:24,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 46481 states and 50065 transitions. [2019-12-07 11:34:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-12-07 11:34:24,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:24,424 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 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] [2019-12-07 11:34:24,425 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1894460424, now seen corresponding path program 1 times [2019-12-07 11:34:24,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:24,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791455661] [2019-12-07 11:34:24,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 972 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2019-12-07 11:34:24,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791455661] [2019-12-07 11:34:24,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:24,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:34:24,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589102244] [2019-12-07 11:34:24,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:24,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:24,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:24,796 INFO L87 Difference]: Start difference. First operand 46481 states and 50065 transitions. Second operand 3 states. [2019-12-07 11:34:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:28,293 INFO L93 Difference]: Finished difference Result 95941 states and 103493 transitions. [2019-12-07 11:34:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:28,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 653 [2019-12-07 11:34:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:28,334 INFO L225 Difference]: With dead ends: 95941 [2019-12-07 11:34:28,334 INFO L226 Difference]: Without dead ends: 49887 [2019-12-07 11:34:28,349 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 11:34:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49887 states. [2019-12-07 11:34:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49887 to 49028. [2019-12-07 11:34:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49028 states. [2019-12-07 11:34:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49028 states to 49028 states and 52601 transitions. [2019-12-07 11:34:28,712 INFO L78 Accepts]: Start accepts. Automaton has 49028 states and 52601 transitions. Word has length 653 [2019-12-07 11:34:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:28,713 INFO L462 AbstractCegarLoop]: Abstraction has 49028 states and 52601 transitions. [2019-12-07 11:34:28,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 49028 states and 52601 transitions. [2019-12-07 11:34:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2019-12-07 11:34:28,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:28,733 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:34:28,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash -663517467, now seen corresponding path program 1 times [2019-12-07 11:34:28,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:28,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375522209] [2019-12-07 11:34:28,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2019-12-07 11:34:29,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375522209] [2019-12-07 11:34:29,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:29,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:34:29,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363433899] [2019-12-07 11:34:29,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:29,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:29,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:29,034 INFO L87 Difference]: Start difference. First operand 49028 states and 52601 transitions. Second operand 3 states. [2019-12-07 11:34:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:30,943 INFO L93 Difference]: Finished difference Result 111675 states and 119830 transitions. [2019-12-07 11:34:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:30,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 679 [2019-12-07 11:34:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:30,992 INFO L225 Difference]: With dead ends: 111675 [2019-12-07 11:34:30,992 INFO L226 Difference]: Without dead ends: 63074 [2019-12-07 11:34:31,005 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 11:34:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63074 states. [2019-12-07 11:34:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63074 to 58381. [2019-12-07 11:34:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58381 states. [2019-12-07 11:34:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58381 states to 58381 states and 62711 transitions. [2019-12-07 11:34:31,470 INFO L78 Accepts]: Start accepts. Automaton has 58381 states and 62711 transitions. Word has length 679 [2019-12-07 11:34:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:31,471 INFO L462 AbstractCegarLoop]: Abstraction has 58381 states and 62711 transitions. [2019-12-07 11:34:31,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 58381 states and 62711 transitions. [2019-12-07 11:34:31,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2019-12-07 11:34:31,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:31,487 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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] [2019-12-07 11:34:31,487 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash -921532675, now seen corresponding path program 1 times [2019-12-07 11:34:31,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:31,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082488521] [2019-12-07 11:34:31,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-12-07 11:34:31,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082488521] [2019-12-07 11:34:31,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:31,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:34:31,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631851121] [2019-12-07 11:34:31,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:31,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:31,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:31,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:31,836 INFO L87 Difference]: Start difference. First operand 58381 states and 62711 transitions. Second operand 3 states. [2019-12-07 11:34:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:33,475 INFO L93 Difference]: Finished difference Result 116764 states and 125442 transitions. [2019-12-07 11:34:33,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:33,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 721 [2019-12-07 11:34:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:33,527 INFO L225 Difference]: With dead ends: 116764 [2019-12-07 11:34:33,527 INFO L226 Difference]: Without dead ends: 58810 [2019-12-07 11:34:33,554 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 11:34:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58810 states. [2019-12-07 11:34:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58810 to 57530. [2019-12-07 11:34:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57530 states. [2019-12-07 11:34:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57530 states to 57530 states and 61715 transitions. [2019-12-07 11:34:34,098 INFO L78 Accepts]: Start accepts. Automaton has 57530 states and 61715 transitions. Word has length 721 [2019-12-07 11:34:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:34,099 INFO L462 AbstractCegarLoop]: Abstraction has 57530 states and 61715 transitions. [2019-12-07 11:34:34,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 57530 states and 61715 transitions. [2019-12-07 11:34:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2019-12-07 11:34:34,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:34,123 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:34,123 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1712345726, now seen corresponding path program 1 times [2019-12-07 11:34:34,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:34,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41192005] [2019-12-07 11:34:34,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 61 proven. 525 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-12-07 11:34:35,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41192005] [2019-12-07 11:34:35,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674158207] [2019-12-07 11:34:35,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 11:34:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:36,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:34:36,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 11:34:36,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 11:34:36,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:36,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:36,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:36,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:36,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:36,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 457 proven. 286 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 11:34:36,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:34:36,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-12-07 11:34:36,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053530957] [2019-12-07 11:34:36,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:34:36,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:36,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:34:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:34:36,947 INFO L87 Difference]: Start difference. First operand 57530 states and 61715 transitions. Second operand 10 states. [2019-12-07 11:34:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:45,361 INFO L93 Difference]: Finished difference Result 123050 states and 131340 transitions. [2019-12-07 11:34:45,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:34:45,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 815 [2019-12-07 11:34:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:45,412 INFO L225 Difference]: With dead ends: 123050 [2019-12-07 11:34:45,412 INFO L226 Difference]: Without dead ends: 65518 [2019-12-07 11:34:45,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 824 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:34:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65518 states. [2019-12-07 11:34:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65518 to 56656. [2019-12-07 11:34:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56656 states. [2019-12-07 11:34:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56656 states to 56656 states and 59593 transitions. [2019-12-07 11:34:45,931 INFO L78 Accepts]: Start accepts. Automaton has 56656 states and 59593 transitions. Word has length 815 [2019-12-07 11:34:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:45,931 INFO L462 AbstractCegarLoop]: Abstraction has 56656 states and 59593 transitions. [2019-12-07 11:34:45,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:34:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 56656 states and 59593 transitions. [2019-12-07 11:34:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2019-12-07 11:34:45,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:45,962 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:34:46,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:46,164 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1434265694, now seen corresponding path program 1 times [2019-12-07 11:34:46,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:46,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648992720] [2019-12-07 11:34:46,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 732 proven. 291 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-12-07 11:34:47,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648992720] [2019-12-07 11:34:47,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754375365] [2019-12-07 11:34:47,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 11:34:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:47,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:34:47,902 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 1023 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-12-07 11:34:48,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:34:48,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-12-07 11:34:48,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668273693] [2019-12-07 11:34:48,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:34:48,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:34:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:34:48,406 INFO L87 Difference]: Start difference. First operand 56656 states and 59593 transitions. Second operand 4 states. [2019-12-07 11:34:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:51,621 INFO L93 Difference]: Finished difference Result 135020 states and 142236 transitions. [2019-12-07 11:34:51,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:34:51,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 834 [2019-12-07 11:34:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:51,688 INFO L225 Difference]: With dead ends: 135020 [2019-12-07 11:34:51,688 INFO L226 Difference]: Without dead ends: 78366 [2019-12-07 11:34:51,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:34:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78366 states. [2019-12-07 11:34:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78366 to 69857. [2019-12-07 11:34:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69857 states. [2019-12-07 11:34:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69857 states to 69857 states and 73423 transitions. [2019-12-07 11:34:52,309 INFO L78 Accepts]: Start accepts. Automaton has 69857 states and 73423 transitions. Word has length 834 [2019-12-07 11:34:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:52,310 INFO L462 AbstractCegarLoop]: Abstraction has 69857 states and 73423 transitions. [2019-12-07 11:34:52,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:34:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 69857 states and 73423 transitions. [2019-12-07 11:34:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2019-12-07 11:34:52,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:52,335 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:34:52,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:52,537 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash 828435157, now seen corresponding path program 1 times [2019-12-07 11:34:52,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:34:52,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694664066] [2019-12-07 11:34:52,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:34:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 389 proven. 973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:54,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694664066] [2019-12-07 11:34:54,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837296622] [2019-12-07 11:34:54,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 11:34:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:54,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:34:54,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:54,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:54,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 1093 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-12-07 11:34:56,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:34:56,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2019-12-07 11:34:56,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531577796] [2019-12-07 11:34:56,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:34:56,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:34:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:34:56,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:34:56,876 INFO L87 Difference]: Start difference. First operand 69857 states and 73423 transitions. Second operand 5 states. [2019-12-07 11:35:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:05,208 INFO L93 Difference]: Finished difference Result 149505 states and 157010 transitions. [2019-12-07 11:35:05,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:35:05,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 871 [2019-12-07 11:35:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:05,270 INFO L225 Difference]: With dead ends: 149505 [2019-12-07 11:35:05,270 INFO L226 Difference]: Without dead ends: 80075 [2019-12-07 11:35:05,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 869 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:35:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80075 states. [2019-12-07 11:35:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80075 to 72409. [2019-12-07 11:35:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72409 states. [2019-12-07 11:35:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72409 states to 72409 states and 76063 transitions. [2019-12-07 11:35:05,911 INFO L78 Accepts]: Start accepts. Automaton has 72409 states and 76063 transitions. Word has length 871 [2019-12-07 11:35:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:05,911 INFO L462 AbstractCegarLoop]: Abstraction has 72409 states and 76063 transitions. [2019-12-07 11:35:05,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:35:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 72409 states and 76063 transitions. [2019-12-07 11:35:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2019-12-07 11:35:05,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:05,939 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 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] [2019-12-07 11:35:06,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:35:06,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash 608232330, now seen corresponding path program 1 times [2019-12-07 11:35:06,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:06,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846110232] [2019-12-07 11:35:06,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 1087 proven. 125 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-12-07 11:35:06,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846110232] [2019-12-07 11:35:06,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720789589] [2019-12-07 11:35:06,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/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 11:35:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:07,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:35:07,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:35:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 1203 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2019-12-07 11:35:08,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:35:08,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-12-07 11:35:08,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877002602] [2019-12-07 11:35:08,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:35:08,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:35:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:35:08,411 INFO L87 Difference]: Start difference. First operand 72409 states and 76063 transitions. Second operand 5 states. [2019-12-07 11:35:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:53,707 INFO L93 Difference]: Finished difference Result 177160 states and 186187 transitions. [2019-12-07 11:35:53,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:35:53,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 926 [2019-12-07 11:35:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:53,797 INFO L225 Difference]: With dead ends: 177160 [2019-12-07 11:35:53,797 INFO L226 Difference]: Without dead ends: 104328 [2019-12-07 11:35:53,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 924 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:35:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104328 states. [2019-12-07 11:35:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104328 to 94962. [2019-12-07 11:35:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94962 states. [2019-12-07 11:35:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94962 states to 94962 states and 99291 transitions. [2019-12-07 11:35:54,667 INFO L78 Accepts]: Start accepts. Automaton has 94962 states and 99291 transitions. Word has length 926 [2019-12-07 11:35:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:54,668 INFO L462 AbstractCegarLoop]: Abstraction has 94962 states and 99291 transitions. [2019-12-07 11:35:54,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:35:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 94962 states and 99291 transitions. [2019-12-07 11:35:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2019-12-07 11:35:54,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:54,710 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 6, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:54,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:35:54,911 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash 356088525, now seen corresponding path program 1 times [2019-12-07 11:35:54,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:54,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591413186] [2019-12-07 11:35:54,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1917 backedges. 1233 proven. 285 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-12-07 11:35:55,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591413186] [2019-12-07 11:35:55,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716550486] [2019-12-07 11:35:55,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:35:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:56,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:35:56,042 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:35:56,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 11:35:56,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:35:56,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:56,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:56,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1917 backedges. 969 proven. 293 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-12-07 11:35:57,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:35:57,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-12-07 11:35:57,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247197918] [2019-12-07 11:35:57,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:35:57,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:57,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:35:57,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:35:57,031 INFO L87 Difference]: Start difference. First operand 94962 states and 99291 transitions. Second operand 11 states. [2019-12-07 11:36:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:36:19,268 INFO L93 Difference]: Finished difference Result 248094 states and 259796 transitions. [2019-12-07 11:36:19,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:36:19,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 971 [2019-12-07 11:36:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:36:19,396 INFO L225 Difference]: With dead ends: 248094 [2019-12-07 11:36:19,396 INFO L226 Difference]: Without dead ends: 152706 [2019-12-07 11:36:19,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1005 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=559, Invalid=1793, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 11:36:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152706 states. [2019-12-07 11:36:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152706 to 105180. [2019-12-07 11:36:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105180 states. [2019-12-07 11:36:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105180 states to 105180 states and 109657 transitions. [2019-12-07 11:36:20,694 INFO L78 Accepts]: Start accepts. Automaton has 105180 states and 109657 transitions. Word has length 971 [2019-12-07 11:36:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:36:20,694 INFO L462 AbstractCegarLoop]: Abstraction has 105180 states and 109657 transitions. [2019-12-07 11:36:20,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:36:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 105180 states and 109657 transitions. [2019-12-07 11:36:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1266 [2019-12-07 11:36:20,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:36:20,749 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:36:20,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:36:20,950 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:36:20,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:36:20,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1234157656, now seen corresponding path program 1 times [2019-12-07 11:36:20,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:36:20,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201590223] [2019-12-07 11:36:20,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:36:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 873 proven. 1301 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 11:36:22,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201590223] [2019-12-07 11:36:22,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225298007] [2019-12-07 11:36:22,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:36:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:23,006 INFO L264 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:36:23,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 803 proven. 82 refuted. 0 times theorem prover too weak. 1371 trivial. 0 not checked. [2019-12-07 11:36:23,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:36:23,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2019-12-07 11:36:23,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318969775] [2019-12-07 11:36:23,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:36:23,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:36:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:36:23,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:36:23,949 INFO L87 Difference]: Start difference. First operand 105180 states and 109657 transitions. Second operand 11 states. [2019-12-07 11:36:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:36:47,663 INFO L93 Difference]: Finished difference Result 252541 states and 263136 transitions. [2019-12-07 11:36:47,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:36:47,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1265 [2019-12-07 11:36:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:36:47,791 INFO L225 Difference]: With dead ends: 252541 [2019-12-07 11:36:47,792 INFO L226 Difference]: Without dead ends: 147788 [2019-12-07 11:36:47,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 1282 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=555, Unknown=0, NotChecked=0, Total=812 [2019-12-07 11:36:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147788 states. [2019-12-07 11:36:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147788 to 119651. [2019-12-07 11:36:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119651 states. [2019-12-07 11:36:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119651 states to 119651 states and 124810 transitions. [2019-12-07 11:36:49,067 INFO L78 Accepts]: Start accepts. Automaton has 119651 states and 124810 transitions. Word has length 1265 [2019-12-07 11:36:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:36:49,067 INFO L462 AbstractCegarLoop]: Abstraction has 119651 states and 124810 transitions. [2019-12-07 11:36:49,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:36:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 119651 states and 124810 transitions. [2019-12-07 11:36:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2019-12-07 11:36:49,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:36:49,129 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:36:49,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:36:49,330 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:36:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:36:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 494248151, now seen corresponding path program 1 times [2019-12-07 11:36:49,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:36:49,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738316078] [2019-12-07 11:36:49,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:36:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 1212 proven. 1366 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-12-07 11:36:52,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738316078] [2019-12-07 11:36:52,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769093444] [2019-12-07 11:36:52,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:36:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:53,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:36:53,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:53,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:53,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:53,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:53,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:53,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:53,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:53,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:54,456 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_5 Int)) (let ((.cse1 (* v_prenex_5 9))) (let ((.cse0 (mod (+ (div .cse1 10) 1) 299849))) (and (<= c_~a28~0 (+ .cse0 300149)) (not (= 0 (mod .cse1 10))) (< (* 9 v_prenex_5) 0) (= 0 .cse0))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse2 (* v_~a28~0_1304 9))) (let ((.cse3 (div .cse2 10))) (and (= 0 (mod .cse2 10)) (<= c_~a28~0 (+ (mod .cse3 299849) 300149)) (<= 0 .cse3))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse5 (* v_~a28~0_1304 9))) (let ((.cse6 (div .cse5 10))) (let ((.cse4 (mod .cse6 299849))) (and (not (= 0 .cse4)) (= 0 (mod .cse5 10)) (< .cse6 0) (<= c_~a28~0 (+ .cse4 300))))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse7 (div (* v_~a28~0_1304 9) 10))) (and (<= c_~a28~0 (+ (mod .cse7 299849) 300149)) (<= 0 (* 9 v_~a28~0_1304)) (<= 0 .cse7)))) (exists ((v_~a28~0_1304 Int)) (let ((.cse8 (* v_~a28~0_1304 9))) (let ((.cse9 (mod (div .cse8 10) 299849))) (and (= 0 (mod .cse8 10)) (<= c_~a28~0 (+ .cse9 300149)) (= 0 .cse9))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse10 (mod (div (* v_~a28~0_1304 9) 10) 299849))) (and (<= c_~a28~0 (+ .cse10 300149)) (<= 0 (* 9 v_~a28~0_1304)) (= 0 .cse10)))) (exists ((v_prenex_5 Int)) (let ((.cse12 (* v_prenex_5 9))) (let ((.cse11 (+ (div .cse12 10) 1))) (and (<= 0 .cse11) (<= c_~a28~0 (+ (mod .cse11 299849) 300149)) (not (= 0 (mod .cse12 10))) (< (* 9 v_prenex_5) 0))))) (exists ((v_prenex_5 Int)) (let ((.cse15 (* v_prenex_5 9))) (let ((.cse14 (+ (div .cse15 10) 1))) (let ((.cse13 (mod .cse14 299849))) (and (<= c_~a28~0 (+ .cse13 300)) (not (= 0 .cse13)) (< .cse14 0) (not (= 0 (mod .cse15 10))) (< (* 9 v_prenex_5) 0)))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse17 (div (* v_~a28~0_1304 9) 10))) (let ((.cse16 (mod .cse17 299849))) (and (not (= 0 .cse16)) (< .cse17 0) (<= 0 (* 9 v_~a28~0_1304)) (<= c_~a28~0 (+ .cse16 300))))))) is different from true [2019-12-07 11:36:55,669 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_5 Int)) (let ((.cse1 (* v_prenex_5 9))) (let ((.cse0 (mod (+ (div .cse1 10) 1) 299849))) (and (<= c_~a28~0 (+ .cse0 300149)) (not (= 0 (mod .cse1 10))) (< (* 9 v_prenex_5) 0) (= 0 .cse0))))) (exists ((v_prenex_7 Int)) (let ((.cse2 (div (* v_prenex_7 9) 10))) (and (<= 0 (* 9 v_prenex_7)) (<= c_~a28~0 (+ (mod .cse2 299849) 300149)) (<= 0 .cse2)))) (exists ((v_prenex_9 Int)) (let ((.cse3 (mod (div (* v_prenex_9 9) 10) 299849))) (and (<= 0 (* 9 v_prenex_9)) (<= c_~a28~0 (+ .cse3 300149)) (= 0 .cse3)))) (exists ((v_prenex_8 Int)) (let ((.cse5 (* v_prenex_8 9))) (let ((.cse4 (mod (div .cse5 10) 299849))) (and (= 0 .cse4) (= 0 (mod .cse5 10)) (<= c_~a28~0 (+ .cse4 300149)))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse6 (* v_~a28~0_1304 9))) (let ((.cse7 (div .cse6 10))) (and (= 0 (mod .cse6 10)) (<= c_~a28~0 (+ (mod .cse7 299849) 300149)) (<= 0 .cse7))))) (exists ((v_prenex_6 Int)) (let ((.cse10 (* v_prenex_6 9))) (let ((.cse8 (div .cse10 10))) (let ((.cse9 (mod .cse8 299849))) (and (< .cse8 0) (not (= 0 .cse9)) (= 0 (mod .cse10 10)) (<= c_~a28~0 (+ .cse9 300))))))) (exists ((v_prenex_11 Int)) (let ((.cse12 (* v_prenex_11 9))) (let ((.cse13 (+ (div .cse12 10) 1))) (let ((.cse11 (mod .cse13 299849))) (and (not (= 0 .cse11)) (not (= 0 (mod .cse12 10))) (<= c_~a28~0 (+ .cse11 300)) (< (* 9 v_prenex_11) 0) (< .cse13 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse14 (* v_prenex_10 9))) (let ((.cse15 (+ (div .cse14 10) 1))) (and (< (* 9 v_prenex_10) 0) (not (= 0 (mod .cse14 10))) (<= c_~a28~0 (+ (mod .cse15 299849) 300149)) (<= 0 .cse15))))) (exists ((v_prenex_12 Int)) (let ((.cse16 (div (* v_prenex_12 9) 10))) (let ((.cse17 (mod .cse16 299849))) (and (< .cse16 0) (not (= 0 .cse17)) (<= 0 (* 9 v_prenex_12)) (<= c_~a28~0 (+ .cse17 300))))))) is different from true [2019-12-07 11:36:56,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-12-07 11:36:57,420 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 119 DAG size of output: 17 [2019-12-07 11:37:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 1319 proven. 0 refuted. 0 times theorem prover too weak. 1430 trivial. 58 not checked. [2019-12-07 11:37:15,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:37:15,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-12-07 11:37:15,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842110262] [2019-12-07 11:37:15,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:37:15,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:37:15,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:37:15,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=84, Unknown=2, NotChecked=38, Total=156 [2019-12-07 11:37:15,859 INFO L87 Difference]: Start difference. First operand 119651 states and 124810 transitions. Second operand 13 states. [2019-12-07 11:37:27,589 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 11:37:32,799 WARN L192 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2019-12-07 11:37:38,642 WARN L192 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2019-12-07 11:38:00,872 WARN L192 SmtUtils]: Spent 6.92 s on a formula simplification. DAG size of input: 77 DAG size of output: 33 [2019-12-07 11:41:24,583 WARN L192 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-12-07 11:41:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:48,409 INFO L93 Difference]: Finished difference Result 333769 states and 347628 transitions. [2019-12-07 11:41:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:41:48,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1359 [2019-12-07 11:41:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:48,615 INFO L225 Difference]: With dead ends: 333769 [2019-12-07 11:41:48,615 INFO L226 Difference]: Without dead ends: 214120 [2019-12-07 11:41:48,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1437 GetRequests, 1386 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=540, Invalid=1428, Unknown=20, NotChecked=174, Total=2162 [2019-12-07 11:41:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214120 states. [2019-12-07 11:41:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214120 to 127204. [2019-12-07 11:41:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127204 states. [2019-12-07 11:41:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127204 states to 127204 states and 132793 transitions. [2019-12-07 11:41:50,268 INFO L78 Accepts]: Start accepts. Automaton has 127204 states and 132793 transitions. Word has length 1359 [2019-12-07 11:41:50,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:50,269 INFO L462 AbstractCegarLoop]: Abstraction has 127204 states and 132793 transitions. [2019-12-07 11:41:50,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:41:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 127204 states and 132793 transitions. [2019-12-07 11:41:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2019-12-07 11:41:50,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:50,332 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:41:50,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:41:50,533 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:50,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:50,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1687811672, now seen corresponding path program 1 times [2019-12-07 11:41:50,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:50,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609586504] [2019-12-07 11:41:50,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3002 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 2603 trivial. 0 not checked. [2019-12-07 11:41:51,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609586504] [2019-12-07 11:41:51,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:51,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:51,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514074850] [2019-12-07 11:41:51,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:41:51,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:51,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:41:51,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:51,775 INFO L87 Difference]: Start difference. First operand 127204 states and 132793 transitions. Second operand 3 states. [2019-12-07 11:41:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:53,664 INFO L93 Difference]: Finished difference Result 240344 states and 250917 transitions. [2019-12-07 11:41:53,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:41:53,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1417 [2019-12-07 11:41:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:53,759 INFO L225 Difference]: With dead ends: 240344 [2019-12-07 11:41:53,759 INFO L226 Difference]: Without dead ends: 113564 [2019-12-07 11:41:53,810 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 11:41:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113564 states. [2019-12-07 11:41:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113564 to 107168. [2019-12-07 11:41:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107168 states. [2019-12-07 11:41:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107168 states to 107168 states and 111846 transitions. [2019-12-07 11:41:54,911 INFO L78 Accepts]: Start accepts. Automaton has 107168 states and 111846 transitions. Word has length 1417 [2019-12-07 11:41:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:54,912 INFO L462 AbstractCegarLoop]: Abstraction has 107168 states and 111846 transitions. [2019-12-07 11:41:54,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:41:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 107168 states and 111846 transitions. [2019-12-07 11:41:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2019-12-07 11:41:54,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:54,975 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:54,975 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 934453682, now seen corresponding path program 1 times [2019-12-07 11:41:54,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:54,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431628307] [2019-12-07 11:41:54,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3798 backedges. 1547 proven. 0 refuted. 0 times theorem prover too weak. 2251 trivial. 0 not checked. [2019-12-07 11:41:56,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431628307] [2019-12-07 11:41:56,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:56,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:41:56,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285725923] [2019-12-07 11:41:56,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:41:56,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:41:56,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:41:56,479 INFO L87 Difference]: Start difference. First operand 107168 states and 111846 transitions. Second operand 5 states. [2019-12-07 11:42:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:42:00,507 INFO L93 Difference]: Finished difference Result 222872 states and 232403 transitions. [2019-12-07 11:42:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:42:00,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1475 [2019-12-07 11:42:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:42:00,619 INFO L225 Difference]: With dead ends: 222872 [2019-12-07 11:42:00,619 INFO L226 Difference]: Without dead ends: 115705 [2019-12-07 11:42:00,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 11:42:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115705 states. [2019-12-07 11:42:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115705 to 105893. [2019-12-07 11:42:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105893 states. [2019-12-07 11:42:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105893 states to 105893 states and 110461 transitions. [2019-12-07 11:42:01,715 INFO L78 Accepts]: Start accepts. Automaton has 105893 states and 110461 transitions. Word has length 1475 [2019-12-07 11:42:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:42:01,716 INFO L462 AbstractCegarLoop]: Abstraction has 105893 states and 110461 transitions. [2019-12-07 11:42:01,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:42:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 105893 states and 110461 transitions. [2019-12-07 11:42:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1786 [2019-12-07 11:42:01,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:42:01,813 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:42:01,813 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:42:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:42:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash -244581159, now seen corresponding path program 1 times [2019-12-07 11:42:01,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:42:01,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500647300] [2019-12-07 11:42:01,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:42:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:42:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4357 backedges. 2409 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-12-07 11:42:04,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500647300] [2019-12-07 11:42:04,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:42:04,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:42:04,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243829721] [2019-12-07 11:42:04,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:42:04,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:42:04,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:42:04,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:42:04,258 INFO L87 Difference]: Start difference. First operand 105893 states and 110461 transitions. Second operand 5 states. [2019-12-07 11:42:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:42:08,749 INFO L93 Difference]: Finished difference Result 227137 states and 236618 transitions. [2019-12-07 11:42:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:42:08,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1785 [2019-12-07 11:42:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:42:08,751 INFO L225 Difference]: With dead ends: 227137 [2019-12-07 11:42:08,751 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:42:08,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 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 11:42:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:42:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:42:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:42:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:42:08,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1785 [2019-12-07 11:42:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:42:08,819 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:42:08,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:42:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:42:08,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:42:08,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:42:17,778 WARN L192 SmtUtils]: Spent 8.94 s on a formula simplification. DAG size of input: 2401 DAG size of output: 1928 [2019-12-07 11:42:24,761 WARN L192 SmtUtils]: Spent 6.98 s on a formula simplification. DAG size of input: 2047 DAG size of output: 1685 [2019-12-07 11:42:33,562 WARN L192 SmtUtils]: Spent 8.79 s on a formula simplification. DAG size of input: 2398 DAG size of output: 1927 [2019-12-07 11:43:27,287 WARN L192 SmtUtils]: Spent 53.71 s on a formula simplification. DAG size of input: 1794 DAG size of output: 151 [2019-12-07 11:44:15,068 WARN L192 SmtUtils]: Spent 47.77 s on a formula simplification. DAG size of input: 1595 DAG size of output: 152 [2019-12-07 11:45:06,665 WARN L192 SmtUtils]: Spent 51.59 s on a formula simplification. DAG size of input: 1794 DAG size of output: 151 [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,667 INFO L246 CegarLoopResult]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,668 INFO L246 CegarLoopResult]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,669 INFO L246 CegarLoopResult]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-12-07 11:45:06,670 INFO L246 CegarLoopResult]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,671 INFO L246 CegarLoopResult]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-12-07 11:45:06,672 INFO L246 CegarLoopResult]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,673 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,674 INFO L246 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-12-07 11:45:06,675 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,676 INFO L246 CegarLoopResult]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,677 INFO L246 CegarLoopResult]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,678 INFO L246 CegarLoopResult]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,679 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-12-07 11:45:06,680 INFO L246 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,681 INFO L246 CegarLoopResult]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,682 INFO L246 CegarLoopResult]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,683 INFO L246 CegarLoopResult]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,684 INFO L246 CegarLoopResult]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,685 INFO L246 CegarLoopResult]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-12-07 11:45:06,686 INFO L242 CegarLoopResult]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse29 (+ ~a14~0 182))) (let ((.cse30 (+ ~a14~0 114)) (.cse17 (<= (* 9 ~a26~0) (+ (* 10 ~a28~0) 2892136))) (.cse23 (< 37 ~a28~0)) (.cse28 (<= .cse29 0)) (.cse27 (<= (+ ~a26~0 68) 0)) (.cse7 (<= ~a28~0 134))) (let ((.cse6 (<= ~a26~0 348799)) (.cse13 (<= ~a28~0 300)) (.cse18 (<= ~a26~0 215)) (.cse26 (or .cse27 .cse7)) (.cse20 (exists ((v_~a28~0_1300 Int)) (let ((.cse31 (+ (div (+ v_~a28~0_1300 (- 600036)) 5) 1))) (and (<= ~a28~0 (div .cse31 5)) (<= v_~a28~0_1300 111) (not (= 0 (mod (+ v_~a28~0_1300 4) 5))) (< v_~a28~0_1300 600036) (= (mod .cse31 5) 0))))) (.cse22 (<= ~a28~0 599997)) (.cse1 (<= 301 ~a28~0)) (.cse0 (<= 0 (+ ~a14~0 600000))) (.cse9 (= ~a24~0 2)) (.cse4 (or (<= (+ ~a26~0 ~a14~0 1052964) 0) .cse28)) (.cse25 (or .cse17 .cse23)) (.cse24 (< 217 ~a26~0)) (.cse21 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse19 (<= ~a26~0 217)) (.cse14 (< 0 .cse30)) (.cse2 (= ~a24~0 3)) (.cse10 (<= .cse30 0)) (.cse11 (< 0 .cse29)) (.cse16 (<= ~a26~0 124)) (.cse5 (<= ~a21~0 124)) (.cse12 (< 124 ~a26~0)) (.cse8 (= ~a24~0 1)) (.cse15 (<= (+ ~a14~0 84) 0))) (or (and .cse0 .cse1 .cse2 (exists ((v_~a28~0_1304 Int)) (let ((.cse3 (div (* v_~a28~0_1304 9) 10))) (and (<= ~a28~0 (+ (mod .cse3 299849) 300149)) (<= 0 (* 9 v_~a28~0_1304)) (<= 0 .cse3)))) .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse10 .cse11 (<= 222 ~a26~0) .cse5) (and .cse12 (<= (div (+ (* ~a26~0 (- 1)) 557256) (- 20)) 124) .cse13 .cse8 .cse5) (and .cse9 .cse14 .cse15 .cse5) (and .cse13 .cse2 .cse16 .cse5) (and .cse17 .cse0 .cse13 .cse2 .cse18 .cse4 .cse5) (and .cse2 .cse10 .cse11 .cse19 .cse20 .cse21 .cse5) (and .cse12 .cse6 .cse22 .cse8 .cse5) (and .cse2 (<= (+ ~a26~0 554655) 0) .cse22 .cse5) (and .cse0 (or (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse23) .cse24 .cse13 .cse25 .cse2 .cse4 .cse5) (and .cse26 .cse2 .cse22 .cse4 .cse16 .cse5) (and .cse9 .cse11 .cse16 .cse5) (and .cse8 (or .cse27 .cse28)) (and .cse17 .cse2 .cse10 .cse22 .cse18 .cse11 .cse5) (and .cse0 .cse9 .cse26 .cse5) (and .cse8 .cse20) (and .cse9 .cse22 .cse5) (and .cse1 .cse8 .cse19 .cse5) (and .cse12 .cse0 .cse9 .cse19 .cse4 .cse5) (and .cse25 .cse2 (or .cse24 .cse23 .cse21) .cse7 .cse10 .cse11 .cse5) (and .cse8 .cse19 .cse14) (and .cse2 .cse10 .cse11 .cse16 .cse5) (and .cse12 .cse8 .cse15) (and .cse8 (<= ~a28~0 111) .cse15))))) [2019-12-07 11:45:06,686 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L242 CegarLoopResult]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse29 (+ ~a14~0 182))) (let ((.cse30 (+ ~a14~0 114)) (.cse18 (<= (* 9 ~a26~0) (+ (* 10 ~a28~0) 2892136))) (.cse23 (< 37 ~a28~0)) (.cse28 (<= .cse29 0)) (.cse27 (<= (+ ~a26~0 68) 0)) (.cse10 (<= ~a28~0 134))) (let ((.cse7 (<= ~a26~0 348799)) (.cse1 (<= 301 ~a28~0)) (.cse14 (<= ~a28~0 300)) (.cse19 (<= ~a26~0 215)) (.cse26 (or .cse27 .cse10)) (.cse9 (<= ~a28~0 599997)) (.cse21 (exists ((v_~a28~0_1300 Int)) (let ((.cse31 (+ (div (+ v_~a28~0_1300 (- 600036)) 5) 1))) (and (<= ~a28~0 (div .cse31 5)) (<= v_~a28~0_1300 111) (not (= 0 (mod (+ v_~a28~0_1300 4) 5))) (< v_~a28~0_1300 600036) (= (mod .cse31 5) 0))))) (.cse0 (<= 0 (+ ~a14~0 600000))) (.cse11 (= ~a24~0 2)) (.cse4 (or (<= (+ ~a26~0 ~a14~0 1052964) 0) .cse28)) (.cse25 (or .cse18 .cse23)) (.cse24 (< 217 ~a26~0)) (.cse22 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse20 (<= ~a26~0 217)) (.cse15 (< 0 .cse30)) (.cse2 (= ~a24~0 3)) (.cse12 (<= .cse30 0)) (.cse13 (< 0 .cse29)) (.cse17 (<= ~a26~0 124)) (.cse5 (<= ~a21~0 124)) (.cse6 (< 124 ~a26~0)) (.cse8 (= ~a24~0 1)) (.cse16 (<= (+ ~a14~0 84) 0))) (or (and .cse0 .cse1 .cse2 (exists ((v_~a28~0_1304 Int)) (let ((.cse3 (div (* v_~a28~0_1304 9) 10))) (and (<= ~a28~0 (+ (mod .cse3 299849) 300149)) (<= 0 (* 9 v_~a28~0_1304)) (<= 0 .cse3)))) .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse5) (and .cse7 .cse10 .cse8 .cse5) (and .cse11 .cse12 .cse13 (<= 222 ~a26~0) .cse5) (and .cse6 (<= (div (+ (* ~a26~0 (- 1)) 557256) (- 20)) 124) .cse14 .cse8 .cse5) (and .cse11 .cse15 .cse16 .cse5) (and .cse14 .cse2 .cse17 .cse5) (and .cse18 .cse0 .cse14 .cse2 .cse19 .cse4 .cse5) (and .cse2 .cse12 .cse13 .cse20 .cse21 .cse22 .cse5) (and .cse1 .cse8 .cse16 .cse5) (and .cse2 (<= (+ ~a26~0 554655) 0) .cse9 .cse5) (and .cse0 (or (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse23) .cse24 .cse14 .cse25 .cse2 .cse4 .cse5) (and .cse26 .cse2 .cse9 .cse4 .cse17 .cse5) (and .cse11 .cse13 .cse17 .cse5) (and .cse8 (or .cse27 .cse28)) (and .cse18 .cse2 .cse12 .cse9 .cse19 .cse13 .cse5) (and .cse0 .cse11 .cse26 .cse5) (and .cse11 .cse9 .cse5) (and .cse8 .cse21) (and .cse6 .cse0 .cse11 .cse20 .cse4 .cse5) (and .cse25 .cse2 (or .cse24 .cse23 .cse22) .cse10 .cse12 .cse13 .cse5) (and .cse8 .cse20 .cse15) (and .cse2 .cse12 .cse13 .cse17 .cse5) (and .cse6 .cse8 .cse16) (and .cse8 (<= ~a28~0 111) .cse16))))) [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,687 INFO L246 CegarLoopResult]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L249 CegarLoopResult]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,688 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,689 INFO L246 CegarLoopResult]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L242 CegarLoopResult]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse29 (+ ~a14~0 182))) (let ((.cse30 (+ ~a14~0 114)) (.cse17 (<= (* 9 ~a26~0) (+ (* 10 ~a28~0) 2892136))) (.cse23 (< 37 ~a28~0)) (.cse28 (<= .cse29 0)) (.cse27 (<= (+ ~a26~0 68) 0)) (.cse7 (<= ~a28~0 134))) (let ((.cse6 (<= ~a26~0 348799)) (.cse13 (<= ~a28~0 300)) (.cse18 (<= ~a26~0 215)) (.cse26 (or .cse27 .cse7)) (.cse20 (exists ((v_~a28~0_1300 Int)) (let ((.cse31 (+ (div (+ v_~a28~0_1300 (- 600036)) 5) 1))) (and (<= ~a28~0 (div .cse31 5)) (<= v_~a28~0_1300 111) (not (= 0 (mod (+ v_~a28~0_1300 4) 5))) (< v_~a28~0_1300 600036) (= (mod .cse31 5) 0))))) (.cse22 (<= ~a28~0 599997)) (.cse1 (<= 301 ~a28~0)) (.cse0 (<= 0 (+ ~a14~0 600000))) (.cse9 (= ~a24~0 2)) (.cse4 (or (<= (+ ~a26~0 ~a14~0 1052964) 0) .cse28)) (.cse25 (or .cse17 .cse23)) (.cse24 (< 217 ~a26~0)) (.cse21 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse19 (<= ~a26~0 217)) (.cse14 (< 0 .cse30)) (.cse2 (= ~a24~0 3)) (.cse10 (<= .cse30 0)) (.cse11 (< 0 .cse29)) (.cse16 (<= ~a26~0 124)) (.cse5 (<= ~a21~0 124)) (.cse12 (< 124 ~a26~0)) (.cse8 (= ~a24~0 1)) (.cse15 (<= (+ ~a14~0 84) 0))) (or (and .cse0 .cse1 .cse2 (exists ((v_~a28~0_1304 Int)) (let ((.cse3 (div (* v_~a28~0_1304 9) 10))) (and (<= ~a28~0 (+ (mod .cse3 299849) 300149)) (<= 0 (* 9 v_~a28~0_1304)) (<= 0 .cse3)))) .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse10 .cse11 (<= 222 ~a26~0) .cse5) (and .cse12 (<= (div (+ (* ~a26~0 (- 1)) 557256) (- 20)) 124) .cse13 .cse8 .cse5) (and .cse9 .cse14 .cse15 .cse5) (and .cse13 .cse2 .cse16 .cse5) (and .cse17 .cse0 .cse13 .cse2 .cse18 .cse4 .cse5) (and .cse2 .cse10 .cse11 .cse19 .cse20 .cse21 .cse5) (and .cse12 .cse6 .cse22 .cse8 .cse5) (and .cse2 (<= (+ ~a26~0 554655) 0) .cse22 .cse5) (and .cse0 (or (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse23) .cse24 .cse13 .cse25 .cse2 .cse4 .cse5) (and .cse26 .cse2 .cse22 .cse4 .cse16 .cse5) (and .cse9 .cse11 .cse16 .cse5) (and .cse8 (or .cse27 .cse28)) (and .cse17 .cse2 .cse10 .cse22 .cse18 .cse11 .cse5) (and .cse0 .cse9 .cse26 .cse5) (and .cse8 .cse20) (and .cse9 .cse22 .cse5) (and .cse1 .cse8 .cse19 .cse5) (and .cse12 .cse0 .cse9 .cse19 .cse4 .cse5) (and .cse25 .cse2 (or .cse24 .cse23 .cse21) .cse7 .cse10 .cse11 .cse5) (and .cse8 .cse19 .cse14) (and .cse2 .cse10 .cse11 .cse16 .cse5) (and .cse12 .cse8 .cse15) (and .cse8 (<= ~a28~0 111) .cse15))))) [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,690 INFO L246 CegarLoopResult]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,691 INFO L246 CegarLoopResult]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,692 INFO L246 CegarLoopResult]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-12-07 11:45:06,693 INFO L246 CegarLoopResult]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-12-07 11:45:06,694 INFO L246 CegarLoopResult]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,695 INFO L246 CegarLoopResult]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-12-07 11:45:06,696 INFO L246 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2019-12-07 11:45:06,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:45:06 BoogieIcfgContainer [2019-12-07 11:45:06,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:45:06,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:45:06,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:45:06,737 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:45:06,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:33:37" (3/4) ... [2019-12-07 11:45:06,740 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:45:06,770 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 11:45:06,774 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:45:06,796 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || ((((124 < a26 && (a26 * -1 + 557256) / -20 <= 124) && a28 <= 300) && a24 == 1) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a28 <= 300) && a24 == 3) && a26 <= 215) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0)) && !(2 == input)) && a21 <= 124)) || ((((124 < a26 && a26 <= 348799) && a28 <= 599997) && a24 == 1) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a28 <= 599997) && a21 <= 124)) || (((((((0 <= a14 + 600000 && (!(4 == input) || 37 < a28)) && 217 < a26) && a28 <= 300) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a28 <= 599997) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((301 <= a28 && a24 == 1) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((((((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && a24 == 3) && ((217 < a26 || 37 < a28) || !(2 == input))) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || ((a24 == 1 && a26 <= 217) && 0 < a14 + 114)) || ((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0) [2019-12-07 11:45:06,798 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || ((((124 < a26 && (a26 * -1 + 557256) / -20 <= 124) && a28 <= 300) && a24 == 1) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a28 <= 300) && a24 == 3) && a26 <= 215) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0)) && !(2 == input)) && a21 <= 124)) || ((((124 < a26 && a26 <= 348799) && a28 <= 599997) && a24 == 1) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a28 <= 599997) && a21 <= 124)) || (((((((0 <= a14 + 600000 && (!(4 == input) || 37 < a28)) && 217 < a26) && a28 <= 300) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a28 <= 599997) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((301 <= a28 && a24 == 1) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((((((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && a24 == 3) && ((217 < a26 || 37 < a28) || !(2 == input))) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || ((a24 == 1 && a26 <= 217) && 0 < a14 + 114)) || ((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0) [2019-12-07 11:45:06,807 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124) || ((((124 < a26 && a26 <= 348799) && a24 == 1) && a28 <= 599997) && a21 <= 124)) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || ((((124 < a26 && (a26 * -1 + 557256) / -20 <= 124) && a28 <= 300) && a24 == 1) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a28 <= 300) && a24 == 3) && a26 <= 215) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0)) && !(2 == input)) && a21 <= 124)) || (((301 <= a28 && a24 == 1) && a14 + 84 <= 0) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a28 <= 599997) && a21 <= 124)) || (((((((0 <= a14 + 600000 && (!(4 == input) || 37 < a28)) && 217 < a26) && a28 <= 300) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a28 <= 599997) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((((((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && a24 == 3) && ((217 < a26 || 37 < a28) || !(2 == input))) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || ((a24 == 1 && a26 <= 217) && 0 < a14 + 114)) || ((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0) [2019-12-07 11:45:06,935 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6305a646-7d4c-4da1-b0fe-eadb9c76baa0/bin/uautomizer/witness.graphml [2019-12-07 11:45:06,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:45:06,936 INFO L168 Benchmark]: Toolchain (without parser) took 692887.34 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.6 GB). Free memory was 932.6 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 971.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:45:06,936 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:45:06,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 932.6 MB in the beginning and 950.5 MB in the end (delta: -17.9 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:45:06,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 169.13 ms. Allocated memory is still 1.1 GB. Free memory was 950.5 MB in the beginning and 891.4 MB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:45:06,937 INFO L168 Benchmark]: Boogie Preprocessor took 183.81 ms. Allocated memory is still 1.1 GB. Free memory was 891.4 MB in the beginning and 853.2 MB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:45:06,937 INFO L168 Benchmark]: RCFGBuilder took 2487.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 107.0 MB). Free memory was 853.2 MB in the beginning and 972.5 MB in the end (delta: -119.3 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:45:06,937 INFO L168 Benchmark]: TraceAbstraction took 688993.36 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 972.5 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 11:45:06,937 INFO L168 Benchmark]: Witness Printer took 198.06 ms. Allocated memory is still 3.6 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 121.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:45:06,939 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 852.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 932.6 MB in the beginning and 950.5 MB in the end (delta: -17.9 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 169.13 ms. Allocated memory is still 1.1 GB. Free memory was 950.5 MB in the beginning and 891.4 MB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 183.81 ms. Allocated memory is still 1.1 GB. Free memory was 891.4 MB in the beginning and 853.2 MB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2487.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 107.0 MB). Free memory was 853.2 MB in the beginning and 972.5 MB in the end (delta: -119.3 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 688993.36 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 972.5 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 198.06 ms. Allocated memory is still 3.6 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 121.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-12-07 11:45:06,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || ((((124 < a26 && (a26 * -1 + 557256) / -20 <= 124) && a28 <= 300) && a24 == 1) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a28 <= 300) && a24 == 3) && a26 <= 215) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0)) && !(2 == input)) && a21 <= 124)) || ((((124 < a26 && a26 <= 348799) && a28 <= 599997) && a24 == 1) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a28 <= 599997) && a21 <= 124)) || (((((((0 <= a14 + 600000 && (!(4 == input) || 37 < a28)) && 217 < a26) && a28 <= 300) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a28 <= 599997) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((301 <= a28 && a24 == 1) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((((((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && a24 == 3) && ((217 < a26 || 37 < a28) || !(2 == input))) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || ((a24 == 1 && a26 <= 217) && 0 < a14 + 114)) || ((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0) - InvariantResult [Line: 1646]: Loop Invariant [2019-12-07 11:45:06,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124) || ((((124 < a26 && a26 <= 348799) && a24 == 1) && a28 <= 599997) && a21 <= 124)) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || ((((124 < a26 && (a26 * -1 + 557256) / -20 <= 124) && a28 <= 300) && a24 == 1) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a28 <= 300) && a24 == 3) && a26 <= 215) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0)) && !(2 == input)) && a21 <= 124)) || (((301 <= a28 && a24 == 1) && a14 + 84 <= 0) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a28 <= 599997) && a21 <= 124)) || (((((((0 <= a14 + 600000 && (!(4 == input) || 37 < a28)) && 217 < a26) && a28 <= 300) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a28 <= 599997) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((((((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && a24 == 3) && ((217 < a26 || 37 < a28) || !(2 == input))) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || ((a24 == 1 && a26 <= 217) && 0 < a14 + 114)) || ((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0) - InvariantResult [Line: 24]: Loop Invariant [2019-12-07 11:45:06,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-12-07 11:45:06,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-12-07 11:45:06,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || ((((124 < a26 && (a26 * -1 + 557256) / -20 <= 124) && a28 <= 300) && a24 == 1) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a28 <= 300) && a24 == 3) && a26 <= 215) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0)) && !(2 == input)) && a21 <= 124)) || ((((124 < a26 && a26 <= 348799) && a28 <= 599997) && a24 == 1) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a28 <= 599997) && a21 <= 124)) || (((((((0 <= a14 + 600000 && (!(4 == input) || 37 < a28)) && 217 < a26) && a28 <= 300) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a28 <= 599997) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((301 <= a28 && a24 == 1) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((((((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && a24 == 3) && ((217 < a26 || 37 < a28) || !(2 == input))) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || ((a24 == 1 && a26 <= 217) && 0 < a14 + 114)) || ((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Result: SAFE, OverallTime: 511.0s, OverallIterations: 21, TraceHistogramMax: 9, AutomataDifference: 442.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 177.8s, HoareTripleCheckerStatistics: 5705 SDtfs, 53140 SDslu, 2717 SDs, 0 SdLazy, 109509 SolverSat, 17629 SolverUnsat, 385 SolverUnknown, 0 SolverNotchecked, 370.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7787 GetRequests, 7554 SyntacticMatches, 20 SemanticMatches, 213 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 45.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127204occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 234154 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 984 NumberOfFragments, 1902 HoareAnnotationTreeSize, 4 FomulaSimplifications, 31083260 FormulaSimplificationTreeSizeReduction, 24.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 8077428 FormulaSimplificationTreeSizeReductionInter, 153.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 36.2s InterpolantComputationTime, 23645 NumberOfCodeBlocks, 23645 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 23615 ConstructedInterpolants, 1165 QuantifiedInterpolants, 223387414 SizeOfPredicates, 12 NumberOfNonLiveVariables, 8942 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 35438/41528 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...