./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label06.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/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 efd71a57cd4457ad6c114bfe7c857bcc7788c3aa .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:58:42,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:58:42,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:58:42,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:58:42,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:58:42,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:58:42,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:58:42,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:58:42,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:58:42,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:58:42,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:58:42,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:58:42,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:58:42,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:58:42,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:58:42,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:58:42,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:58:42,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:58:42,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:58:42,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:58:42,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:58:42,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:58:42,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:58:42,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:58:42,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:58:42,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:58:42,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:58:42,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:58:42,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:58:42,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:58:42,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:58:42,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:58:42,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:58:42,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:58:42,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:58:42,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:58:42,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:58:42,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:58:42,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:58:42,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:58:42,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:58:42,800 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:58:42,823 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:58:42,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:58:42,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:58:42,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:58:42,835 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:58:42,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:58:42,836 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:58:42,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:58:42,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:58:42,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:58:42,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:58:42,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:58:42,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:58:42,837 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:58:42,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:58:42,838 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:58:42,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:58:42,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:58:42,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:58:42,839 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:58:42,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:58:42,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:58:42,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:58:42,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:58:42,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:58:42,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:58:42,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:58:42,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:58:42,841 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_7340cecc-5e35-4a0a-b912-08c235081184/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 -> efd71a57cd4457ad6c114bfe7c857bcc7788c3aa [2019-11-20 10:58:42,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:58:42,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:58:42,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:58:42,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:58:42,986 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:58:42,987 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label06.c [2019-11-20 10:58:43,037 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/data/7d9ddada4/deb0b6282ca54d7c88213e52492031cb/FLAG6f3b8dca2 [2019-11-20 10:58:43,611 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:58:43,612 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/sv-benchmarks/c/eca-rers2012/Problem03_label06.c [2019-11-20 10:58:43,627 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/data/7d9ddada4/deb0b6282ca54d7c88213e52492031cb/FLAG6f3b8dca2 [2019-11-20 10:58:44,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/data/7d9ddada4/deb0b6282ca54d7c88213e52492031cb [2019-11-20 10:58:44,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:58:44,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:58:44,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:58:44,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:58:44,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:58:44,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:44" (1/1) ... [2019-11-20 10:58:44,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1d3fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:44, skipping insertion in model container [2019-11-20 10:58:44,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:44" (1/1) ... [2019-11-20 10:58:44,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:58:44,158 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:58:44,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:58:44,906 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:58:45,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:58:45,142 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:58:45,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45 WrapperNode [2019-11-20 10:58:45,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:58:45,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:58:45,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:58:45,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:58:45,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:58:45,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:58:45,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:58:45,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:58:45,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... [2019-11-20 10:58:45,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:58:45,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:58:45,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:58:45,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:58:45,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/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-11-20 10:58:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:58:45,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:58:47,571 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:58:47,571 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:58:47,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:47 BoogieIcfgContainer [2019-11-20 10:58:47,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:58:47,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:58:47,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:58:47,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:58:47,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:58:44" (1/3) ... [2019-11-20 10:58:47,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e6afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:58:47, skipping insertion in model container [2019-11-20 10:58:47,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:45" (2/3) ... [2019-11-20 10:58:47,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e6afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:58:47, skipping insertion in model container [2019-11-20 10:58:47,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:47" (3/3) ... [2019-11-20 10:58:47,593 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label06.c [2019-11-20 10:58:47,606 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:58:47,619 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:58:47,629 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:58:47,653 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:58:47,653 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:58:47,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:58:47,654 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:58:47,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:58:47,654 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:58:47,654 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:58:47,654 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:58:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-20 10:58:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 10:58:47,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:47,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:58:47,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:47,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1533533723, now seen corresponding path program 1 times [2019-11-20 10:58:47,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:47,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354749267] [2019-11-20 10:58:47,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:58:48,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354749267] [2019-11-20 10:58:48,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:48,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:58:48,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504887502] [2019-11-20 10:58:48,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:58:48,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:58:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:58:48,394 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-20 10:58:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:50,742 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-11-20 10:58:50,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:58:50,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-11-20 10:58:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:50,762 INFO L225 Difference]: With dead ends: 1023 [2019-11-20 10:58:50,762 INFO L226 Difference]: Without dead ends: 654 [2019-11-20 10:58:50,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:58:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-11-20 10:58:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-11-20 10:58:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-11-20 10:58:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-11-20 10:58:50,847 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 169 [2019-11-20 10:58:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:50,848 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-11-20 10:58:50,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:58:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-11-20 10:58:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 10:58:50,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:50,856 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:58:50,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash 728541020, now seen corresponding path program 1 times [2019-11-20 10:58:50,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:50,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944682817] [2019-11-20 10:58:50,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:58:50,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944682817] [2019-11-20 10:58:50,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:50,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:50,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318549364] [2019-11-20 10:58:50,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:50,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:50,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:50,989 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-11-20 10:58:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:52,097 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-11-20 10:58:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:52,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-20 10:58:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:52,105 INFO L225 Difference]: With dead ends: 1929 [2019-11-20 10:58:52,105 INFO L226 Difference]: Without dead ends: 1279 [2019-11-20 10:58:52,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-11-20 10:58:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-11-20 10:58:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-20 10:58:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1831 transitions. [2019-11-20 10:58:52,166 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1831 transitions. Word has length 177 [2019-11-20 10:58:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:52,166 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1831 transitions. [2019-11-20 10:58:52,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1831 transitions. [2019-11-20 10:58:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 10:58:52,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:52,171 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:58:52,171 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1433788651, now seen corresponding path program 1 times [2019-11-20 10:58:52,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:52,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817995121] [2019-11-20 10:58:52,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:58:52,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817995121] [2019-11-20 10:58:52,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:52,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:52,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346629286] [2019-11-20 10:58:52,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:52,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:52,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:52,293 INFO L87 Difference]: Start difference. First operand 1265 states and 1831 transitions. Second operand 3 states. [2019-11-20 10:58:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:52,742 INFO L93 Difference]: Finished difference Result 3779 states and 5474 transitions. [2019-11-20 10:58:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:52,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-20 10:58:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:52,760 INFO L225 Difference]: With dead ends: 3779 [2019-11-20 10:58:52,760 INFO L226 Difference]: Without dead ends: 2516 [2019-11-20 10:58:52,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-11-20 10:58:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2513. [2019-11-20 10:58:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-11-20 10:58:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3630 transitions. [2019-11-20 10:58:52,829 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3630 transitions. Word has length 189 [2019-11-20 10:58:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:52,830 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 3630 transitions. [2019-11-20 10:58:52,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3630 transitions. [2019-11-20 10:58:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 10:58:52,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:52,844 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 10:58:52,844 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:52,845 INFO L82 PathProgramCache]: Analyzing trace with hash 413925161, now seen corresponding path program 1 times [2019-11-20 10:58:52,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:52,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056944616] [2019-11-20 10:58:52,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 10:58:52,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056944616] [2019-11-20 10:58:52,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:52,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:58:52,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618170113] [2019-11-20 10:58:52,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:52,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:52,941 INFO L87 Difference]: Start difference. First operand 2513 states and 3630 transitions. Second operand 3 states. [2019-11-20 10:58:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:53,528 INFO L93 Difference]: Finished difference Result 4986 states and 7206 transitions. [2019-11-20 10:58:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:53,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-20 10:58:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:53,544 INFO L225 Difference]: With dead ends: 4986 [2019-11-20 10:58:53,544 INFO L226 Difference]: Without dead ends: 2475 [2019-11-20 10:58:53,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-11-20 10:58:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2019-11-20 10:58:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-11-20 10:58:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3502 transitions. [2019-11-20 10:58:53,617 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3502 transitions. Word has length 197 [2019-11-20 10:58:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:53,618 INFO L462 AbstractCegarLoop]: Abstraction has 2475 states and 3502 transitions. [2019-11-20 10:58:53,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3502 transitions. [2019-11-20 10:58:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 10:58:53,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:53,624 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:58:53,624 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1595982807, now seen corresponding path program 1 times [2019-11-20 10:58:53,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:53,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538124393] [2019-11-20 10:58:53,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:58:53,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538124393] [2019-11-20 10:58:53,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:53,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:58:53,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338308498] [2019-11-20 10:58:53,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:58:53,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:53,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:58:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:58:53,894 INFO L87 Difference]: Start difference. First operand 2475 states and 3502 transitions. Second operand 5 states. [2019-11-20 10:58:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:56,058 INFO L93 Difference]: Finished difference Result 5981 states and 8557 transitions. [2019-11-20 10:58:56,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:58:56,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-11-20 10:58:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:56,078 INFO L225 Difference]: With dead ends: 5981 [2019-11-20 10:58:56,079 INFO L226 Difference]: Without dead ends: 3508 [2019-11-20 10:58:56,083 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-11-20 10:58:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-11-20 10:58:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2881. [2019-11-20 10:58:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-11-20 10:58:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4092 transitions. [2019-11-20 10:58:56,154 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4092 transitions. Word has length 207 [2019-11-20 10:58:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:56,155 INFO L462 AbstractCegarLoop]: Abstraction has 2881 states and 4092 transitions. [2019-11-20 10:58:56,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:58:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4092 transitions. [2019-11-20 10:58:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 10:58:56,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:56,162 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:58:56,162 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash -161225717, now seen corresponding path program 1 times [2019-11-20 10:58:56,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:56,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639753959] [2019-11-20 10:58:56,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-20 10:58:56,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639753959] [2019-11-20 10:58:56,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146689589] [2019-11-20 10:58:56,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/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-11-20 10:58:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:56,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:58:56,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:58:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-20 10:58:56,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:58:56,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-20 10:58:56,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214962533] [2019-11-20 10:58:56,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:56,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:58:56,675 INFO L87 Difference]: Start difference. First operand 2881 states and 4092 transitions. Second operand 3 states. [2019-11-20 10:58:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:57,036 INFO L93 Difference]: Finished difference Result 8637 states and 12270 transitions. [2019-11-20 10:58:57,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:57,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-20 10:58:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:57,066 INFO L225 Difference]: With dead ends: 8637 [2019-11-20 10:58:57,067 INFO L226 Difference]: Without dead ends: 5758 [2019-11-20 10:58:57,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 241 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-11-20 10:58:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2019-11-20 10:58:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5756. [2019-11-20 10:58:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5756 states. [2019-11-20 10:58:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5756 states to 5756 states and 8155 transitions. [2019-11-20 10:58:57,186 INFO L78 Accepts]: Start accepts. Automaton has 5756 states and 8155 transitions. Word has length 241 [2019-11-20 10:58:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:57,188 INFO L462 AbstractCegarLoop]: Abstraction has 5756 states and 8155 transitions. [2019-11-20 10:58:57,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5756 states and 8155 transitions. [2019-11-20 10:58:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-20 10:58:57,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:57,197 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 10:58:57,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:58:57,402 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:57,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1637825347, now seen corresponding path program 1 times [2019-11-20 10:58:57,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:57,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631559695] [2019-11-20 10:58:57,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:58:57,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631559695] [2019-11-20 10:58:57,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:57,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:58:57,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318581548] [2019-11-20 10:58:57,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:58:57,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:57,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:58:57,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:58:57,575 INFO L87 Difference]: Start difference. First operand 5756 states and 8155 transitions. Second operand 3 states. [2019-11-20 10:58:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:58,638 INFO L93 Difference]: Finished difference Result 16806 states and 23749 transitions. [2019-11-20 10:58:58,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:58:58,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-11-20 10:58:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:58,708 INFO L225 Difference]: With dead ends: 16806 [2019-11-20 10:58:58,708 INFO L226 Difference]: Without dead ends: 11052 [2019-11-20 10:58:58,716 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-11-20 10:58:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11052 states. [2019-11-20 10:58:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11052 to 11048. [2019-11-20 10:58:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-11-20 10:58:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 14561 transitions. [2019-11-20 10:58:58,924 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 14561 transitions. Word has length 242 [2019-11-20 10:58:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:58,924 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 14561 transitions. [2019-11-20 10:58:58,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:58:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 14561 transitions. [2019-11-20 10:58:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-20 10:58:58,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:58,937 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-20 10:58:58,938 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash 759817113, now seen corresponding path program 1 times [2019-11-20 10:58:58,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:58:58,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151778635] [2019-11-20 10:58:58,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:58:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:58:59,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151778635] [2019-11-20 10:58:59,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:59,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:58:59,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021192794] [2019-11-20 10:58:59,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:58:59,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:58:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:58:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:58:59,275 INFO L87 Difference]: Start difference. First operand 11048 states and 14561 transitions. Second operand 4 states. [2019-11-20 10:59:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:59:00,911 INFO L93 Difference]: Finished difference Result 38772 states and 50858 transitions. [2019-11-20 10:59:00,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:59:00,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-11-20 10:59:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:59:00,965 INFO L225 Difference]: With dead ends: 38772 [2019-11-20 10:59:00,965 INFO L226 Difference]: Without dead ends: 27726 [2019-11-20 10:59:00,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:59:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27726 states. [2019-11-20 10:59:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27726 to 20792. [2019-11-20 10:59:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-11-20 10:59:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 26361 transitions. [2019-11-20 10:59:01,332 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 26361 transitions. Word has length 247 [2019-11-20 10:59:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:59:01,332 INFO L462 AbstractCegarLoop]: Abstraction has 20792 states and 26361 transitions. [2019-11-20 10:59:01,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:59:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 26361 transitions. [2019-11-20 10:59:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-20 10:59:01,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:59:01,355 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 10:59:01,356 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:59:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:59:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1063142085, now seen corresponding path program 1 times [2019-11-20 10:59:01,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:59:01,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852749785] [2019-11-20 10:59:01,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:59:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 10:59:01,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852749785] [2019-11-20 10:59:01,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:59:01,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:59:01,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891669255] [2019-11-20 10:59:01,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:59:01,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:59:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:59:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:59:01,479 INFO L87 Difference]: Start difference. First operand 20792 states and 26361 transitions. Second operand 3 states. [2019-11-20 10:59:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:59:02,850 INFO L93 Difference]: Finished difference Result 41590 states and 52734 transitions. [2019-11-20 10:59:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:59:02,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-11-20 10:59:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:59:02,881 INFO L225 Difference]: With dead ends: 41590 [2019-11-20 10:59:02,881 INFO L226 Difference]: Without dead ends: 20800 [2019-11-20 10:59:02,902 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-11-20 10:59:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20800 states. [2019-11-20 10:59:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20800 to 20792. [2019-11-20 10:59:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-11-20 10:59:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 24482 transitions. [2019-11-20 10:59:03,159 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 24482 transitions. Word has length 251 [2019-11-20 10:59:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:59:03,160 INFO L462 AbstractCegarLoop]: Abstraction has 20792 states and 24482 transitions. [2019-11-20 10:59:03,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:59:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 24482 transitions. [2019-11-20 10:59:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-20 10:59:03,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:59:03,182 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 10:59:03,182 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:59:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:59:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1663998635, now seen corresponding path program 1 times [2019-11-20 10:59:03,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:59:03,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778808031] [2019-11-20 10:59:03,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:59:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 10:59:03,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778808031] [2019-11-20 10:59:03,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:59:03,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:59:03,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681094748] [2019-11-20 10:59:03,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:59:03,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:59:03,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:59:03,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:59:03,311 INFO L87 Difference]: Start difference. First operand 20792 states and 24482 transitions. Second operand 4 states. [2019-11-20 10:59:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:59:04,405 INFO L93 Difference]: Finished difference Result 41176 states and 48504 transitions. [2019-11-20 10:59:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:59:04,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-11-20 10:59:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:59:04,436 INFO L225 Difference]: With dead ends: 41176 [2019-11-20 10:59:04,436 INFO L226 Difference]: Without dead ends: 20386 [2019-11-20 10:59:04,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:59:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20386 states. [2019-11-20 10:59:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20386 to 20386. [2019-11-20 10:59:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20386 states. [2019-11-20 10:59:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20386 states to 20386 states and 23032 transitions. [2019-11-20 10:59:04,683 INFO L78 Accepts]: Start accepts. Automaton has 20386 states and 23032 transitions. Word has length 268 [2019-11-20 10:59:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:59:04,683 INFO L462 AbstractCegarLoop]: Abstraction has 20386 states and 23032 transitions. [2019-11-20 10:59:04,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:59:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20386 states and 23032 transitions. [2019-11-20 10:59:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-20 10:59:04,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:59:04,700 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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] [2019-11-20 10:59:04,701 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:59:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:59:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1558817520, now seen corresponding path program 1 times [2019-11-20 10:59:04,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:59:04,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261138494] [2019-11-20 10:59:04,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:59:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 10:59:04,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261138494] [2019-11-20 10:59:04,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:59:04,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:59:04,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910300120] [2019-11-20 10:59:04,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:59:04,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:59:04,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:59:04,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:59:04,899 INFO L87 Difference]: Start difference. First operand 20386 states and 23032 transitions. Second operand 4 states. [2019-11-20 10:59:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:59:07,044 INFO L93 Difference]: Finished difference Result 79281 states and 89718 transitions. [2019-11-20 10:59:07,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:59:07,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-11-20 10:59:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:59:07,150 INFO L225 Difference]: With dead ends: 79281 [2019-11-20 10:59:07,150 INFO L226 Difference]: Without dead ends: 58897 [2019-11-20 10:59:07,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:59:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58897 states. [2019-11-20 10:59:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58897 to 58893. [2019-11-20 10:59:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58893 states. [2019-11-20 10:59:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58893 states to 58893 states and 66550 transitions. [2019-11-20 10:59:07,825 INFO L78 Accepts]: Start accepts. Automaton has 58893 states and 66550 transitions. Word has length 270 [2019-11-20 10:59:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:59:07,825 INFO L462 AbstractCegarLoop]: Abstraction has 58893 states and 66550 transitions. [2019-11-20 10:59:07,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:59:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 58893 states and 66550 transitions. [2019-11-20 10:59:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-20 10:59:07,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:59:07,846 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 10:59:07,846 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:59:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:59:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash -187630124, now seen corresponding path program 1 times [2019-11-20 10:59:07,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:59:07,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349262712] [2019-11-20 10:59:07,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:59:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 10:59:07,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349262712] [2019-11-20 10:59:07,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:59:07,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:59:07,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786291977] [2019-11-20 10:59:07,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:59:07,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:59:07,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:59:07,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:59:07,987 INFO L87 Difference]: Start difference. First operand 58893 states and 66550 transitions. Second operand 3 states. [2019-11-20 10:59:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:59:09,482 INFO L93 Difference]: Finished difference Result 154384 states and 173941 transitions. [2019-11-20 10:59:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:59:09,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-11-20 10:59:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:59:09,598 INFO L225 Difference]: With dead ends: 154384 [2019-11-20 10:59:09,599 INFO L226 Difference]: Without dead ends: 95493 [2019-11-20 10:59:09,635 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-11-20 10:59:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95493 states. [2019-11-20 10:59:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95493 to 95457. [2019-11-20 10:59:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95457 states. [2019-11-20 10:59:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95457 states to 95457 states and 105696 transitions. [2019-11-20 10:59:10,658 INFO L78 Accepts]: Start accepts. Automaton has 95457 states and 105696 transitions. Word has length 302 [2019-11-20 10:59:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:59:10,658 INFO L462 AbstractCegarLoop]: Abstraction has 95457 states and 105696 transitions. [2019-11-20 10:59:10,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:59:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 95457 states and 105696 transitions. [2019-11-20 10:59:10,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-20 10:59:10,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:59:10,678 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 10:59:10,678 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:59:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:59:10,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1679996946, now seen corresponding path program 1 times [2019-11-20 10:59:10,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:59:10,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641961902] [2019-11-20 10:59:10,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:59:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-20 10:59:10,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641961902] [2019-11-20 10:59:10,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:59:10,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:59:10,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354867244] [2019-11-20 10:59:10,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:59:10,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:59:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:59:10,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:59:10,864 INFO L87 Difference]: Start difference. First operand 95457 states and 105696 transitions. Second operand 3 states. [2019-11-20 10:59:12,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:59:12,583 INFO L93 Difference]: Finished difference Result 234303 states and 259782 transitions. [2019-11-20 10:59:12,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:59:12,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-20 10:59:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:59:12,725 INFO L225 Difference]: With dead ends: 234303 [2019-11-20 10:59:12,725 INFO L226 Difference]: Without dead ends: 138848 [2019-11-20 10:59:12,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:59:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138848 states. [2019-11-20 10:59:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138848 to 138830. [2019-11-20 10:59:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138830 states. [2019-11-20 10:59:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138830 states to 138830 states and 153929 transitions. [2019-11-20 10:59:14,575 INFO L78 Accepts]: Start accepts. Automaton has 138830 states and 153929 transitions. Word has length 305 [2019-11-20 10:59:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:59:14,575 INFO L462 AbstractCegarLoop]: Abstraction has 138830 states and 153929 transitions. [2019-11-20 10:59:14,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:59:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 138830 states and 153929 transitions. [2019-11-20 10:59:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-20 10:59:14,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:59:14,593 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:59:14,593 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:59:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:59:14,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1262892857, now seen corresponding path program 1 times [2019-11-20 10:59:14,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:59:14,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360545621] [2019-11-20 10:59:14,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:59:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-20 10:59:14,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360545621] [2019-11-20 10:59:14,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679695600] [2019-11-20 10:59:14,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/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-11-20 10:59:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:14,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:59:14,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:59:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-20 10:59:15,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:59:15,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-20 10:59:15,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255537460] [2019-11-20 10:59:15,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:59:15,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:59:15,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:59:15,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:59:15,060 INFO L87 Difference]: Start difference. First operand 138830 states and 153929 transitions. Second operand 3 states. [2019-11-20 10:59:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:59:16,420 INFO L93 Difference]: Finished difference Result 276870 states and 307050 transitions. [2019-11-20 10:59:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:59:16,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-11-20 10:59:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:59:16,563 INFO L225 Difference]: With dead ends: 276870 [2019-11-20 10:59:16,563 INFO L226 Difference]: Without dead ends: 138042 [2019-11-20 10:59:16,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:59:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138042 states. [2019-11-20 10:59:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138042 to 134364. [2019-11-20 10:59:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134364 states. [2019-11-20 10:59:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134364 states to 134364 states and 147445 transitions. [2019-11-20 10:59:18,903 INFO L78 Accepts]: Start accepts. Automaton has 134364 states and 147445 transitions. Word has length 312 [2019-11-20 10:59:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:59:18,903 INFO L462 AbstractCegarLoop]: Abstraction has 134364 states and 147445 transitions. [2019-11-20 10:59:18,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:59:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 134364 states and 147445 transitions. [2019-11-20 10:59:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-11-20 10:59:18,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:59:18,937 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 10:59:19,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:59:19,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:59:19,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:59:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash -406259352, now seen corresponding path program 1 times [2019-11-20 10:59:19,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:59:19,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802728132] [2019-11-20 10:59:19,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:59:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-20 10:59:19,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802728132] [2019-11-20 10:59:19,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746783943] [2019-11-20 10:59:19,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/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-11-20 10:59:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:59:19,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:59:19,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:59:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-20 10:59:19,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:59:19,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 10:59:19,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611778681] [2019-11-20 10:59:19,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:59:19,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:59:19,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:59:19,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:59:19,704 INFO L87 Difference]: Start difference. First operand 134364 states and 147445 transitions. Second operand 3 states. [2019-11-20 10:59:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:59:23,927 INFO L93 Difference]: Finished difference Result 308004 states and 339041 transitions. [2019-11-20 10:59:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:59:23,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-11-20 10:59:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:59:23,928 INFO L225 Difference]: With dead ends: 308004 [2019-11-20 10:59:23,928 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:59:23,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:59:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:59:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:59:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:59:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:59:23,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 364 [2019-11-20 10:59:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:59:23,987 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:59:23,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:59:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:59:23,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:59:24,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:59:24,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 10:59:27,785 WARN L191 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 1054 DAG size of output: 383 [2019-11-20 10:59:30,619 WARN L191 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 1054 DAG size of output: 383 [2019-11-20 10:59:34,108 WARN L191 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 383 DAG size of output: 50 [2019-11-20 10:59:37,244 WARN L191 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 383 DAG size of output: 50 [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-20 10:59:37,247 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,248 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,249 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 10:59:37,250 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,251 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,252 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,253 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,253 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,253 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,253 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-20 10:59:37,253 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-20 10:59:37,253 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-20 10:59:37,253 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,254 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-20 10:59:37,255 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,256 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-20 10:59:37,256 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,256 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,256 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 10:59:37,256 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 10:59:37,256 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 10:59:37,256 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 10:59:37,257 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-20 10:59:37,257 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-20 10:59:37,257 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-20 10:59:37,257 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,257 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,257 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,258 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse4 (= ~a27~0 1)) (.cse13 (= ~a16~0 1))) (let ((.cse5 (<= ~a20~0 0)) (.cse11 (and (not .cse4) .cse13)) (.cse9 (not (= 0 ~a3~0))) (.cse8 (<= ~a3~0 0)) (.cse1 (<= ~a11~0 0)) (.cse6 (= 1 ~a6~0)) (.cse0 (= 1 ~a3~0)) (.cse12 (<= ~a6~0 0)) (.cse10 (= ~a12~0 1)) (.cse2 (= ~a5~0 1)) (.cse7 (= ~a11~0 1)) (.cse3 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 .cse5) .cse1 .cse2) (and .cse6 .cse2 .cse7 .cse3) (and .cse8 .cse4 .cse1 .cse2) (and .cse4 .cse2 .cse7) (and .cse9 .cse10 .cse1 .cse2 .cse3) (and .cse10 .cse4 .cse1 .cse2) (and (and .cse0 .cse5) .cse1 .cse2) (and .cse8 .cse10 .cse1 .cse2 .cse11) (and .cse9 .cse12 .cse2 .cse7) (and .cse12 .cse2 .cse7 .cse3 .cse11) (and .cse9 .cse6 .cse1 .cse2) (and .cse10 .cse1 .cse2 .cse0) (and .cse6 .cse1 .cse2 .cse3) (and .cse8 .cse12 .cse10 .cse1 .cse2) (and .cse6 .cse10 .cse7 (and .cse0 .cse2 .cse13)) (and .cse12 (= 1 ~a10~0) .cse10 .cse2 .cse7 .cse3)))) [2019-11-20 10:59:37,258 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,258 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,258 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,258 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-20 10:59:37,258 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-20 10:59:37,259 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,259 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,259 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 10:59:37,259 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1542) no Hoare annotation was computed. [2019-11-20 10:59:37,259 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,259 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-20 10:59:37,259 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,260 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,261 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse4 (= ~a27~0 1)) (.cse13 (= ~a16~0 1))) (let ((.cse5 (<= ~a20~0 0)) (.cse11 (and (not .cse4) .cse13)) (.cse9 (not (= 0 ~a3~0))) (.cse8 (<= ~a3~0 0)) (.cse1 (<= ~a11~0 0)) (.cse6 (= 1 ~a6~0)) (.cse0 (= 1 ~a3~0)) (.cse12 (<= ~a6~0 0)) (.cse10 (= ~a12~0 1)) (.cse2 (= ~a5~0 1)) (.cse7 (= ~a11~0 1)) (.cse3 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 .cse5) .cse1 .cse2) (and .cse6 .cse2 .cse7 .cse3) (and .cse8 .cse4 .cse1 .cse2) (and .cse4 .cse2 .cse7) (and .cse9 .cse10 .cse1 .cse2 .cse3) (and .cse10 .cse4 .cse1 .cse2) (and (and .cse0 .cse5) .cse1 .cse2) (and .cse8 .cse10 .cse1 .cse2 .cse11) (and .cse9 .cse12 .cse2 .cse7) (and .cse12 .cse2 .cse7 .cse3 .cse11) (and .cse9 .cse6 .cse1 .cse2) (and .cse10 .cse1 .cse2 .cse0) (and .cse6 .cse1 .cse2 .cse3) (and .cse8 .cse12 .cse10 .cse1 .cse2) (and .cse6 .cse10 .cse7 (and .cse0 .cse2 .cse13)) (and .cse12 (= 1 ~a10~0) .cse10 .cse2 .cse7 .cse3)))) [2019-11-20 10:59:37,261 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,262 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,263 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,264 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,265 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,266 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-20 10:59:37,267 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-20 10:59:37,267 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-20 10:59:37,267 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,267 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,267 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,267 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,267 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,267 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-20 10:59:37,268 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-20 10:59:37,268 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,268 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,268 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,268 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-20 10:59:37,268 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-20 10:59:37,268 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,269 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-20 10:59:37,269 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,269 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,269 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,269 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,269 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,269 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,270 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-20 10:59:37,271 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,272 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,272 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,272 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,272 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:59:37,272 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,272 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-20 10:59:37,272 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-20 10:59:37,272 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,273 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-20 10:59:37,273 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-20 10:59:37,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:59:37 BoogieIcfgContainer [2019-11-20 10:59:37,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:59:37,322 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:59:37,322 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:59:37,325 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:59:37,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:47" (3/4) ... [2019-11-20 10:59:37,329 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:59:37,370 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 10:59:37,373 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 10:59:37,578 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7340cecc-5e35-4a0a-b912-08c235081184/bin/uautomizer/witness.graphml [2019-11-20 10:59:37,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:59:37,580 INFO L168 Benchmark]: Toolchain (without parser) took 53519.21 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 944.7 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 10:59:37,580 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:59:37,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1079.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -97.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:59:37,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:59:37,581 INFO L168 Benchmark]: Boogie Preprocessor took 92.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:59:37,581 INFO L168 Benchmark]: RCFGBuilder took 2216.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -198.3 MB). Peak memory consumption was 294.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:59:37,582 INFO L168 Benchmark]: TraceAbstraction took 49748.38 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.6 GB). Free memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-20 10:59:37,582 INFO L168 Benchmark]: Witness Printer took 256.53 ms. Allocated memory is still 4.9 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 82.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. [2019-11-20 10:59:37,584 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1079.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -97.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2216.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -198.3 MB). Peak memory consumption was 294.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49748.38 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.6 GB). Free memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 256.53 ms. Allocated memory is still 4.9 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 82.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1542]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == a3 && a11 <= 0) && a5 == 1) && a26 == 1) || (((a27 == 1 && a20 <= 0) && a11 <= 0) && a5 == 1)) || (((1 == a6 && a5 == 1) && a11 == 1) && a26 == 1)) || (((a3 <= 0 && a27 == 1) && a11 <= 0) && a5 == 1)) || ((a27 == 1 && a5 == 1) && a11 == 1)) || ((((!(0 == a3) && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((a12 == 1 && a27 == 1) && a11 <= 0) && a5 == 1)) || (((1 == a3 && a20 <= 0) && a11 <= 0) && a5 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && a5 == 1) && !(a27 == 1) && a16 == 1)) || (((!(0 == a3) && a6 <= 0) && a5 == 1) && a11 == 1)) || ((((a6 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && !(a27 == 1) && a16 == 1)) || (((!(0 == a3) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((a12 == 1 && a11 <= 0) && a5 == 1) && 1 == a3)) || (((1 == a6 && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a6 <= 0) && a12 == 1) && a11 <= 0) && a5 == 1)) || (((1 == a6 && a12 == 1) && a11 == 1) && (1 == a3 && a5 == 1) && a16 == 1)) || (((((a6 <= 0 && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == a3 && a11 <= 0) && a5 == 1) && a26 == 1) || (((a27 == 1 && a20 <= 0) && a11 <= 0) && a5 == 1)) || (((1 == a6 && a5 == 1) && a11 == 1) && a26 == 1)) || (((a3 <= 0 && a27 == 1) && a11 <= 0) && a5 == 1)) || ((a27 == 1 && a5 == 1) && a11 == 1)) || ((((!(0 == a3) && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((a12 == 1 && a27 == 1) && a11 <= 0) && a5 == 1)) || (((1 == a3 && a20 <= 0) && a11 <= 0) && a5 == 1)) || ((((a3 <= 0 && a12 == 1) && a11 <= 0) && a5 == 1) && !(a27 == 1) && a16 == 1)) || (((!(0 == a3) && a6 <= 0) && a5 == 1) && a11 == 1)) || ((((a6 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && !(a27 == 1) && a16 == 1)) || (((!(0 == a3) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((a12 == 1 && a11 <= 0) && a5 == 1) && 1 == a3)) || (((1 == a6 && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a6 <= 0) && a12 == 1) && a11 <= 0) && a5 == 1)) || (((1 == a6 && a12 == 1) && a11 == 1) && (1 == a3 && a5 == 1) && a16 == 1)) || (((((a6 <= 0 && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 49.6s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.0s, HoareTripleCheckerStatistics: 2820 SDtfs, 4930 SDslu, 1073 SDs, 0 SdLazy, 10499 SolverSat, 1911 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 960 GetRequests, 930 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138830occurred 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: 7.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 11330 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1712 NumberOfFragments, 519 HoareAnnotationTreeSize, 3 FomulaSimplifications, 46044 FormulaSimplificationTreeSizeReduction, 6.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 22526 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 4658 NumberOfCodeBlocks, 4658 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4640 ConstructedInterpolants, 0 QuantifiedInterpolants, 2137200 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 2479/2493 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...