./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label28.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_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label28.c -s /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 135f975c9db1c9341bb4a70ce00cbfa1e1ef94a6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:02:12,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:02:12,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:02:12,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:02:12,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:02:12,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:02:12,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:02:12,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:02:12,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:02:12,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:02:12,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:02:12,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:02:12,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:02:12,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:02:12,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:02:12,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:02:12,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:02:12,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:02:12,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:02:12,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:02:12,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:02:12,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:02:12,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:02:12,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:02:12,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:02:12,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:02:12,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:02:12,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:02:12,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:02:12,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:02:12,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:02:12,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:02:12,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:02:12,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:02:12,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:02:12,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:02:12,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:02:12,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:02:12,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:02:12,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:02:12,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:02:12,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:02:12,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:02:12,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:02:12,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:02:12,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:02:12,870 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:02:12,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:02:12,870 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:02:12,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:02:12,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:02:12,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:02:12,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:02:12,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:02:12,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:02:12,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:02:12,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:02:12,871 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:02:12,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:02:12,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:02:12,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:02:12,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:02:12,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:02:12,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:02:12,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:02:12,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:02:12,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:02:12,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:02:12,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:02:12,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:02:12,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:02:12,873 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_766e3e88-b944-4a0e-9e59-e87387626be6/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 -> 135f975c9db1c9341bb4a70ce00cbfa1e1ef94a6 [2019-12-07 16:02:12,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:02:12,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:02:12,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:02:12,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:02:12,986 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:02:12,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label28.c [2019-12-07 16:02:13,022 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/data/737c9f7d3/12a4bd8d430641ca8e5c5d8ff79c0a1f/FLAGc407c1e2b [2019-12-07 16:02:13,483 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:02:13,483 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/sv-benchmarks/c/eca-rers2012/Problem15_label28.c [2019-12-07 16:02:13,500 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/data/737c9f7d3/12a4bd8d430641ca8e5c5d8ff79c0a1f/FLAGc407c1e2b [2019-12-07 16:02:13,769 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/data/737c9f7d3/12a4bd8d430641ca8e5c5d8ff79c0a1f [2019-12-07 16:02:13,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:02:13,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:02:13,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:02:13,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:02:13,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:02:13,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:02:13" (1/1) ... [2019-12-07 16:02:13,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31149b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:13, skipping insertion in model container [2019-12-07 16:02:13,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:02:13" (1/1) ... [2019-12-07 16:02:13,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:02:13,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:02:14,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:02:14,357 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:02:14,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:02:14,529 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:02:14,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14 WrapperNode [2019-12-07 16:02:14,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:02:14,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:02:14,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:02:14,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:02:14,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:02:14,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:02:14,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:02:14,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:02:14,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... [2019-12-07 16:02:14,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:02:14,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:02:14,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:02:14,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:02:14,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:02:14,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:02:14,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:02:17,729 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:02:17,729 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 16:02:17,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:17 BoogieIcfgContainer [2019-12-07 16:02:17,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:02:17,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:02:17,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:02:17,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:02:17,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:02:13" (1/3) ... [2019-12-07 16:02:17,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c40665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:02:17, skipping insertion in model container [2019-12-07 16:02:17,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:14" (2/3) ... [2019-12-07 16:02:17,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c40665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:02:17, skipping insertion in model container [2019-12-07 16:02:17,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:17" (3/3) ... [2019-12-07 16:02:17,735 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label28.c [2019-12-07 16:02:17,742 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:02:17,747 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:02:17,755 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:02:17,775 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:02:17,775 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:02:17,775 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:02:17,775 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:02:17,776 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:02:17,776 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:02:17,776 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:02:17,776 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:02:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 16:02:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:02:17,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:17,799 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] [2019-12-07 16:02:17,799 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:17,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2019-12-07 16:02:17,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:17,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750611864] [2019-12-07 16:02:17,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:17,959 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 16:02:17,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750611864] [2019-12-07 16:02:17,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:17,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:17,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488888889] [2019-12-07 16:02:17,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:02:17,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:02:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:17,976 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 16:02:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:20,469 INFO L93 Difference]: Finished difference Result 1468 states and 2718 transitions. [2019-12-07 16:02:20,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:02:20,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-07 16:02:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:20,485 INFO L225 Difference]: With dead ends: 1468 [2019-12-07 16:02:20,485 INFO L226 Difference]: Without dead ends: 977 [2019-12-07 16:02:20,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-12-07 16:02:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 973. [2019-12-07 16:02:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-12-07 16:02:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1487 transitions. [2019-12-07 16:02:20,552 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1487 transitions. Word has length 32 [2019-12-07 16:02:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:20,552 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 1487 transitions. [2019-12-07 16:02:20,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:02:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1487 transitions. [2019-12-07 16:02:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 16:02:20,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:20,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:20,557 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:20,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:20,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2019188173, now seen corresponding path program 1 times [2019-12-07 16:02:20,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:20,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466552833] [2019-12-07 16:02:20,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:20,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466552833] [2019-12-07 16:02:20,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:20,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:20,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645338405] [2019-12-07 16:02:20,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:02:20,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:02:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:20,706 INFO L87 Difference]: Start difference. First operand 973 states and 1487 transitions. Second operand 4 states. [2019-12-07 16:02:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:22,752 INFO L93 Difference]: Finished difference Result 3746 states and 5750 transitions. [2019-12-07 16:02:22,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:02:22,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 16:02:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:22,763 INFO L225 Difference]: With dead ends: 3746 [2019-12-07 16:02:22,763 INFO L226 Difference]: Without dead ends: 2775 [2019-12-07 16:02:22,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2019-12-07 16:02:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1872. [2019-12-07 16:02:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2019-12-07 16:02:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2495 transitions. [2019-12-07 16:02:22,795 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2495 transitions. Word has length 151 [2019-12-07 16:02:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:22,796 INFO L462 AbstractCegarLoop]: Abstraction has 1872 states and 2495 transitions. [2019-12-07 16:02:22,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:02:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2495 transitions. [2019-12-07 16:02:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-12-07 16:02:22,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:22,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:22,799 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash 516991842, now seen corresponding path program 1 times [2019-12-07 16:02:22,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:22,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902066852] [2019-12-07 16:02:22,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 16:02:22,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902066852] [2019-12-07 16:02:22,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164264222] [2019-12-07 16:02:22,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:02:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:23,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:02:23,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 16:02:23,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:02:23,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-12-07 16:02:23,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354166306] [2019-12-07 16:02:23,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:23,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:23,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:23,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:23,139 INFO L87 Difference]: Start difference. First operand 1872 states and 2495 transitions. Second operand 3 states. [2019-12-07 16:02:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:25,034 INFO L93 Difference]: Finished difference Result 4942 states and 6535 transitions. [2019-12-07 16:02:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:25,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-12-07 16:02:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:25,050 INFO L225 Difference]: With dead ends: 4942 [2019-12-07 16:02:25,050 INFO L226 Difference]: Without dead ends: 3072 [2019-12-07 16:02:25,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 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 16:02:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-12-07 16:02:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2771. [2019-12-07 16:02:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2019-12-07 16:02:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3503 transitions. [2019-12-07 16:02:25,098 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3503 transitions. Word has length 228 [2019-12-07 16:02:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:25,099 INFO L462 AbstractCegarLoop]: Abstraction has 2771 states and 3503 transitions. [2019-12-07 16:02:25,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3503 transitions. [2019-12-07 16:02:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-12-07 16:02:25,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:25,103 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:02:25,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:02:25,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:25,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:25,304 INFO L82 PathProgramCache]: Analyzing trace with hash 78183249, now seen corresponding path program 1 times [2019-12-07 16:02:25,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:25,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742763091] [2019-12-07 16:02:25,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 16:02:25,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742763091] [2019-12-07 16:02:25,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:25,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:02:25,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936816241] [2019-12-07 16:02:25,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:02:25,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:25,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:02:25,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:02:25,667 INFO L87 Difference]: Start difference. First operand 2771 states and 3503 transitions. Second operand 5 states. [2019-12-07 16:02:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:28,724 INFO L93 Difference]: Finished difference Result 6439 states and 7983 transitions. [2019-12-07 16:02:28,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:02:28,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-12-07 16:02:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:28,738 INFO L225 Difference]: With dead ends: 6439 [2019-12-07 16:02:28,738 INFO L226 Difference]: Without dead ends: 3670 [2019-12-07 16:02:28,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:02:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-12-07 16:02:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3370. [2019-12-07 16:02:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2019-12-07 16:02:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4138 transitions. [2019-12-07 16:02:28,781 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4138 transitions. Word has length 310 [2019-12-07 16:02:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:28,781 INFO L462 AbstractCegarLoop]: Abstraction has 3370 states and 4138 transitions. [2019-12-07 16:02:28,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:02:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4138 transitions. [2019-12-07 16:02:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-12-07 16:02:28,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:28,784 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:02:28,784 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 579536590, now seen corresponding path program 1 times [2019-12-07 16:02:28,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:28,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117778183] [2019-12-07 16:02:28,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 16:02:28,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117778183] [2019-12-07 16:02:28,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:28,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:28,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36919505] [2019-12-07 16:02:28,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:28,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:28,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:28,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:28,941 INFO L87 Difference]: Start difference. First operand 3370 states and 4138 transitions. Second operand 3 states. [2019-12-07 16:02:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:31,908 INFO L93 Difference]: Finished difference Result 9132 states and 11306 transitions. [2019-12-07 16:02:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:31,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-12-07 16:02:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:31,926 INFO L225 Difference]: With dead ends: 9132 [2019-12-07 16:02:31,926 INFO L226 Difference]: Without dead ends: 5764 [2019-12-07 16:02:31,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2019-12-07 16:02:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 3968. [2019-12-07 16:02:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3968 states. [2019-12-07 16:02:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 4936 transitions. [2019-12-07 16:02:31,987 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 4936 transitions. Word has length 319 [2019-12-07 16:02:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:31,988 INFO L462 AbstractCegarLoop]: Abstraction has 3968 states and 4936 transitions. [2019-12-07 16:02:31,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 4936 transitions. [2019-12-07 16:02:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-12-07 16:02:31,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:31,992 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:02:31,992 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1647724765, now seen corresponding path program 1 times [2019-12-07 16:02:31,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:31,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899100786] [2019-12-07 16:02:31,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:32,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899100786] [2019-12-07 16:02:32,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:32,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:02:32,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59146031] [2019-12-07 16:02:32,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:02:32,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:32,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:02:32,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:02:32,194 INFO L87 Difference]: Start difference. First operand 3968 states and 4936 transitions. Second operand 4 states. [2019-12-07 16:02:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:34,742 INFO L93 Difference]: Finished difference Result 9734 states and 12346 transitions. [2019-12-07 16:02:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:02:34,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 384 [2019-12-07 16:02:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:34,760 INFO L225 Difference]: With dead ends: 9734 [2019-12-07 16:02:34,761 INFO L226 Difference]: Without dead ends: 5768 [2019-12-07 16:02:34,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 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 16:02:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2019-12-07 16:02:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 5765. [2019-12-07 16:02:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-07 16:02:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7047 transitions. [2019-12-07 16:02:34,813 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7047 transitions. Word has length 384 [2019-12-07 16:02:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:34,814 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 7047 transitions. [2019-12-07 16:02:34,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:02:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7047 transitions. [2019-12-07 16:02:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-12-07 16:02:34,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:34,816 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:02:34,817 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:34,817 INFO L82 PathProgramCache]: Analyzing trace with hash 624859565, now seen corresponding path program 1 times [2019-12-07 16:02:34,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:34,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354579267] [2019-12-07 16:02:34,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:35,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354579267] [2019-12-07 16:02:35,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378596591] [2019-12-07 16:02:35,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:02:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:35,272 INFO L264 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:02:35,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:02:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:02:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 135 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:35,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:02:35,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-12-07 16:02:35,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426156825] [2019-12-07 16:02:35,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:02:35,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:02:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:02:35,598 INFO L87 Difference]: Start difference. First operand 5765 states and 7047 transitions. Second operand 8 states. [2019-12-07 16:02:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:57,455 INFO L93 Difference]: Finished difference Result 33461 states and 41946 transitions. [2019-12-07 16:02:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 16:02:57,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 409 [2019-12-07 16:02:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:57,503 INFO L225 Difference]: With dead ends: 33461 [2019-12-07 16:02:57,503 INFO L226 Difference]: Without dead ends: 27698 [2019-12-07 16:02:57,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-12-07 16:02:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27698 states. [2019-12-07 16:02:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27698 to 20760. [2019-12-07 16:02:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20760 states. [2019-12-07 16:02:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20760 states to 20760 states and 25499 transitions. [2019-12-07 16:02:57,709 INFO L78 Accepts]: Start accepts. Automaton has 20760 states and 25499 transitions. Word has length 409 [2019-12-07 16:02:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:57,709 INFO L462 AbstractCegarLoop]: Abstraction has 20760 states and 25499 transitions. [2019-12-07 16:02:57,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:02:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 20760 states and 25499 transitions. [2019-12-07 16:02:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-12-07 16:02:57,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:57,715 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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] [2019-12-07 16:02:57,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:02:57,916 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1671806954, now seen corresponding path program 1 times [2019-12-07 16:02:57,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:57,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425408258] [2019-12-07 16:02:57,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 504 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 16:02:58,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425408258] [2019-12-07 16:02:58,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038329806] [2019-12-07 16:02:58,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:02:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:58,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:02:58,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:02:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2019-12-07 16:02:58,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:02:58,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 16:02:58,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31978364] [2019-12-07 16:02:58,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:58,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:02:58,968 INFO L87 Difference]: Start difference. First operand 20760 states and 25499 transitions. Second operand 3 states. [2019-12-07 16:03:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:03:00,906 INFO L93 Difference]: Finished difference Result 43610 states and 53948 transitions. [2019-12-07 16:03:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:03:00,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2019-12-07 16:03:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:03:00,928 INFO L225 Difference]: With dead ends: 43610 [2019-12-07 16:03:00,928 INFO L226 Difference]: Without dead ends: 22852 [2019-12-07 16:03:00,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:03:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22852 states. [2019-12-07 16:03:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22852 to 21349. [2019-12-07 16:03:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2019-12-07 16:03:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 25566 transitions. [2019-12-07 16:03:01,125 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 25566 transitions. Word has length 514 [2019-12-07 16:03:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:03:01,126 INFO L462 AbstractCegarLoop]: Abstraction has 21349 states and 25566 transitions. [2019-12-07 16:03:01,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:03:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 25566 transitions. [2019-12-07 16:03:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-12-07 16:03:01,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:03:01,134 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:03:01,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:03:01,335 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:03:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:03:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash -402088235, now seen corresponding path program 1 times [2019-12-07 16:03:01,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:03:01,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326351698] [2019-12-07 16:03:01,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:03:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:03:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 539 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 16:03:02,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326351698] [2019-12-07 16:03:02,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341264784] [2019-12-07 16:03:02,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:03:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:03:02,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:03:02,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:03:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 16:03:02,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:03:02,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 16:03:02,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687653107] [2019-12-07 16:03:02,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:03:02,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:03:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:03:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:03:02,435 INFO L87 Difference]: Start difference. First operand 21349 states and 25566 transitions. Second operand 3 states. [2019-12-07 16:03:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:03:03,754 INFO L93 Difference]: Finished difference Result 42696 states and 51130 transitions. [2019-12-07 16:03:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:03:03,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 547 [2019-12-07 16:03:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:03:03,770 INFO L225 Difference]: With dead ends: 42696 [2019-12-07 16:03:03,770 INFO L226 Difference]: Without dead ends: 21349 [2019-12-07 16:03:03,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 546 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:03:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21349 states. [2019-12-07 16:03:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21349 to 21349. [2019-12-07 16:03:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2019-12-07 16:03:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 25218 transitions. [2019-12-07 16:03:03,949 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 25218 transitions. Word has length 547 [2019-12-07 16:03:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:03:03,949 INFO L462 AbstractCegarLoop]: Abstraction has 21349 states and 25218 transitions. [2019-12-07 16:03:03,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:03:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 25218 transitions. [2019-12-07 16:03:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-12-07 16:03:03,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:03:03,954 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:03:04,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:03:04,155 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:03:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:03:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1478183197, now seen corresponding path program 1 times [2019-12-07 16:03:04,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:03:04,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307398956] [2019-12-07 16:03:04,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:03:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:03:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-12-07 16:03:04,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307398956] [2019-12-07 16:03:04,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:03:04,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:03:04,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936538841] [2019-12-07 16:03:04,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:03:04,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:03:04,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:03:04,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:03:04,507 INFO L87 Difference]: Start difference. First operand 21349 states and 25218 transitions. Second operand 4 states. [2019-12-07 16:03:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:03:07,874 INFO L93 Difference]: Finished difference Result 42403 states and 50118 transitions. [2019-12-07 16:03:07,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:03:07,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 567 [2019-12-07 16:03:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:03:07,892 INFO L225 Difference]: With dead ends: 42403 [2019-12-07 16:03:07,892 INFO L226 Difference]: Without dead ends: 21056 [2019-12-07 16:03:07,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 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 16:03:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21056 states. [2019-12-07 16:03:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21056 to 21047. [2019-12-07 16:03:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-07 16:03:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 23923 transitions. [2019-12-07 16:03:08,062 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 23923 transitions. Word has length 567 [2019-12-07 16:03:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:03:08,063 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 23923 transitions. [2019-12-07 16:03:08,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:03:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 23923 transitions. [2019-12-07 16:03:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-12-07 16:03:08,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:03:08,069 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:03:08,069 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:03:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:03:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1082476183, now seen corresponding path program 1 times [2019-12-07 16:03:08,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:03:08,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050713106] [2019-12-07 16:03:08,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:03:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:03:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 317 proven. 30 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 16:03:08,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050713106] [2019-12-07 16:03:08,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997008394] [2019-12-07 16:03:08,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:03:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:03:08,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:03:08,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:03:08,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:08,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:03:08,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:08,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:03:08,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:03:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 317 proven. 30 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 16:03:08,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:03:08,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 16:03:08,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053424487] [2019-12-07 16:03:08,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:03:08,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:03:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:03:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:03:08,854 INFO L87 Difference]: Start difference. First operand 21047 states and 23923 transitions. Second operand 8 states. [2019-12-07 16:03:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:03:21,511 INFO L93 Difference]: Finished difference Result 56772 states and 64018 transitions. [2019-12-07 16:03:21,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 16:03:21,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 573 [2019-12-07 16:03:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:03:21,537 INFO L225 Difference]: With dead ends: 56772 [2019-12-07 16:03:21,537 INFO L226 Difference]: Without dead ends: 35727 [2019-12-07 16:03:21,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:03:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35727 states. [2019-12-07 16:03:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35727 to 26431. [2019-12-07 16:03:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26431 states. [2019-12-07 16:03:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26431 states to 26431 states and 29647 transitions. [2019-12-07 16:03:21,777 INFO L78 Accepts]: Start accepts. Automaton has 26431 states and 29647 transitions. Word has length 573 [2019-12-07 16:03:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:03:21,778 INFO L462 AbstractCegarLoop]: Abstraction has 26431 states and 29647 transitions. [2019-12-07 16:03:21,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:03:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 26431 states and 29647 transitions. [2019-12-07 16:03:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2019-12-07 16:03:21,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:03:21,792 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:03:21,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:03:21,993 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:03:21,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:03:21,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1451542345, now seen corresponding path program 1 times [2019-12-07 16:03:21,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:03:21,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172341149] [2019-12-07 16:03:21,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:03:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:03:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 391 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:03:24,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172341149] [2019-12-07 16:03:24,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303195156] [2019-12-07 16:03:24,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:03:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:03:24,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:03:24,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:03:24,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:24,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:24,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:24,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:24,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:24,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:24,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:24,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:03:35,707 WARN L192 SmtUtils]: Spent 9.71 s on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-12-07 16:03:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-12-07 16:03:41,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:03:41,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-12-07 16:03:41,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698608104] [2019-12-07 16:03:41,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:03:41,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:03:41,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:03:41,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:03:41,913 INFO L87 Difference]: Start difference. First operand 26431 states and 29647 transitions. Second operand 3 states. [2019-12-07 16:05:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:11,598 INFO L93 Difference]: Finished difference Result 27533 states and 30750 transitions. [2019-12-07 16:05:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:05:11,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 716 [2019-12-07 16:05:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:11,620 INFO L225 Difference]: With dead ends: 27533 [2019-12-07 16:05:11,620 INFO L226 Difference]: Without dead ends: 27531 [2019-12-07 16:05:11,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 685 SyntacticMatches, 31 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:05:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27531 states. [2019-12-07 16:05:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27531 to 26493. [2019-12-07 16:05:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26493 states. [2019-12-07 16:05:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26493 states to 26493 states and 29709 transitions. [2019-12-07 16:05:11,836 INFO L78 Accepts]: Start accepts. Automaton has 26493 states and 29709 transitions. Word has length 716 [2019-12-07 16:05:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:11,837 INFO L462 AbstractCegarLoop]: Abstraction has 26493 states and 29709 transitions. [2019-12-07 16:05:11,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:05:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 26493 states and 29709 transitions. [2019-12-07 16:05:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2019-12-07 16:05:11,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:11,852 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2019-12-07 16:05:12,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:12,053 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2024559356, now seen corresponding path program 1 times [2019-12-07 16:05:12,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:05:12,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625135666] [2019-12-07 16:05:12,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 467 proven. 30 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-12-07 16:05:12,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625135666] [2019-12-07 16:05:12,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376805181] [2019-12-07 16:05:12,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:05:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:12,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:05:12,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:05:12,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:12,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-12-07 16:05:13,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:05:13,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-12-07 16:05:13,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301601452] [2019-12-07 16:05:13,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:05:13,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:05:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:05:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:05:13,254 INFO L87 Difference]: Start difference. First operand 26493 states and 29709 transitions. Second operand 4 states. [2019-12-07 16:05:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:16,893 INFO L93 Difference]: Finished difference Result 61441 states and 68859 transitions. [2019-12-07 16:05:16,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:05:16,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 729 [2019-12-07 16:05:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:16,921 INFO L225 Difference]: With dead ends: 61441 [2019-12-07 16:05:16,921 INFO L226 Difference]: Without dead ends: 34950 [2019-12-07 16:05:16,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 728 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:05:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34950 states. [2019-12-07 16:05:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34950 to 31275. [2019-12-07 16:05:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31275 states. [2019-12-07 16:05:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31275 states to 31275 states and 34892 transitions. [2019-12-07 16:05:17,212 INFO L78 Accepts]: Start accepts. Automaton has 31275 states and 34892 transitions. Word has length 729 [2019-12-07 16:05:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:17,213 INFO L462 AbstractCegarLoop]: Abstraction has 31275 states and 34892 transitions. [2019-12-07 16:05:17,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:05:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31275 states and 34892 transitions. [2019-12-07 16:05:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2019-12-07 16:05:17,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:17,236 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, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:05:17,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:17,438 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash 642461154, now seen corresponding path program 1 times [2019-12-07 16:05:17,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:05:17,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638846073] [2019-12-07 16:05:17,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 791 proven. 3 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-12-07 16:05:18,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638846073] [2019-12-07 16:05:18,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662736201] [2019-12-07 16:05:18,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:05:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:18,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:05:18,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:05:18,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:05:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 755 proven. 39 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-12-07 16:05:19,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:05:19,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 16:05:19,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188588289] [2019-12-07 16:05:19,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:05:19,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:05:19,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:05:19,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:05:19,446 INFO L87 Difference]: Start difference. First operand 31275 states and 34892 transitions. Second operand 9 states. [2019-12-07 16:05:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:24,211 INFO L93 Difference]: Finished difference Result 69630 states and 77296 transitions. [2019-12-07 16:05:24,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:05:24,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 812 [2019-12-07 16:05:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:24,231 INFO L225 Difference]: With dead ends: 69630 [2019-12-07 16:05:24,232 INFO L226 Difference]: Without dead ends: 28282 [2019-12-07 16:05:24,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 810 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:05:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28282 states. [2019-12-07 16:05:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28282 to 23466. [2019-12-07 16:05:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23466 states. [2019-12-07 16:05:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23466 states to 23466 states and 24871 transitions. [2019-12-07 16:05:24,440 INFO L78 Accepts]: Start accepts. Automaton has 23466 states and 24871 transitions. Word has length 812 [2019-12-07 16:05:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:24,441 INFO L462 AbstractCegarLoop]: Abstraction has 23466 states and 24871 transitions. [2019-12-07 16:05:24,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:05:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 23466 states and 24871 transitions. [2019-12-07 16:05:24,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-12-07 16:05:24,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:24,455 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:05:24,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:24,657 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:24,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:24,657 INFO L82 PathProgramCache]: Analyzing trace with hash -587021766, now seen corresponding path program 1 times [2019-12-07 16:05:24,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:05:24,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232274003] [2019-12-07 16:05:24,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-12-07 16:05:25,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232274003] [2019-12-07 16:05:25,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:05:25,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:05:25,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922793979] [2019-12-07 16:05:25,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:05:25,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:05:25,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:05:25,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:05:25,187 INFO L87 Difference]: Start difference. First operand 23466 states and 24871 transitions. Second operand 3 states. [2019-12-07 16:05:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:26,028 INFO L93 Difference]: Finished difference Result 46627 states and 49423 transitions. [2019-12-07 16:05:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:05:26,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 841 [2019-12-07 16:05:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:26,047 INFO L225 Difference]: With dead ends: 46627 [2019-12-07 16:05:26,047 INFO L226 Difference]: Without dead ends: 23163 [2019-12-07 16:05:26,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:05:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23163 states. [2019-12-07 16:05:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23163 to 22862. [2019-12-07 16:05:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22862 states. [2019-12-07 16:05:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22862 states to 22862 states and 24221 transitions. [2019-12-07 16:05:26,227 INFO L78 Accepts]: Start accepts. Automaton has 22862 states and 24221 transitions. Word has length 841 [2019-12-07 16:05:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:26,228 INFO L462 AbstractCegarLoop]: Abstraction has 22862 states and 24221 transitions. [2019-12-07 16:05:26,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:05:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 22862 states and 24221 transitions. [2019-12-07 16:05:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-12-07 16:05:26,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:26,242 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:05:26,242 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash -85654902, now seen corresponding path program 1 times [2019-12-07 16:05:26,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:05:26,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91915131] [2019-12-07 16:05:26,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 607 proven. 210 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-12-07 16:05:27,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91915131] [2019-12-07 16:05:27,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356861572] [2019-12-07 16:05:27,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/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 16:05:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:27,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:05:27,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:05:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-12-07 16:05:27,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:05:27,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 16:05:27,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797741069] [2019-12-07 16:05:27,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:05:27,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:05:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:05:27,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:05:27,998 INFO L87 Difference]: Start difference. First operand 22862 states and 24221 transitions. Second operand 3 states. [2019-12-07 16:05:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:28,780 INFO L93 Difference]: Finished difference Result 45721 states and 48438 transitions. [2019-12-07 16:05:28,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:05:28,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 887 [2019-12-07 16:05:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:28,796 INFO L225 Difference]: With dead ends: 45721 [2019-12-07 16:05:28,796 INFO L226 Difference]: Without dead ends: 22861 [2019-12-07 16:05:28,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 888 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:05:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22861 states. [2019-12-07 16:05:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22861 to 22861. [2019-12-07 16:05:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22861 states. [2019-12-07 16:05:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22861 states to 22861 states and 24077 transitions. [2019-12-07 16:05:28,978 INFO L78 Accepts]: Start accepts. Automaton has 22861 states and 24077 transitions. Word has length 887 [2019-12-07 16:05:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:28,979 INFO L462 AbstractCegarLoop]: Abstraction has 22861 states and 24077 transitions. [2019-12-07 16:05:28,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:05:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 22861 states and 24077 transitions. [2019-12-07 16:05:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2019-12-07 16:05:28,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:28,996 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 16:05:29,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:29,197 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:29,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:29,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1663645066, now seen corresponding path program 1 times [2019-12-07 16:05:29,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:05:29,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955685782] [2019-12-07 16:05:29,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2019-12-07 16:05:29,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955685782] [2019-12-07 16:05:29,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:05:29,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:05:29,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881692621] [2019-12-07 16:05:29,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:05:29,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:05:29,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:05:29,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:05:29,730 INFO L87 Difference]: Start difference. First operand 22861 states and 24077 transitions. Second operand 3 states. [2019-12-07 16:05:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:30,448 INFO L93 Difference]: Finished difference Result 38791 states and 40833 transitions. [2019-12-07 16:05:30,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:05:30,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 923 [2019-12-07 16:05:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:30,461 INFO L225 Difference]: With dead ends: 38791 [2019-12-07 16:05:30,462 INFO L226 Difference]: Without dead ends: 15932 [2019-12-07 16:05:30,470 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 16:05:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15932 states. [2019-12-07 16:05:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15932 to 15035. [2019-12-07 16:05:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15035 states. [2019-12-07 16:05:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15035 states to 15035 states and 15547 transitions. [2019-12-07 16:05:30,609 INFO L78 Accepts]: Start accepts. Automaton has 15035 states and 15547 transitions. Word has length 923 [2019-12-07 16:05:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:30,610 INFO L462 AbstractCegarLoop]: Abstraction has 15035 states and 15547 transitions. [2019-12-07 16:05:30,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:05:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 15035 states and 15547 transitions. [2019-12-07 16:05:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2019-12-07 16:05:30,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:30,624 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 16:05:30,624 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1772919863, now seen corresponding path program 1 times [2019-12-07 16:05:30,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:05:30,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025114415] [2019-12-07 16:05:30,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:05:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 771 proven. 31 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-12-07 16:05:33,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025114415] [2019-12-07 16:05:33,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253034007] [2019-12-07 16:05:33,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:33,295 INFO L264 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:05:33,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:05:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 771 proven. 31 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-12-07 16:05:35,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:05:35,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2019-12-07 16:05:35,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910675654] [2019-12-07 16:05:35,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:05:35,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:05:35,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:05:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:05:35,100 INFO L87 Difference]: Start difference. First operand 15035 states and 15547 transitions. Second operand 7 states. [2019-12-07 16:05:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:37,436 INFO L93 Difference]: Finished difference Result 17462 states and 18100 transitions. [2019-12-07 16:05:37,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:05:37,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1015 [2019-12-07 16:05:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:37,437 INFO L225 Difference]: With dead ends: 17462 [2019-12-07 16:05:37,437 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:05:37,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 1018 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:05:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:05:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:05:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:05:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:05:37,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1015 [2019-12-07 16:05:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:37,441 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:05:37,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:05:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:05:37,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:05:37,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:05:37,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:05:38,115 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 537 DAG size of output: 438 [2019-12-07 16:05:38,523 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 537 DAG size of output: 438 [2019-12-07 16:05:38,837 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 499 DAG size of output: 409 [2019-12-07 16:05:45,242 WARN L192 SmtUtils]: Spent 6.40 s on a formula simplification. DAG size of input: 419 DAG size of output: 93 [2019-12-07 16:05:49,711 WARN L192 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 419 DAG size of output: 93 [2019-12-07 16:05:55,665 WARN L192 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 394 DAG size of output: 93 [2019-12-07 16:05:55,667 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 16:05:55,668 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,669 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,670 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,671 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,672 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,673 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,674 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,675 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 16:05:55,676 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 16:05:55,677 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,678 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse14 (+ ~a4~0 86))) (let ((.cse8 (= 3 ~a2~0)) (.cse2 (= 1 ~a2~0)) (.cse6 (+ ~a0~0 98)) (.cse13 (< 0 .cse14))) (let ((.cse9 (or (< 0 (+ ~a29~0 16)) .cse13)) (.cse3 (<= 0 (+ ~a29~0 192415))) (.cse4 (<= .cse14 0)) (.cse10 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895)))) (.cse5 (+ ~a29~0 144)) (.cse0 (<= .cse6 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse11 (not .cse2)) (.cse12 (not .cse8))) (or (and .cse0 .cse1 .cse2 (<= 0 (+ ~a0~0 146))) (and .cse0 (= 2 ~a2~0) .cse3) (and .cse4 (or (<= (+ ~a0~0 147) 0) (<= .cse5 0) (< 0 .cse6)) (<= (+ ~a0~0 61) 0)) (and .cse0 .cse1 (exists ((v_~a29~0_896 Int)) (let ((.cse7 (mod v_~a29~0_896 299928))) (and (<= (+ v_~a29~0_896 16) 0) (= 0 .cse7) (<= (+ ~a29~0 134555) .cse7)))) .cse8) (and .cse9 .cse1 (or .cse4 (<= 0 (+ ~a0~0 44))) .cse8) (and .cse4 .cse10 .cse2) (and .cse4 .cse9 .cse11 .cse12) (and .cse4 .cse11 .cse12 (<= ~a2~0 4)) (and .cse0 .cse1 .cse13 .cse3) (and .cse4 .cse10 .cse8) (and .cse1 .cse2 (<= ~a29~0 43) (< 0 .cse5)) (and .cse0 .cse1 .cse11 .cse12))))) [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 16:05:55,679 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 16:05:55,679 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,680 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse14 (+ ~a4~0 86))) (let ((.cse8 (= 3 ~a2~0)) (.cse2 (= 1 ~a2~0)) (.cse6 (+ ~a0~0 98)) (.cse13 (+ ~a29~0 144)) (.cse12 (< 0 .cse14))) (let ((.cse9 (or (< 0 (+ ~a29~0 16)) .cse12)) (.cse5 (<= .cse13 0)) (.cse3 (<= 0 (+ ~a29~0 192415))) (.cse4 (<= .cse14 0)) (.cse0 (<= .cse6 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse10 (not .cse2)) (.cse11 (not .cse8))) (or (and .cse0 .cse1 .cse2 (<= 0 (+ ~a0~0 146))) (and .cse0 (= 2 ~a2~0) .cse3) (and .cse4 (or (<= (+ ~a0~0 147) 0) .cse5 (< 0 .cse6)) (<= (+ ~a0~0 61) 0)) (and .cse0 .cse1 (exists ((v_~a29~0_896 Int)) (let ((.cse7 (mod v_~a29~0_896 299928))) (and (<= (+ v_~a29~0_896 16) 0) (= 0 .cse7) (<= (+ ~a29~0 134555) .cse7)))) .cse8) (and .cse9 .cse1 (or .cse4 (<= 0 (+ ~a0~0 44))) .cse8) (and .cse4 .cse9 .cse10 .cse11) (and .cse4 .cse10 .cse11 (<= ~a2~0 4)) (and .cse4 .cse2 .cse5) (and .cse0 .cse1 .cse12 .cse3) (and .cse4 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895))) .cse8) (and .cse1 .cse2 (<= ~a29~0 43) (< 0 .cse13)) (and .cse0 .cse1 .cse10 .cse11))))) [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,681 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,682 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,683 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,684 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse14 (+ ~a4~0 86))) (let ((.cse8 (= 3 ~a2~0)) (.cse2 (= 1 ~a2~0)) (.cse6 (+ ~a0~0 98)) (.cse13 (+ ~a29~0 144)) (.cse12 (< 0 .cse14))) (let ((.cse9 (or (< 0 (+ ~a29~0 16)) .cse12)) (.cse5 (<= .cse13 0)) (.cse3 (<= 0 (+ ~a29~0 192415))) (.cse4 (<= .cse14 0)) (.cse0 (<= .cse6 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse10 (not .cse2)) (.cse11 (not .cse8))) (or (and .cse0 .cse1 .cse2 (<= 0 (+ ~a0~0 146))) (and .cse0 (= 2 ~a2~0) .cse3) (and .cse4 (or (<= (+ ~a0~0 147) 0) .cse5 (< 0 .cse6)) (<= (+ ~a0~0 61) 0)) (and .cse0 .cse1 (exists ((v_~a29~0_896 Int)) (let ((.cse7 (mod v_~a29~0_896 299928))) (and (<= (+ v_~a29~0_896 16) 0) (= 0 .cse7) (<= (+ ~a29~0 134555) .cse7)))) .cse8) (and .cse9 .cse1 (or .cse4 (<= 0 (+ ~a0~0 44))) .cse8) (and .cse4 .cse9 .cse10 .cse11) (and .cse4 .cse10 .cse11 (<= ~a2~0 4)) (and .cse4 .cse2 .cse5) (and .cse0 .cse1 .cse12 .cse3) (and .cse4 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895))) .cse8) (and .cse1 .cse2 (<= ~a29~0 43) (< 0 .cse13)) (and .cse0 .cse1 .cse10 .cse11))))) [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,685 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,686 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,687 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,688 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 16:05:55,689 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 16:05:55,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:05:55 BoogieIcfgContainer [2019-12-07 16:05:55,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:05:55,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:05:55,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:05:55,716 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:05:55,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:17" (3/4) ... [2019-12-07 16:05:55,719 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:05:55,743 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 16:05:55,745 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:05:55,766 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) || ((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 + 16 <= 0 && 0 == v_~a29~0_896 % 299928) && a29 + 134555 <= v_~a29~0_896 % 299928)) && 3 == a2)) || ((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 <= a0 + 44)) && 3 == a2)) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(1 == a2)) && !(3 == a2))) || (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) && a2 <= 4)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && 3 == a2)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(1 == a2)) && !(3 == a2)) [2019-12-07 16:05:55,768 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) || ((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 + 16 <= 0 && 0 == v_~a29~0_896 % 299928) && a29 + 134555 <= v_~a29~0_896 % 299928)) && 3 == a2)) || ((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 <= a0 + 44)) && 3 == a2)) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(1 == a2)) && !(3 == a2))) || (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) && a2 <= 4)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && 3 == a2)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(1 == a2)) && !(3 == a2)) [2019-12-07 16:05:55,777 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) || ((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 + 16 <= 0 && 0 == v_~a29~0_896 % 299928) && a29 + 134555 <= v_~a29~0_896 % 299928)) && 3 == a2)) || ((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 <= a0 + 44)) && 3 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && 1 == a2)) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(1 == a2)) && !(3 == a2))) || (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) && a2 <= 4)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && 3 == a2)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(1 == a2)) && !(3 == a2)) [2019-12-07 16:05:55,869 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_766e3e88-b944-4a0e-9e59-e87387626be6/bin/uautomizer/witness.graphml [2019-12-07 16:05:55,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:05:55,870 INFO L168 Benchmark]: Toolchain (without parser) took 222097.27 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 935.4 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 187.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:55,870 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:05:55,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 935.4 MB in the beginning and 998.5 MB in the end (delta: -63.1 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:55,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.03 ms. Allocated memory is still 1.1 GB. Free memory was 998.5 MB in the beginning and 960.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:55,871 INFO L168 Benchmark]: Boogie Preprocessor took 121.69 ms. Allocated memory is still 1.1 GB. Free memory was 960.4 MB in the beginning and 938.3 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:55,871 INFO L168 Benchmark]: RCFGBuilder took 2969.56 ms. Allocated memory is still 1.1 GB. Free memory was 938.3 MB in the beginning and 866.9 MB in the end (delta: 71.4 MB). Peak memory consumption was 157.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:55,871 INFO L168 Benchmark]: TraceAbstraction took 217985.07 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 866.9 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 16:05:55,871 INFO L168 Benchmark]: Witness Printer took 153.10 ms. Allocated memory is still 2.9 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:55,873 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 754.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 935.4 MB in the beginning and 998.5 MB in the end (delta: -63.1 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.03 ms. Allocated memory is still 1.1 GB. Free memory was 998.5 MB in the beginning and 960.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.69 ms. Allocated memory is still 1.1 GB. Free memory was 960.4 MB in the beginning and 938.3 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2969.56 ms. Allocated memory is still 1.1 GB. Free memory was 938.3 MB in the beginning and 866.9 MB in the end (delta: 71.4 MB). Peak memory consumption was 157.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 217985.07 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 866.9 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 153.10 ms. Allocated memory is still 2.9 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 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_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: 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: 1766]: Loop Invariant [2019-12-07 16:05:55,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: (((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) || ((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 + 16 <= 0 && 0 == v_~a29~0_896 % 299928) && a29 + 134555 <= v_~a29~0_896 % 299928)) && 3 == a2)) || ((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 <= a0 + 44)) && 3 == a2)) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(1 == a2)) && !(3 == a2))) || (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) && a2 <= 4)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && 3 == a2)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(1 == a2)) && !(3 == a2)) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 16:05:55,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: (((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) || ((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 + 16 <= 0 && 0 == v_~a29~0_896 % 299928) && a29 + 134555 <= v_~a29~0_896 % 299928)) && 3 == a2)) || ((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 <= a0 + 44)) && 3 == a2)) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(1 == a2)) && !(3 == a2))) || (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) && a2 <= 4)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && 3 == a2)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(1 == a2)) && !(3 == a2)) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 16:05:55,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:05:55,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 16:05:55,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: (((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 146) || ((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || a29 + 144 <= 0) || 0 < a0 + 98)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 + 16 <= 0 && 0 == v_~a29~0_896 % 299928) && a29 + 134555 <= v_~a29~0_896 % 299928)) && 3 == a2)) || ((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 <= a0 + 44)) && 3 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && 1 == a2)) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(1 == a2)) && !(3 == a2))) || (((a4 + 86 <= 0 && !(1 == a2)) && !(3 == a2)) && a2 <= 4)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 0 <= a29 + 192415)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && 3 == a2)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 < a29 + 144)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(1 == a2)) && !(3 == a2)) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 199.8s, OverallIterations: 18, TraceHistogramMax: 6, AutomataDifference: 159.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.0s, HoareTripleCheckerStatistics: 4363 SDtfs, 18985 SDslu, 1294 SDs, 0 SdLazy, 43929 SolverSat, 8910 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 148.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6600 GetRequests, 6437 SyntacticMatches, 53 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31275occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 31780 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 294 NumberOfFragments, 797 HoareAnnotationTreeSize, 4 FomulaSimplifications, 29710 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 262728 FormulaSimplificationTreeSizeReductionInter, 16.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 16387 NumberOfCodeBlocks, 16387 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 16359 ConstructedInterpolants, 122 QuantifiedInterpolants, 57426852 SizeOfPredicates, 15 NumberOfNonLiveVariables, 7599 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 16374/17177 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...