./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label44.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_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/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 003d8b9b18d0283d5817b74650d7167df10fa305 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:45:49,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:45:49,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:45:49,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:45:49,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:45:49,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:45:49,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:45:49,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:45:49,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:45:49,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:45:49,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:45:49,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:45:49,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:45:49,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:45:49,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:45:49,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:45:49,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:45:49,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:45:49,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:45:49,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:45:49,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:45:49,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:45:49,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:45:49,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:45:49,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:45:49,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:45:49,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:45:49,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:45:49,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:45:49,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:45:49,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:45:49,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:45:49,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:45:49,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:45:49,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:45:49,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:45:49,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:45:49,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:45:49,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:45:49,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:45:49,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:45:49,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 06:45:49,494 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:45:49,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:45:49,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:45:49,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:45:49,496 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:45:49,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:45:49,497 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:45:49,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:45:49,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:45:49,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:45:49,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:45:49,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:45:49,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:45:49,498 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:45:49,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:45:49,499 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:45:49,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:45:49,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:45:49,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:45:49,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:45:49,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:45:49,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:45:49,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:45:49,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:45:49,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:45:49,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:45:49,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:45:49,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:45:49,501 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_5ed1961d-e549-4ba8-b2d1-76626b4fa592/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 -> 003d8b9b18d0283d5817b74650d7167df10fa305 [2019-11-20 06:45:49,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:45:49,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:45:49,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:45:49,650 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:45:49,652 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:45:49,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2019-11-20 06:45:49,705 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/data/7d2c1bd8a/17cb1558b41648c2b3c89243516ada1b/FLAG56e59f6b7 [2019-11-20 06:45:50,217 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:45:50,218 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2019-11-20 06:45:50,232 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/data/7d2c1bd8a/17cb1558b41648c2b3c89243516ada1b/FLAG56e59f6b7 [2019-11-20 06:45:50,721 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/data/7d2c1bd8a/17cb1558b41648c2b3c89243516ada1b [2019-11-20 06:45:50,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:45:50,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:45:50,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:50,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:45:50,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:45:50,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:50" (1/1) ... [2019-11-20 06:45:50,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3e7417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:50, skipping insertion in model container [2019-11-20 06:45:50,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:50" (1/1) ... [2019-11-20 06:45:50,738 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:45:50,817 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:45:51,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:45:51,447 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:45:51,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:45:51,714 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:45:51,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51 WrapperNode [2019-11-20 06:45:51,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:51,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:45:51,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:45:51,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:45:51,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:45:51,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:45:51,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:45:51,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:45:51,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... [2019-11-20 06:45:51,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:45:51,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:45:51,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:45:51,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:45:51,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/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 06:45:52,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:45:52,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:45:54,250 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:45:54,251 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 06:45:54,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:54 BoogieIcfgContainer [2019-11-20 06:45:54,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:45:54,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:45:54,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:45:54,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:45:54,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:45:50" (1/3) ... [2019-11-20 06:45:54,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49248d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:45:54, skipping insertion in model container [2019-11-20 06:45:54,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:51" (2/3) ... [2019-11-20 06:45:54,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49248d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:45:54, skipping insertion in model container [2019-11-20 06:45:54,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:54" (3/3) ... [2019-11-20 06:45:54,262 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label44.c [2019-11-20 06:45:54,270 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:45:54,278 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 06:45:54,289 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 06:45:54,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:45:54,331 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:45:54,331 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:45:54,331 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:45:54,332 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:45:54,332 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:45:54,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:45:54,333 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:45:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-20 06:45:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 06:45:54,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:54,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:54,381 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:54,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:54,386 INFO L82 PathProgramCache]: Analyzing trace with hash 302925243, now seen corresponding path program 1 times [2019-11-20 06:45:54,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:54,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871431241] [2019-11-20 06:45:54,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:55,096 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 06:45:55,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871431241] [2019-11-20 06:45:55,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:55,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:45:55,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93414955] [2019-11-20 06:45:55,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:55,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:55,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:55,120 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-20 06:45:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:57,404 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-11-20 06:45:57,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:57,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-20 06:45:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:57,433 INFO L225 Difference]: With dead ends: 1068 [2019-11-20 06:45:57,433 INFO L226 Difference]: Without dead ends: 670 [2019-11-20 06:45:57,441 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 06:45:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-20 06:45:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-11-20 06:45:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-11-20 06:45:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-11-20 06:45:57,531 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 177 [2019-11-20 06:45:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:57,534 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-11-20 06:45:57,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-11-20 06:45:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 06:45:57,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:57,548 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:57,549 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2005485845, now seen corresponding path program 1 times [2019-11-20 06:45:57,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:57,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335043348] [2019-11-20 06:45:57,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:45:57,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335043348] [2019-11-20 06:45:57,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:57,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:45:57,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513777591] [2019-11-20 06:45:57,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:45:57,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:45:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:45:57,680 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-11-20 06:45:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:45:59,489 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-11-20 06:45:59,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:45:59,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-20 06:45:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:45:59,500 INFO L225 Difference]: With dead ends: 1762 [2019-11-20 06:45:59,500 INFO L226 Difference]: Without dead ends: 1308 [2019-11-20 06:45:59,502 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 06:45:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-20 06:45:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-11-20 06:45:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-20 06:45:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-11-20 06:45:59,547 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 182 [2019-11-20 06:45:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:45:59,547 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-11-20 06:45:59,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:45:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-11-20 06:45:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 06:45:59,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:45:59,551 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:45:59,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:45:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:45:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash -23446020, now seen corresponding path program 1 times [2019-11-20 06:45:59,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:45:59,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827988309] [2019-11-20 06:45:59,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:45:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:45:59,653 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 06:45:59,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827988309] [2019-11-20 06:45:59,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:45:59,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:45:59,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595761069] [2019-11-20 06:45:59,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:45:59,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:45:59,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:45:59,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:45:59,656 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-11-20 06:46:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:00,815 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-11-20 06:46:00,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:00,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-20 06:46:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:00,827 INFO L225 Difference]: With dead ends: 2567 [2019-11-20 06:46:00,827 INFO L226 Difference]: Without dead ends: 1700 [2019-11-20 06:46:00,829 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 06:46:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-20 06:46:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-11-20 06:46:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-20 06:46:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2435 transitions. [2019-11-20 06:46:00,872 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2435 transitions. Word has length 185 [2019-11-20 06:46:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:00,872 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2435 transitions. [2019-11-20 06:46:00,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2435 transitions. [2019-11-20 06:46:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 06:46:00,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:00,885 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:00,885 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:00,886 INFO L82 PathProgramCache]: Analyzing trace with hash 372513201, now seen corresponding path program 1 times [2019-11-20 06:46:00,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:00,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671960548] [2019-11-20 06:46:00,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 06:46:01,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671960548] [2019-11-20 06:46:01,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:01,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:01,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668118660] [2019-11-20 06:46:01,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:01,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:01,122 INFO L87 Difference]: Start difference. First operand 1683 states and 2435 transitions. Second operand 3 states. [2019-11-20 06:46:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:02,243 INFO L93 Difference]: Finished difference Result 5005 states and 7260 transitions. [2019-11-20 06:46:02,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:02,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-20 06:46:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:02,268 INFO L225 Difference]: With dead ends: 5005 [2019-11-20 06:46:02,269 INFO L226 Difference]: Without dead ends: 3324 [2019-11-20 06:46:02,271 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 06:46:02,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2019-11-20 06:46:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 3307. [2019-11-20 06:46:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3307 states. [2019-11-20 06:46:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 4678 transitions. [2019-11-20 06:46:02,364 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 4678 transitions. Word has length 192 [2019-11-20 06:46:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:02,365 INFO L462 AbstractCegarLoop]: Abstraction has 3307 states and 4678 transitions. [2019-11-20 06:46:02,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4678 transitions. [2019-11-20 06:46:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-20 06:46:02,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:02,373 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:02,373 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:02,374 INFO L82 PathProgramCache]: Analyzing trace with hash 962558153, now seen corresponding path program 1 times [2019-11-20 06:46:02,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:02,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514109410] [2019-11-20 06:46:02,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:02,550 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 06:46:02,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514109410] [2019-11-20 06:46:02,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:02,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:46:02,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848273482] [2019-11-20 06:46:02,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:02,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:02,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:02,552 INFO L87 Difference]: Start difference. First operand 3307 states and 4678 transitions. Second operand 3 states. [2019-11-20 06:46:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:02,983 INFO L93 Difference]: Finished difference Result 6585 states and 9318 transitions. [2019-11-20 06:46:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:02,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-20 06:46:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:03,000 INFO L225 Difference]: With dead ends: 6585 [2019-11-20 06:46:03,000 INFO L226 Difference]: Without dead ends: 3280 [2019-11-20 06:46:03,003 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 06:46:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2019-11-20 06:46:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 3280. [2019-11-20 06:46:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3280 states. [2019-11-20 06:46:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 4514 transitions. [2019-11-20 06:46:03,068 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 4514 transitions. Word has length 205 [2019-11-20 06:46:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:03,069 INFO L462 AbstractCegarLoop]: Abstraction has 3280 states and 4514 transitions. [2019-11-20 06:46:03,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 4514 transitions. [2019-11-20 06:46:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-20 06:46:03,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:03,076 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:03,076 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:03,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash -338235124, now seen corresponding path program 1 times [2019-11-20 06:46:03,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:03,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206308824] [2019-11-20 06:46:03,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:03,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206308824] [2019-11-20 06:46:03,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:03,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:46:03,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064464042] [2019-11-20 06:46:03,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:03,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:03,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:03,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:03,197 INFO L87 Difference]: Start difference. First operand 3280 states and 4514 transitions. Second operand 3 states. [2019-11-20 06:46:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:04,133 INFO L93 Difference]: Finished difference Result 7992 states and 10933 transitions. [2019-11-20 06:46:04,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:04,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-20 06:46:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:04,158 INFO L225 Difference]: With dead ends: 7992 [2019-11-20 06:46:04,158 INFO L226 Difference]: Without dead ends: 4714 [2019-11-20 06:46:04,162 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 06:46:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2019-11-20 06:46:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 4713. [2019-11-20 06:46:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4713 states. [2019-11-20 06:46:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 6371 transitions. [2019-11-20 06:46:04,250 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 6371 transitions. Word has length 218 [2019-11-20 06:46:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:04,251 INFO L462 AbstractCegarLoop]: Abstraction has 4713 states and 6371 transitions. [2019-11-20 06:46:04,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 6371 transitions. [2019-11-20 06:46:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-20 06:46:04,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:04,261 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:04,261 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:04,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1335500791, now seen corresponding path program 1 times [2019-11-20 06:46:04,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:04,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67320400] [2019-11-20 06:46:04,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:04,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67320400] [2019-11-20 06:46:04,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685794242] [2019-11-20 06:46:04,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/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 06:46:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:04,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 06:46:04,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 06:46:04,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:46:04,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 06:46:04,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413211884] [2019-11-20 06:46:04,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:04,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:04,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:04,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:04,839 INFO L87 Difference]: Start difference. First operand 4713 states and 6371 transitions. Second operand 3 states. [2019-11-20 06:46:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:05,619 INFO L93 Difference]: Finished difference Result 12878 states and 17336 transitions. [2019-11-20 06:46:05,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:05,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-20 06:46:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:05,653 INFO L225 Difference]: With dead ends: 12878 [2019-11-20 06:46:05,653 INFO L226 Difference]: Without dead ends: 8167 [2019-11-20 06:46:05,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2019-11-20 06:46:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8164. [2019-11-20 06:46:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-11-20 06:46:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 10429 transitions. [2019-11-20 06:46:05,802 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 10429 transitions. Word has length 225 [2019-11-20 06:46:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:05,803 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 10429 transitions. [2019-11-20 06:46:05,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 10429 transitions. [2019-11-20 06:46:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 06:46:05,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:05,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:06,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:06,024 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1624570458, now seen corresponding path program 1 times [2019-11-20 06:46:06,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:06,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959281604] [2019-11-20 06:46:06,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 06:46:06,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959281604] [2019-11-20 06:46:06,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:06,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:06,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779175759] [2019-11-20 06:46:06,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:06,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:06,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:06,158 INFO L87 Difference]: Start difference. First operand 8164 states and 10429 transitions. Second operand 3 states. [2019-11-20 06:46:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:07,336 INFO L93 Difference]: Finished difference Result 16331 states and 20865 transitions. [2019-11-20 06:46:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:07,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-20 06:46:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:07,369 INFO L225 Difference]: With dead ends: 16331 [2019-11-20 06:46:07,369 INFO L226 Difference]: Without dead ends: 8169 [2019-11-20 06:46:07,377 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 06:46:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8169 states. [2019-11-20 06:46:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8169 to 8164. [2019-11-20 06:46:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-11-20 06:46:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 10164 transitions. [2019-11-20 06:46:07,511 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 10164 transitions. Word has length 226 [2019-11-20 06:46:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:07,511 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 10164 transitions. [2019-11-20 06:46:07,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 10164 transitions. [2019-11-20 06:46:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 06:46:07,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:07,532 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:07,532 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 587520109, now seen corresponding path program 1 times [2019-11-20 06:46:07,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:07,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626549463] [2019-11-20 06:46:07,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 06:46:07,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626549463] [2019-11-20 06:46:07,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:07,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:07,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306182539] [2019-11-20 06:46:07,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:07,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:07,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:07,647 INFO L87 Difference]: Start difference. First operand 8164 states and 10164 transitions. Second operand 4 states. [2019-11-20 06:46:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:08,763 INFO L93 Difference]: Finished difference Result 16329 states and 20331 transitions. [2019-11-20 06:46:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:08,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-11-20 06:46:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:08,781 INFO L225 Difference]: With dead ends: 16329 [2019-11-20 06:46:08,781 INFO L226 Difference]: Without dead ends: 8167 [2019-11-20 06:46:08,790 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 06:46:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2019-11-20 06:46:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8164. [2019-11-20 06:46:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-11-20 06:46:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 9877 transitions. [2019-11-20 06:46:08,909 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 9877 transitions. Word has length 226 [2019-11-20 06:46:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:08,909 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 9877 transitions. [2019-11-20 06:46:08,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 9877 transitions. [2019-11-20 06:46:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 06:46:08,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:08,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:08,926 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1006401140, now seen corresponding path program 1 times [2019-11-20 06:46:08,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:08,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348631076] [2019-11-20 06:46:08,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 06:46:09,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348631076] [2019-11-20 06:46:09,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:09,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:09,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591743533] [2019-11-20 06:46:09,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:09,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:09,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:09,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:09,027 INFO L87 Difference]: Start difference. First operand 8164 states and 9877 transitions. Second operand 3 states. [2019-11-20 06:46:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:10,244 INFO L93 Difference]: Finished difference Result 21810 states and 26334 transitions. [2019-11-20 06:46:10,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:10,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-20 06:46:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:10,271 INFO L225 Difference]: With dead ends: 21810 [2019-11-20 06:46:10,272 INFO L226 Difference]: Without dead ends: 13648 [2019-11-20 06:46:10,279 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 06:46:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13648 states. [2019-11-20 06:46:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13648 to 13239. [2019-11-20 06:46:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13239 states. [2019-11-20 06:46:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13239 states to 13239 states and 15073 transitions. [2019-11-20 06:46:10,460 INFO L78 Accepts]: Start accepts. Automaton has 13239 states and 15073 transitions. Word has length 232 [2019-11-20 06:46:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:10,460 INFO L462 AbstractCegarLoop]: Abstraction has 13239 states and 15073 transitions. [2019-11-20 06:46:10,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 13239 states and 15073 transitions. [2019-11-20 06:46:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 06:46:10,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:10,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:10,483 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash 781312374, now seen corresponding path program 1 times [2019-11-20 06:46:10,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:10,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534224865] [2019-11-20 06:46:10,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:10,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534224865] [2019-11-20 06:46:10,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:10,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:10,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341575630] [2019-11-20 06:46:10,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:10,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:10,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:10,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:10,656 INFO L87 Difference]: Start difference. First operand 13239 states and 15073 transitions. Second operand 4 states. [2019-11-20 06:46:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:12,177 INFO L93 Difference]: Finished difference Result 30336 states and 34762 transitions. [2019-11-20 06:46:12,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:46:12,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-20 06:46:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:12,204 INFO L225 Difference]: With dead ends: 30336 [2019-11-20 06:46:12,204 INFO L226 Difference]: Without dead ends: 17099 [2019-11-20 06:46:12,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17099 states. [2019-11-20 06:46:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17099 to 16893. [2019-11-20 06:46:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16893 states. [2019-11-20 06:46:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16893 states to 16893 states and 18718 transitions. [2019-11-20 06:46:12,460 INFO L78 Accepts]: Start accepts. Automaton has 16893 states and 18718 transitions. Word has length 232 [2019-11-20 06:46:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:12,461 INFO L462 AbstractCegarLoop]: Abstraction has 16893 states and 18718 transitions. [2019-11-20 06:46:12,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 16893 states and 18718 transitions. [2019-11-20 06:46:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-20 06:46:12,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:12,491 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:46:12,491 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 211469247, now seen corresponding path program 1 times [2019-11-20 06:46:12,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:12,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599739245] [2019-11-20 06:46:12,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 06:46:12,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599739245] [2019-11-20 06:46:12,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:12,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:12,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783803883] [2019-11-20 06:46:12,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:12,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:12,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:12,715 INFO L87 Difference]: Start difference. First operand 16893 states and 18718 transitions. Second operand 4 states. [2019-11-20 06:46:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:14,041 INFO L93 Difference]: Finished difference Result 33795 states and 37455 transitions. [2019-11-20 06:46:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:14,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-11-20 06:46:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:14,054 INFO L225 Difference]: With dead ends: 33795 [2019-11-20 06:46:14,054 INFO L226 Difference]: Without dead ends: 16904 [2019-11-20 06:46:14,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16904 states. [2019-11-20 06:46:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16904 to 16893. [2019-11-20 06:46:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16893 states. [2019-11-20 06:46:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16893 states to 16893 states and 18680 transitions. [2019-11-20 06:46:14,242 INFO L78 Accepts]: Start accepts. Automaton has 16893 states and 18680 transitions. Word has length 286 [2019-11-20 06:46:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:14,243 INFO L462 AbstractCegarLoop]: Abstraction has 16893 states and 18680 transitions. [2019-11-20 06:46:14,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 16893 states and 18680 transitions. [2019-11-20 06:46:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-20 06:46:14,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:14,267 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:46:14,267 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1573273311, now seen corresponding path program 1 times [2019-11-20 06:46:14,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:14,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949712147] [2019-11-20 06:46:14,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-20 06:46:14,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949712147] [2019-11-20 06:46:14,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:14,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:46:14,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706625791] [2019-11-20 06:46:14,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:14,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:14,479 INFO L87 Difference]: Start difference. First operand 16893 states and 18680 transitions. Second operand 3 states. [2019-11-20 06:46:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:15,160 INFO L93 Difference]: Finished difference Result 33782 states and 37356 transitions. [2019-11-20 06:46:15,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:15,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-11-20 06:46:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:15,182 INFO L225 Difference]: With dead ends: 33782 [2019-11-20 06:46:15,182 INFO L226 Difference]: Without dead ends: 16891 [2019-11-20 06:46:15,191 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 06:46:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16891 states. [2019-11-20 06:46:15,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16891 to 16891. [2019-11-20 06:46:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16891 states. [2019-11-20 06:46:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16891 states to 16891 states and 18676 transitions. [2019-11-20 06:46:15,379 INFO L78 Accepts]: Start accepts. Automaton has 16891 states and 18676 transitions. Word has length 313 [2019-11-20 06:46:15,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:15,380 INFO L462 AbstractCegarLoop]: Abstraction has 16891 states and 18676 transitions. [2019-11-20 06:46:15,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 16891 states and 18676 transitions. [2019-11-20 06:46:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-20 06:46:15,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:15,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:15,397 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash -476839199, now seen corresponding path program 1 times [2019-11-20 06:46:15,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:15,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820067429] [2019-11-20 06:46:15,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-20 06:46:15,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820067429] [2019-11-20 06:46:15,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383689916] [2019-11-20 06:46:15,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/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 06:46:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:15,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:46:15,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-20 06:46:16,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:46:16,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 06:46:16,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145320789] [2019-11-20 06:46:16,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:16,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:16,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:46:16,160 INFO L87 Difference]: Start difference. First operand 16891 states and 18676 transitions. Second operand 3 states. [2019-11-20 06:46:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:17,526 INFO L93 Difference]: Finished difference Result 33580 states and 37144 transitions. [2019-11-20 06:46:17,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:17,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-11-20 06:46:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:17,553 INFO L225 Difference]: With dead ends: 33580 [2019-11-20 06:46:17,554 INFO L226 Difference]: Without dead ends: 16691 [2019-11-20 06:46:17,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 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 06:46:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16691 states. [2019-11-20 06:46:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16691 to 16079. [2019-11-20 06:46:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16079 states. [2019-11-20 06:46:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16079 states to 16079 states and 17679 transitions. [2019-11-20 06:46:17,846 INFO L78 Accepts]: Start accepts. Automaton has 16079 states and 17679 transitions. Word has length 319 [2019-11-20 06:46:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:17,847 INFO L462 AbstractCegarLoop]: Abstraction has 16079 states and 17679 transitions. [2019-11-20 06:46:17,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16079 states and 17679 transitions. [2019-11-20 06:46:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-11-20 06:46:17,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:17,870 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:18,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:18,083 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash 738662, now seen corresponding path program 1 times [2019-11-20 06:46:18,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:18,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193805264] [2019-11-20 06:46:18,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:46:18,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193805264] [2019-11-20 06:46:18,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180102034] [2019-11-20 06:46:18,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/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 06:46:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:18,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 06:46:18,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:46:18,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:46:18,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 06:46:18,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481720941] [2019-11-20 06:46:18,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:18,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:18,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:18,785 INFO L87 Difference]: Start difference. First operand 16079 states and 17679 transitions. Second operand 4 states. [2019-11-20 06:46:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:20,381 INFO L93 Difference]: Finished difference Result 48830 states and 53690 transitions. [2019-11-20 06:46:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:46:20,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-11-20 06:46:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:20,432 INFO L225 Difference]: With dead ends: 48830 [2019-11-20 06:46:20,433 INFO L226 Difference]: Without dead ends: 32753 [2019-11-20 06:46:20,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32753 states. [2019-11-20 06:46:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32753 to 32749. [2019-11-20 06:46:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32749 states. [2019-11-20 06:46:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32749 states to 32749 states and 35966 transitions. [2019-11-20 06:46:20,909 INFO L78 Accepts]: Start accepts. Automaton has 32749 states and 35966 transitions. Word has length 361 [2019-11-20 06:46:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:20,910 INFO L462 AbstractCegarLoop]: Abstraction has 32749 states and 35966 transitions. [2019-11-20 06:46:20,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 32749 states and 35966 transitions. [2019-11-20 06:46:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-11-20 06:46:20,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:20,933 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:21,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:21,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1903494745, now seen corresponding path program 1 times [2019-11-20 06:46:21,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:21,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606820653] [2019-11-20 06:46:21,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:46:21,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606820653] [2019-11-20 06:46:21,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:21,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:46:21,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731934666] [2019-11-20 06:46:21,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:21,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:21,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:21,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:21,442 INFO L87 Difference]: Start difference. First operand 32749 states and 35966 transitions. Second operand 5 states. [2019-11-20 06:46:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:23,493 INFO L93 Difference]: Finished difference Result 90940 states and 100098 transitions. [2019-11-20 06:46:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:23,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 364 [2019-11-20 06:46:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:23,565 INFO L225 Difference]: With dead ends: 90940 [2019-11-20 06:46:23,565 INFO L226 Difference]: Without dead ends: 58193 [2019-11-20 06:46:23,587 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 06:46:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58193 states. [2019-11-20 06:46:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58193 to 56346. [2019-11-20 06:46:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56346 states. [2019-11-20 06:46:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56346 states to 56346 states and 61942 transitions. [2019-11-20 06:46:24,463 INFO L78 Accepts]: Start accepts. Automaton has 56346 states and 61942 transitions. Word has length 364 [2019-11-20 06:46:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:24,463 INFO L462 AbstractCegarLoop]: Abstraction has 56346 states and 61942 transitions. [2019-11-20 06:46:24,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 56346 states and 61942 transitions. [2019-11-20 06:46:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-20 06:46:24,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:24,493 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:24,493 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash 296271038, now seen corresponding path program 1 times [2019-11-20 06:46:24,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:24,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710616147] [2019-11-20 06:46:24,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:25,066 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-20 06:46:25,186 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-11-20 06:46:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 190 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:25,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710616147] [2019-11-20 06:46:25,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31616478] [2019-11-20 06:46:25,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:25,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 06:46:25,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 06:46:26,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:46:26,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-20 06:46:26,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544285924] [2019-11-20 06:46:26,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:26,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:26,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:46:26,178 INFO L87 Difference]: Start difference. First operand 56346 states and 61942 transitions. Second operand 4 states. [2019-11-20 06:46:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:28,096 INFO L93 Difference]: Finished difference Result 117999 states and 129821 transitions. [2019-11-20 06:46:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:46:28,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 366 [2019-11-20 06:46:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:28,161 INFO L225 Difference]: With dead ends: 117999 [2019-11-20 06:46:28,161 INFO L226 Difference]: Without dead ends: 61655 [2019-11-20 06:46:28,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:46:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61655 states. [2019-11-20 06:46:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61655 to 59996. [2019-11-20 06:46:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59996 states. [2019-11-20 06:46:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59996 states to 59996 states and 64829 transitions. [2019-11-20 06:46:28,821 INFO L78 Accepts]: Start accepts. Automaton has 59996 states and 64829 transitions. Word has length 366 [2019-11-20 06:46:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:28,822 INFO L462 AbstractCegarLoop]: Abstraction has 59996 states and 64829 transitions. [2019-11-20 06:46:28,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 59996 states and 64829 transitions. [2019-11-20 06:46:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-20 06:46:28,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:28,855 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:29,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:29,060 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:29,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:29,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2131780047, now seen corresponding path program 1 times [2019-11-20 06:46:29,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:29,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266121133] [2019-11-20 06:46:29,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:46:29,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266121133] [2019-11-20 06:46:29,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:29,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:46:29,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537333912] [2019-11-20 06:46:29,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:29,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:29,354 INFO L87 Difference]: Start difference. First operand 59996 states and 64829 transitions. Second operand 4 states. [2019-11-20 06:46:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:30,786 INFO L93 Difference]: Finished difference Result 120811 states and 130534 transitions. [2019-11-20 06:46:30,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:46:30,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-11-20 06:46:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:30,842 INFO L225 Difference]: With dead ends: 120811 [2019-11-20 06:46:30,842 INFO L226 Difference]: Without dead ends: 60817 [2019-11-20 06:46:30,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60817 states. [2019-11-20 06:46:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60817 to 60402. [2019-11-20 06:46:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60402 states. [2019-11-20 06:46:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60402 states to 60402 states and 65126 transitions. [2019-11-20 06:46:31,930 INFO L78 Accepts]: Start accepts. Automaton has 60402 states and 65126 transitions. Word has length 393 [2019-11-20 06:46:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:31,930 INFO L462 AbstractCegarLoop]: Abstraction has 60402 states and 65126 transitions. [2019-11-20 06:46:31,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 60402 states and 65126 transitions. [2019-11-20 06:46:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-11-20 06:46:31,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:31,955 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:46:31,955 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1185805506, now seen corresponding path program 1 times [2019-11-20 06:46:31,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:31,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874610946] [2019-11-20 06:46:31,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-11-20 06:46:32,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874610946] [2019-11-20 06:46:32,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:32,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:32,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175412856] [2019-11-20 06:46:32,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:32,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:32,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:32,187 INFO L87 Difference]: Start difference. First operand 60402 states and 65126 transitions. Second operand 4 states. [2019-11-20 06:46:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:33,506 INFO L93 Difference]: Finished difference Result 174240 states and 187140 transitions. [2019-11-20 06:46:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:46:33,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2019-11-20 06:46:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:33,614 INFO L225 Difference]: With dead ends: 174240 [2019-11-20 06:46:33,614 INFO L226 Difference]: Without dead ends: 113840 [2019-11-20 06:46:33,641 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 06:46:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113840 states. [2019-11-20 06:46:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113840 to 110991. [2019-11-20 06:46:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110991 states. [2019-11-20 06:46:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110991 states to 110991 states and 119044 transitions. [2019-11-20 06:46:34,854 INFO L78 Accepts]: Start accepts. Automaton has 110991 states and 119044 transitions. Word has length 398 [2019-11-20 06:46:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:34,854 INFO L462 AbstractCegarLoop]: Abstraction has 110991 states and 119044 transitions. [2019-11-20 06:46:34,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 110991 states and 119044 transitions. [2019-11-20 06:46:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-11-20 06:46:34,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:34,896 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:46:34,897 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1884846633, now seen corresponding path program 1 times [2019-11-20 06:46:34,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:34,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987477502] [2019-11-20 06:46:34,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-11-20 06:46:35,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987477502] [2019-11-20 06:46:35,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:35,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:35,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530819709] [2019-11-20 06:46:35,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:35,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:35,957 INFO L87 Difference]: Start difference. First operand 110991 states and 119044 transitions. Second operand 4 states. [2019-11-20 06:46:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:37,494 INFO L93 Difference]: Finished difference Result 395001 states and 423842 transitions. [2019-11-20 06:46:37,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:46:37,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 400 [2019-11-20 06:46:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:37,775 INFO L225 Difference]: With dead ends: 395001 [2019-11-20 06:46:37,775 INFO L226 Difference]: Without dead ends: 284215 [2019-11-20 06:46:37,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284215 states. [2019-11-20 06:46:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284215 to 180540. [2019-11-20 06:46:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180540 states. [2019-11-20 06:46:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180540 states to 180540 states and 193677 transitions. [2019-11-20 06:46:41,081 INFO L78 Accepts]: Start accepts. Automaton has 180540 states and 193677 transitions. Word has length 400 [2019-11-20 06:46:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:41,082 INFO L462 AbstractCegarLoop]: Abstraction has 180540 states and 193677 transitions. [2019-11-20 06:46:41,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 180540 states and 193677 transitions. [2019-11-20 06:46:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-11-20 06:46:41,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:41,115 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:46:41,115 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash -792061351, now seen corresponding path program 1 times [2019-11-20 06:46:41,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:41,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201677966] [2019-11-20 06:46:41,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-20 06:46:41,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201677966] [2019-11-20 06:46:41,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:41,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:46:41,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795152987] [2019-11-20 06:46:41,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:41,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:41,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:41,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:41,522 INFO L87 Difference]: Start difference. First operand 180540 states and 193677 transitions. Second operand 5 states. [2019-11-20 06:46:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:43,897 INFO L93 Difference]: Finished difference Result 382430 states and 409891 transitions. [2019-11-20 06:46:43,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:43,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 400 [2019-11-20 06:46:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:44,115 INFO L225 Difference]: With dead ends: 382430 [2019-11-20 06:46:44,115 INFO L226 Difference]: Without dead ends: 202095 [2019-11-20 06:46:44,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202095 states. [2019-11-20 06:46:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202095 to 188071. [2019-11-20 06:46:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188071 states. [2019-11-20 06:46:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188071 states to 188071 states and 201564 transitions. [2019-11-20 06:46:52,123 INFO L78 Accepts]: Start accepts. Automaton has 188071 states and 201564 transitions. Word has length 400 [2019-11-20 06:46:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:52,123 INFO L462 AbstractCegarLoop]: Abstraction has 188071 states and 201564 transitions. [2019-11-20 06:46:52,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 188071 states and 201564 transitions. [2019-11-20 06:46:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-11-20 06:46:52,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:52,158 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:46:52,159 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:52,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1777016498, now seen corresponding path program 1 times [2019-11-20 06:46:52,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:52,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876043594] [2019-11-20 06:46:52,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 262 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:53,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876043594] [2019-11-20 06:46:53,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897139797] [2019-11-20 06:46:53,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:53,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 06:46:53,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-20 06:46:53,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:46:53,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-11-20 06:46:53,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091648805] [2019-11-20 06:46:53,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:53,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-20 06:46:53,897 INFO L87 Difference]: Start difference. First operand 188071 states and 201564 transitions. Second operand 4 states. [2019-11-20 06:46:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:56,142 INFO L93 Difference]: Finished difference Result 382447 states and 409567 transitions. [2019-11-20 06:46:56,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:46:56,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 415 [2019-11-20 06:46:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:56,337 INFO L225 Difference]: With dead ends: 382447 [2019-11-20 06:46:56,337 INFO L226 Difference]: Without dead ends: 194378 [2019-11-20 06:46:56,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-20 06:46:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194378 states. [2019-11-20 06:46:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194378 to 175891. [2019-11-20 06:46:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175891 states. [2019-11-20 06:46:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175891 states to 175891 states and 188982 transitions. [2019-11-20 06:46:58,402 INFO L78 Accepts]: Start accepts. Automaton has 175891 states and 188982 transitions. Word has length 415 [2019-11-20 06:46:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:58,403 INFO L462 AbstractCegarLoop]: Abstraction has 175891 states and 188982 transitions. [2019-11-20 06:46:58,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 175891 states and 188982 transitions. [2019-11-20 06:46:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-20 06:46:58,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:58,437 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:46:58,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:58,640 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1842609697, now seen corresponding path program 1 times [2019-11-20 06:46:58,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:58,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529455561] [2019-11-20 06:46:58,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 251 proven. 8 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:46:59,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529455561] [2019-11-20 06:46:59,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211596978] [2019-11-20 06:46:59,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:59,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:46:59,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 06:46:59,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:46:59,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 06:46:59,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940840121] [2019-11-20 06:46:59,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:59,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:46:59,471 INFO L87 Difference]: Start difference. First operand 175891 states and 188982 transitions. Second operand 4 states. [2019-11-20 06:47:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:01,826 INFO L93 Difference]: Finished difference Result 351785 states and 377967 transitions. [2019-11-20 06:47:01,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:47:01,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2019-11-20 06:47:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:01,996 INFO L225 Difference]: With dead ends: 351785 [2019-11-20 06:47:01,996 INFO L226 Difference]: Without dead ends: 175896 [2019-11-20 06:47:02,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:47:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175896 states. [2019-11-20 06:47:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175896 to 175891. [2019-11-20 06:47:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175891 states. [2019-11-20 06:47:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175891 states to 175891 states and 188154 transitions. [2019-11-20 06:47:03,901 INFO L78 Accepts]: Start accepts. Automaton has 175891 states and 188154 transitions. Word has length 419 [2019-11-20 06:47:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:03,902 INFO L462 AbstractCegarLoop]: Abstraction has 175891 states and 188154 transitions. [2019-11-20 06:47:03,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:47:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 175891 states and 188154 transitions. [2019-11-20 06:47:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-20 06:47:03,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:47:03,934 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 06:47:04,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:47:04,135 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:47:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:47:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash -87735325, now seen corresponding path program 1 times [2019-11-20 06:47:04,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:47:04,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806282532] [2019-11-20 06:47:04,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:47:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-11-20 06:47:04,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806282532] [2019-11-20 06:47:04,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:47:04,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:47:04,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692937096] [2019-11-20 06:47:04,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:47:04,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:47:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:47:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:47:04,460 INFO L87 Difference]: Start difference. First operand 175891 states and 188154 transitions. Second operand 3 states. [2019-11-20 06:47:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:05,764 INFO L93 Difference]: Finished difference Result 401820 states and 429533 transitions. [2019-11-20 06:47:05,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:47:05,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-11-20 06:47:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:05,997 INFO L225 Difference]: With dead ends: 401820 [2019-11-20 06:47:05,997 INFO L226 Difference]: Without dead ends: 225931 [2019-11-20 06:47:06,820 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 06:47:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225931 states. [2019-11-20 06:47:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225931 to 225931. [2019-11-20 06:47:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225931 states. [2019-11-20 06:47:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225931 states to 225931 states and 241286 transitions. [2019-11-20 06:47:09,377 INFO L78 Accepts]: Start accepts. Automaton has 225931 states and 241286 transitions. Word has length 421 [2019-11-20 06:47:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:09,377 INFO L462 AbstractCegarLoop]: Abstraction has 225931 states and 241286 transitions. [2019-11-20 06:47:09,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:47:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 225931 states and 241286 transitions. [2019-11-20 06:47:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-20 06:47:09,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:47:09,410 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:47:09,410 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:47:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:47:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 866542192, now seen corresponding path program 1 times [2019-11-20 06:47:09,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:47:09,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337606304] [2019-11-20 06:47:09,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:47:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-11-20 06:47:09,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337606304] [2019-11-20 06:47:09,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:47:09,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:47:09,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785536842] [2019-11-20 06:47:09,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:47:09,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:47:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:47:09,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:47:09,740 INFO L87 Difference]: Start difference. First operand 225931 states and 241286 transitions. Second operand 4 states. [2019-11-20 06:47:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:12,672 INFO L93 Difference]: Finished difference Result 451050 states and 481735 transitions. [2019-11-20 06:47:12,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:47:12,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-11-20 06:47:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:12,909 INFO L225 Difference]: With dead ends: 451050 [2019-11-20 06:47:12,909 INFO L226 Difference]: Without dead ends: 225121 [2019-11-20 06:47:12,960 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 06:47:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225121 states. [2019-11-20 06:47:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225121 to 225119. [2019-11-20 06:47:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225119 states. [2019-11-20 06:47:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225119 states to 225119 states and 240368 transitions. [2019-11-20 06:47:15,428 INFO L78 Accepts]: Start accepts. Automaton has 225119 states and 240368 transitions. Word has length 441 [2019-11-20 06:47:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:15,428 INFO L462 AbstractCegarLoop]: Abstraction has 225119 states and 240368 transitions. [2019-11-20 06:47:15,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:47:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 225119 states and 240368 transitions. [2019-11-20 06:47:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-20 06:47:15,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:47:15,464 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:47:15,464 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:47:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:47:15,464 INFO L82 PathProgramCache]: Analyzing trace with hash 830855433, now seen corresponding path program 1 times [2019-11-20 06:47:15,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:47:15,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925870422] [2019-11-20 06:47:15,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:47:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-20 06:47:15,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925870422] [2019-11-20 06:47:15,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:47:15,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:47:15,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58912008] [2019-11-20 06:47:15,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:47:15,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:47:15,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:47:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:47:15,800 INFO L87 Difference]: Start difference. First operand 225119 states and 240368 transitions. Second operand 5 states. [2019-11-20 06:47:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:19,273 INFO L93 Difference]: Finished difference Result 565497 states and 602551 transitions. [2019-11-20 06:47:19,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:47:19,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 469 [2019-11-20 06:47:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:19,623 INFO L225 Difference]: With dead ends: 565497 [2019-11-20 06:47:19,623 INFO L226 Difference]: Without dead ends: 340380 [2019-11-20 06:47:19,708 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 06:47:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340380 states. [2019-11-20 06:47:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340380 to 317003. [2019-11-20 06:47:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317003 states. [2019-11-20 06:47:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317003 states to 317003 states and 338013 transitions. [2019-11-20 06:47:24,836 INFO L78 Accepts]: Start accepts. Automaton has 317003 states and 338013 transitions. Word has length 469 [2019-11-20 06:47:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:24,836 INFO L462 AbstractCegarLoop]: Abstraction has 317003 states and 338013 transitions. [2019-11-20 06:47:24,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:47:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 317003 states and 338013 transitions. [2019-11-20 06:47:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-11-20 06:47:24,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:47:24,878 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:47:24,878 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:47:24,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:47:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash 777925708, now seen corresponding path program 1 times [2019-11-20 06:47:24,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:47:24,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743803645] [2019-11-20 06:47:24,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:47:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 308 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:47:25,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743803645] [2019-11-20 06:47:25,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573922729] [2019-11-20 06:47:25,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:47:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:25,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:47:25,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:47:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 06:47:25,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:47:25,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 06:47:25,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057845466] [2019-11-20 06:47:25,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:47:25,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:47:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:47:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:47:25,977 INFO L87 Difference]: Start difference. First operand 317003 states and 338013 transitions. Second operand 4 states. [2019-11-20 06:47:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:28,733 INFO L93 Difference]: Finished difference Result 613865 states and 654416 transitions. [2019-11-20 06:47:28,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:47:28,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 472 [2019-11-20 06:47:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:29,042 INFO L225 Difference]: With dead ends: 613865 [2019-11-20 06:47:29,042 INFO L226 Difference]: Without dead ends: 296864 [2019-11-20 06:47:29,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:47:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296864 states. [2019-11-20 06:47:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296864 to 256644. [2019-11-20 06:47:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256644 states. [2019-11-20 06:47:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256644 states to 256644 states and 273489 transitions. [2019-11-20 06:47:39,854 INFO L78 Accepts]: Start accepts. Automaton has 256644 states and 273489 transitions. Word has length 472 [2019-11-20 06:47:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:39,854 INFO L462 AbstractCegarLoop]: Abstraction has 256644 states and 273489 transitions. [2019-11-20 06:47:39,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:47:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 256644 states and 273489 transitions. [2019-11-20 06:47:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-11-20 06:47:39,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:47:39,885 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 06:47:40,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:47:40,086 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:47:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:47:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1916997917, now seen corresponding path program 1 times [2019-11-20 06:47:40,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:47:40,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503939192] [2019-11-20 06:47:40,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:47:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-20 06:47:40,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503939192] [2019-11-20 06:47:40,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:47:40,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:47:40,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512830182] [2019-11-20 06:47:40,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:47:40,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:47:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:47:40,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:47:40,495 INFO L87 Difference]: Start difference. First operand 256644 states and 273489 transitions. Second operand 3 states. [2019-11-20 06:47:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:43,627 INFO L93 Difference]: Finished difference Result 566958 states and 603112 transitions. [2019-11-20 06:47:43,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:47:43,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2019-11-20 06:47:43,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:43,952 INFO L225 Difference]: With dead ends: 566958 [2019-11-20 06:47:43,952 INFO L226 Difference]: Without dead ends: 310316 [2019-11-20 06:47:44,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:47:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310316 states. [2019-11-20 06:47:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310316 to 300166. [2019-11-20 06:47:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300166 states. [2019-11-20 06:47:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300166 states to 300166 states and 318293 transitions. [2019-11-20 06:47:48,701 INFO L78 Accepts]: Start accepts. Automaton has 300166 states and 318293 transitions. Word has length 491 [2019-11-20 06:47:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:48,702 INFO L462 AbstractCegarLoop]: Abstraction has 300166 states and 318293 transitions. [2019-11-20 06:47:48,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:47:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 300166 states and 318293 transitions. [2019-11-20 06:47:48,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-11-20 06:47:48,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:47:48,740 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 06:47:48,740 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:47:48,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:47:48,741 INFO L82 PathProgramCache]: Analyzing trace with hash -184571190, now seen corresponding path program 1 times [2019-11-20 06:47:48,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:47:48,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989189198] [2019-11-20 06:47:48,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:47:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 445 proven. 61 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:47:49,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989189198] [2019-11-20 06:47:49,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116524915] [2019-11-20 06:47:49,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:47:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:50,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 06:47:50,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:47:50,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:47:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 498 proven. 8 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:47:51,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:47:51,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-20 06:47:51,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237056862] [2019-11-20 06:47:51,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 06:47:51,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:47:51,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 06:47:51,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-20 06:47:51,900 INFO L87 Difference]: Start difference. First operand 300166 states and 318293 transitions. Second operand 11 states. [2019-11-20 06:47:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:57,512 INFO L93 Difference]: Finished difference Result 659315 states and 699128 transitions. [2019-11-20 06:47:57,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 06:47:57,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 511 [2019-11-20 06:47:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:57,868 INFO L225 Difference]: With dead ends: 659315 [2019-11-20 06:47:57,869 INFO L226 Difference]: Without dead ends: 359151 [2019-11-20 06:47:57,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-20 06:47:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359151 states. [2019-11-20 06:48:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359151 to 300777. [2019-11-20 06:48:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300777 states. [2019-11-20 06:48:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300777 states to 300777 states and 318938 transitions. [2019-11-20 06:48:09,026 INFO L78 Accepts]: Start accepts. Automaton has 300777 states and 318938 transitions. Word has length 511 [2019-11-20 06:48:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 300777 states and 318938 transitions. [2019-11-20 06:48:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 06:48:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 300777 states and 318938 transitions. [2019-11-20 06:48:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-11-20 06:48:09,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:09,070 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:48:09,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:09,271 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:09,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash 377478072, now seen corresponding path program 1 times [2019-11-20 06:48:09,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:09,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365008553] [2019-11-20 06:48:09,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-11-20 06:48:10,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365008553] [2019-11-20 06:48:10,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:48:10,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:48:10,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707061009] [2019-11-20 06:48:10,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:48:10,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:10,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:48:10,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:48:10,318 INFO L87 Difference]: Start difference. First operand 300777 states and 318938 transitions. Second operand 3 states. [2019-11-20 06:48:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:12,271 INFO L93 Difference]: Finished difference Result 530151 states and 562178 transitions. [2019-11-20 06:48:12,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:48:12,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-11-20 06:48:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:12,496 INFO L225 Difference]: With dead ends: 530151 [2019-11-20 06:48:12,496 INFO L226 Difference]: Without dead ends: 229175 [2019-11-20 06:48:12,594 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 06:48:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229175 states. [2019-11-20 06:48:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229175 to 183819. [2019-11-20 06:48:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183819 states. [2019-11-20 06:48:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183819 states to 183819 states and 193436 transitions. [2019-11-20 06:48:16,385 INFO L78 Accepts]: Start accepts. Automaton has 183819 states and 193436 transitions. Word has length 524 [2019-11-20 06:48:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:16,385 INFO L462 AbstractCegarLoop]: Abstraction has 183819 states and 193436 transitions. [2019-11-20 06:48:16,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:48:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 183819 states and 193436 transitions. [2019-11-20 06:48:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-11-20 06:48:16,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:16,402 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:48:16,402 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1806755140, now seen corresponding path program 1 times [2019-11-20 06:48:16,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:16,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432626990] [2019-11-20 06:48:16,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 464 proven. 61 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 06:48:17,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432626990] [2019-11-20 06:48:17,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439192581] [2019-11-20 06:48:17,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:17,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:48:17,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:48:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-11-20 06:48:18,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:48:18,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-20 06:48:18,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877273014] [2019-11-20 06:48:18,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:48:18,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:48:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-20 06:48:18,255 INFO L87 Difference]: Start difference. First operand 183819 states and 193436 transitions. Second operand 4 states. [2019-11-20 06:48:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:20,141 INFO L93 Difference]: Finished difference Result 318817 states and 335360 transitions. [2019-11-20 06:48:20,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:48:20,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 528 [2019-11-20 06:48:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:20,264 INFO L225 Difference]: With dead ends: 318817 [2019-11-20 06:48:20,264 INFO L226 Difference]: Without dead ends: 135611 [2019-11-20 06:48:20,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-20 06:48:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135611 states. [2019-11-20 06:48:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135611 to 126022. [2019-11-20 06:48:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126022 states. [2019-11-20 06:48:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126022 states to 126022 states and 132073 transitions. [2019-11-20 06:48:22,502 INFO L78 Accepts]: Start accepts. Automaton has 126022 states and 132073 transitions. Word has length 528 [2019-11-20 06:48:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:22,502 INFO L462 AbstractCegarLoop]: Abstraction has 126022 states and 132073 transitions. [2019-11-20 06:48:22,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:48:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 126022 states and 132073 transitions. [2019-11-20 06:48:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2019-11-20 06:48:22,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:22,520 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-20 06:48:22,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:22,721 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash 805635785, now seen corresponding path program 1 times [2019-11-20 06:48:22,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:22,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237130215] [2019-11-20 06:48:22,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 553 proven. 136 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 06:48:24,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237130215] [2019-11-20 06:48:24,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160912232] [2019-11-20 06:48:24,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:24,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:48:24,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:48:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 06:48:25,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:48:25,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-11-20 06:48:25,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514151569] [2019-11-20 06:48:25,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:48:25,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:25,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:48:25,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:48:25,135 INFO L87 Difference]: Start difference. First operand 126022 states and 132073 transitions. Second operand 4 states. [2019-11-20 06:48:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:27,061 INFO L93 Difference]: Finished difference Result 159149 states and 166565 transitions. [2019-11-20 06:48:27,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:48:27,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 552 [2019-11-20 06:48:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:27,075 INFO L225 Difference]: With dead ends: 159149 [2019-11-20 06:48:27,075 INFO L226 Difference]: Without dead ends: 17094 [2019-11-20 06:48:27,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 550 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:48:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17094 states. [2019-11-20 06:48:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17094 to 7939. [2019-11-20 06:48:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7939 states. [2019-11-20 06:48:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7939 states to 7939 states and 8213 transitions. [2019-11-20 06:48:27,205 INFO L78 Accepts]: Start accepts. Automaton has 7939 states and 8213 transitions. Word has length 552 [2019-11-20 06:48:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:27,205 INFO L462 AbstractCegarLoop]: Abstraction has 7939 states and 8213 transitions. [2019-11-20 06:48:27,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:48:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7939 states and 8213 transitions. [2019-11-20 06:48:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-20 06:48:27,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:27,213 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 06:48:27,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:27,415 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:27,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1566727996, now seen corresponding path program 1 times [2019-11-20 06:48:27,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:27,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017465661] [2019-11-20 06:48:27,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 585 proven. 28 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-11-20 06:48:27,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017465661] [2019-11-20 06:48:27,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636094956] [2019-11-20 06:48:27,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:28,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 06:48:28,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:48:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2019-11-20 06:48:28,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:48:28,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-20 06:48:28,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116486802] [2019-11-20 06:48:28,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:48:28,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:48:28,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:48:28,614 INFO L87 Difference]: Start difference. First operand 7939 states and 8213 transitions. Second operand 3 states. [2019-11-20 06:48:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:28,887 INFO L93 Difference]: Finished difference Result 21368 states and 22139 transitions. [2019-11-20 06:48:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:48:28,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 603 [2019-11-20 06:48:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:28,898 INFO L225 Difference]: With dead ends: 21368 [2019-11-20 06:48:28,898 INFO L226 Difference]: Without dead ends: 14042 [2019-11-20 06:48:28,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 603 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 06:48:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14042 states. [2019-11-20 06:48:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 12824. [2019-11-20 06:48:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12824 states. [2019-11-20 06:48:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12824 states to 12824 states and 13323 transitions. [2019-11-20 06:48:29,033 INFO L78 Accepts]: Start accepts. Automaton has 12824 states and 13323 transitions. Word has length 603 [2019-11-20 06:48:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:29,033 INFO L462 AbstractCegarLoop]: Abstraction has 12824 states and 13323 transitions. [2019-11-20 06:48:29,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:48:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 12824 states and 13323 transitions. [2019-11-20 06:48:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2019-11-20 06:48:29,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:29,048 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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 06:48:29,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:29,252 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1078339668, now seen corresponding path program 1 times [2019-11-20 06:48:29,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:29,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940805993] [2019-11-20 06:48:29,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:30,132 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-11-20 06:48:30,266 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-11-20 06:48:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 964 proven. 379 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-20 06:48:31,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940805993] [2019-11-20 06:48:31,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535968811] [2019-11-20 06:48:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:32,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 06:48:32,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:48:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 1170 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-11-20 06:48:32,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:48:32,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-11-20 06:48:32,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882785327] [2019-11-20 06:48:32,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:48:32,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:32,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:48:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-20 06:48:32,776 INFO L87 Difference]: Start difference. First operand 12824 states and 13323 transitions. Second operand 5 states. [2019-11-20 06:48:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:33,943 INFO L93 Difference]: Finished difference Result 45175 states and 46981 transitions. [2019-11-20 06:48:33,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:48:33,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 692 [2019-11-20 06:48:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:33,970 INFO L225 Difference]: With dead ends: 45175 [2019-11-20 06:48:33,970 INFO L226 Difference]: Without dead ends: 32558 [2019-11-20 06:48:33,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 689 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-20 06:48:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32558 states. [2019-11-20 06:48:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32558 to 31740. [2019-11-20 06:48:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-11-20 06:48:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33041 transitions. [2019-11-20 06:48:34,341 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33041 transitions. Word has length 692 [2019-11-20 06:48:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:34,341 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33041 transitions. [2019-11-20 06:48:34,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:48:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33041 transitions. [2019-11-20 06:48:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2019-11-20 06:48:34,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:34,370 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 06:48:34,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:48:34,570 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:34,571 INFO L82 PathProgramCache]: Analyzing trace with hash -186732457, now seen corresponding path program 1 times [2019-11-20 06:48:34,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:34,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312872007] [2019-11-20 06:48:34,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2966 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 2229 trivial. 0 not checked. [2019-11-20 06:48:35,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312872007] [2019-11-20 06:48:35,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:48:35,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:48:35,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746083280] [2019-11-20 06:48:35,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:48:35,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:35,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:48:35,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:48:35,470 INFO L87 Difference]: Start difference. First operand 31740 states and 33041 transitions. Second operand 3 states. [2019-11-20 06:48:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:36,406 INFO L93 Difference]: Finished difference Result 74284 states and 77363 transitions. [2019-11-20 06:48:36,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:48:36,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 961 [2019-11-20 06:48:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:36,443 INFO L225 Difference]: With dead ends: 74284 [2019-11-20 06:48:36,443 INFO L226 Difference]: Without dead ends: 43157 [2019-11-20 06:48:36,458 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 06:48:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43157 states. [2019-11-20 06:48:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43157 to 31740. [2019-11-20 06:48:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-11-20 06:48:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33040 transitions. [2019-11-20 06:48:36,877 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33040 transitions. Word has length 961 [2019-11-20 06:48:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:36,878 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33040 transitions. [2019-11-20 06:48:36,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:48:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33040 transitions. [2019-11-20 06:48:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2019-11-20 06:48:36,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:36,905 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 06:48:36,905 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1569597196, now seen corresponding path program 1 times [2019-11-20 06:48:36,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:36,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368805614] [2019-11-20 06:48:36,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3028 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 2229 trivial. 0 not checked. [2019-11-20 06:48:39,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368805614] [2019-11-20 06:48:39,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:48:39,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 06:48:39,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183148607] [2019-11-20 06:48:39,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 06:48:39,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:39,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 06:48:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-20 06:48:39,666 INFO L87 Difference]: Start difference. First operand 31740 states and 33040 transitions. Second operand 11 states. [2019-11-20 06:48:40,568 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-20 06:48:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:42,999 INFO L93 Difference]: Finished difference Result 79612 states and 82735 transitions. [2019-11-20 06:48:42,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 06:48:42,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 968 [2019-11-20 06:48:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:43,034 INFO L225 Difference]: With dead ends: 79612 [2019-11-20 06:48:43,034 INFO L226 Difference]: Without dead ends: 48485 [2019-11-20 06:48:43,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-20 06:48:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48485 states. [2019-11-20 06:48:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48485 to 31740. [2019-11-20 06:48:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-11-20 06:48:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33039 transitions. [2019-11-20 06:48:43,515 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33039 transitions. Word has length 968 [2019-11-20 06:48:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:43,516 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33039 transitions. [2019-11-20 06:48:43,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 06:48:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33039 transitions. [2019-11-20 06:48:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-11-20 06:48:43,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:43,546 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 06:48:43,546 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:43,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:43,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1995304239, now seen corresponding path program 1 times [2019-11-20 06:48:43,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:43,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18476472] [2019-11-20 06:48:43,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 2242 proven. 0 refuted. 0 times theorem prover too weak. 1517 trivial. 0 not checked. [2019-11-20 06:48:44,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18476472] [2019-11-20 06:48:44,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:48:44,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:48:44,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783902133] [2019-11-20 06:48:44,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:48:44,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:44,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:48:44,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:48:44,659 INFO L87 Difference]: Start difference. First operand 31740 states and 33039 transitions. Second operand 4 states. [2019-11-20 06:48:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:45,162 INFO L93 Difference]: Finished difference Result 74266 states and 77196 transitions. [2019-11-20 06:48:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:48:45,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1063 [2019-11-20 06:48:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:45,196 INFO L225 Difference]: With dead ends: 74266 [2019-11-20 06:48:45,196 INFO L226 Difference]: Without dead ends: 43139 [2019-11-20 06:48:45,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:48:45,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43139 states. [2019-11-20 06:48:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43139 to 41515. [2019-11-20 06:48:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41515 states. [2019-11-20 06:48:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41515 states to 41515 states and 43032 transitions. [2019-11-20 06:48:45,751 INFO L78 Accepts]: Start accepts. Automaton has 41515 states and 43032 transitions. Word has length 1063 [2019-11-20 06:48:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:45,752 INFO L462 AbstractCegarLoop]: Abstraction has 41515 states and 43032 transitions. [2019-11-20 06:48:45,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:48:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 41515 states and 43032 transitions. [2019-11-20 06:48:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2019-11-20 06:48:45,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:48:45,796 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:48:45,796 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:48:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:48:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash 147166229, now seen corresponding path program 1 times [2019-11-20 06:48:45,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:48:45,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354102928] [2019-11-20 06:48:45,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:48:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:48:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4222 backedges. 2011 proven. 0 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-11-20 06:48:47,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354102928] [2019-11-20 06:48:47,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:48:47,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:48:47,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719317153] [2019-11-20 06:48:47,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:48:47,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:48:47,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:48:47,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:48:47,258 INFO L87 Difference]: Start difference. First operand 41515 states and 43032 transitions. Second operand 3 states. [2019-11-20 06:48:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:48:47,878 INFO L93 Difference]: Finished difference Result 57176 states and 59348 transitions. [2019-11-20 06:48:47,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:48:47,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1108 [2019-11-20 06:48:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:48:47,879 INFO L225 Difference]: With dead ends: 57176 [2019-11-20 06:48:47,879 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 06:48:47,889 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 06:48:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 06:48:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 06:48:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 06:48:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 06:48:47,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1108 [2019-11-20 06:48:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:48:47,890 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 06:48:47,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:48:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 06:48:47,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 06:48:47,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 06:49:01,583 WARN L191 SmtUtils]: Spent 13.66 s on a formula simplification. DAG size of input: 2736 DAG size of output: 2147 [2019-11-20 06:49:11,709 WARN L191 SmtUtils]: Spent 10.12 s on a formula simplification. DAG size of input: 2736 DAG size of output: 2147 [2019-11-20 06:49:45,268 WARN L191 SmtUtils]: Spent 33.54 s on a formula simplification. DAG size of input: 1955 DAG size of output: 294 [2019-11-20 06:50:21,626 WARN L191 SmtUtils]: Spent 36.35 s on a formula simplification. DAG size of input: 1955 DAG size of output: 294 [2019-11-20 06:50:21,628 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-20 06:50:21,628 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-20 06:50:21,628 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-20 06:50:21,629 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,630 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,630 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,630 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,630 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 06:50:21,630 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 06:50:21,630 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,630 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,630 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,631 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,631 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,631 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,631 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,631 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,631 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,631 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,631 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-20 06:50:21,632 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-20 06:50:21,632 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-20 06:50:21,632 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,632 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,632 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,632 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,632 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,633 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,633 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-20 06:50:21,633 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-20 06:50:21,633 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-20 06:50:21,633 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,633 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,633 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,633 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,634 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,634 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,634 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-20 06:50:21,634 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-20 06:50:21,634 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-20 06:50:21,634 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,634 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,634 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,635 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-20 06:50:21,635 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,635 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-20 06:50:21,635 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,635 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,635 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 06:50:21,635 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 06:50:21,636 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,636 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,636 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,636 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,636 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,636 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,636 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,636 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-20 06:50:21,637 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-20 06:50:21,637 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-20 06:50:21,637 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-20 06:50:21,637 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-20 06:50:21,637 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,637 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,637 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,637 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,638 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,638 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,638 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,638 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,638 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,638 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,638 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-20 06:50:21,639 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-20 06:50:21,639 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-20 06:50:21,639 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,639 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,639 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,639 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,639 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,639 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,640 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,640 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,640 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,640 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-20 06:50:21,640 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-20 06:50:21,640 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-20 06:50:21,640 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-20 06:50:21,641 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-20 06:50:21,641 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,641 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,641 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,641 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,641 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,641 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 06:50:21,641 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,642 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,642 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,642 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-20 06:50:21,642 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-20 06:50:21,642 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-20 06:50:21,642 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,642 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,642 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,643 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-20 06:50:21,643 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-20 06:50:21,643 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,643 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,643 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,643 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-20 06:50:21,643 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,644 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-20 06:50:21,644 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,644 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-20 06:50:21,644 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,644 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,644 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 06:50:21,644 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 06:50:21,644 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 06:50:21,645 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 06:50:21,645 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-20 06:50:21,645 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-20 06:50:21,645 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-20 06:50:21,645 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,645 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,645 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,647 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse21 (= ~a12~0 1))) (let ((.cse24 (not .cse21)) (.cse29 (not (= 1 ~a11~0)))) (let ((.cse16 (and .cse24 .cse29)) (.cse15 (= 1 ~a3~0)) (.cse28 (<= ~a3~0 0)) (.cse20 (= ~a27~0 1)) (.cse5 (= 1 ~a6~0)) (.cse14 (= ~a5~0 1)) (.cse8 (= ~a26~0 1)) (.cse30 (= 1 ~a8~0)) (.cse23 (= ~a11~0 1))) (let ((.cse32 (or .cse30 .cse23)) (.cse33 (<= ~a7~0 0)) (.cse34 (not .cse30)) (.cse31 (= ~a4~0 1)) (.cse27 (<= ~a23~0 0)) (.cse25 (or (and .cse20 .cse15 .cse5 .cse21 .cse14 .cse8 .cse29) (and .cse28 .cse20 .cse5 .cse21 .cse14 .cse8 .cse29))) (.cse6 (not .cse23)) (.cse35 (and .cse28 .cse16 .cse5 .cse14 .cse8)) (.cse0 (= ~a15~0 1)) (.cse17 (= ~a12~0 ~a6~0)) (.cse4 (<= 2 ~a3~0)) (.cse19 (= 1 ~a5~0)) (.cse1 (<= ~a20~0 0)) (.cse13 (= ~a1~0 1)) (.cse22 (= 0 ~a3~0)) (.cse2 (not (= ~a7~0 1))) (.cse18 (<= ~a6~0 0)) (.cse7 (= ~a16~0 1)) (.cse9 (<= ~a27~0 0)) (.cse12 (= 1 ~a0~0)) (.cse3 (= ~a18~0 1)) (.cse11 (= 1 ~a22~0)) (.cse26 (<= ~a26~0 0)) (.cse10 (= ~a29~0 1))) (or (and (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12)) .cse13 .cse14) (and (and .cse2 .cse3 .cse15 .cse16 .cse8 .cse7 .cse9) .cse5 .cse14 .cse10 .cse11) (and .cse13 (and (or (and (and .cse17 (and .cse2 .cse18 .cse3 .cse15 .cse7 .cse8 .cse0 .cse9) .cse10 .cse11 .cse12) .cse19) (and .cse20 .cse8 (or (and .cse2 .cse18 .cse3 .cse15 .cse21 .cse14 .cse10 .cse11 .cse7 .cse12) (and .cse21 .cse22 .cse10 .cse11 .cse12 (and .cse2 .cse18 .cse3 .cse14 .cse7)))) (and (and .cse3 .cse7 .cse0 .cse9 .cse2 .cse18 .cse21 .cse10 .cse8) .cse19 .cse22 .cse11 .cse12) (and (and .cse17 (and .cse2 .cse18 .cse3 .cse20 .cse15 .cse8 .cse7 .cse0) .cse19 .cse10 .cse12) .cse23) (and .cse3 .cse22 .cse14 .cse7 .cse0 .cse9 .cse17 .cse2 .cse18 .cse10 .cse23 .cse8 .cse12)) .cse1)) (and (and (and .cse20 (and .cse24 .cse2 .cse18 .cse3 .cse4 .cse10 .cse7 .cse12) .cse23 .cse8) .cse1) .cse13 .cse14) (and .cse3 .cse25 .cse11 .cse0) (and (and (and (and (and .cse24 .cse2 .cse18 .cse3 .cse4 .cse20 .cse26 .cse7 .cse0) .cse10 .cse12) .cse23) .cse1) .cse13 .cse14) (and .cse8 (and .cse5 (and (and (and .cse3 .cse20 .cse16 .cse14 .cse10 .cse7) (<= ~a3~0 1)) .cse11 .cse12))) (and .cse13 (or (and (and .cse10 (and .cse2 .cse18 .cse3 .cse15 .cse16 .cse7 .cse8 .cse0 .cse9)) .cse19) (and .cse2 (and .cse18 .cse3 .cse15 .cse16 .cse8 .cse7 .cse9) .cse14 .cse10 .cse11)) .cse1) (and .cse3 .cse22 .cse14 .cse7 .cse11 .cse0 .cse9 .cse17 .cse2 .cse21 .cse13 .cse10 .cse23 .cse8 .cse12 .cse1) (and .cse13 .cse0 (and .cse19 (and .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse26 .cse7) .cse10 .cse11 .cse12) .cse27 .cse1) (and (and .cse28 .cse2 .cse3 .cse20 .cse5 .cse21 .cse14 .cse7) .cse23 .cse8) (and .cse28 .cse2 .cse18 .cse3 .cse21 .cse26 .cse14 .cse29 .cse9) (and .cse20 (and .cse22 (and .cse10 (and .cse2 .cse18 .cse3 .cse16 .cse14 .cse26 .cse7 .cse0)) .cse11 .cse12)) (and .cse13 (and (and (and .cse2 (and .cse24 .cse3 .cse4 .cse5 (not .cse20) .cse14 .cse8 .cse0)) .cse10 .cse12) .cse7 .cse27 .cse1)) (or (and (and .cse2 .cse3 .cse20 .cse5 .cse14 .cse10 .cse7 .cse8) .cse22 .cse12) (and .cse3 .cse25 .cse22 .cse10 .cse7 .cse11 .cse12)) (and .cse13 (or (and .cse19 .cse20 (and .cse21 .cse10 .cse12 (and .cse2 .cse18 .cse3 .cse6 .cse7 .cse0)) .cse8) (and .cse29 .cse3 .cse19 .cse7 .cse11 .cse2 .cse18 .cse20 .cse21 .cse10 .cse12 .cse8)) .cse1) (and .cse10 (and .cse2 .cse3 .cse15 .cse5 .cse16 .cse14 .cse7 .cse8 .cse0 .cse9)) (and (and .cse8 (and .cse21 (and (and .cse29 .cse2 .cse18 .cse3 .cse20 .cse15) .cse10) .cse14 .cse12)) .cse13 .cse1) (and .cse23 (and .cse22 .cse10 .cse12 (and .cse24 .cse2 .cse18 .cse3 .cse20 .cse26 .cse14 .cse7))) (and (and .cse28 .cse2 .cse18 .cse3 .cse20 .cse6 .cse10 .cse8 .cse0) .cse21 .cse14 .cse12) (and (and (and (or (and .cse18 .cse3 .cse15 .cse21 .cse8 .cse11 .cse7 .cse9) (and .cse28 .cse18 .cse3 .cse21 .cse8 .cse7 .cse11 (or .cse30 (and .cse31 .cse10 .cse0)) .cse9)) .cse23) .cse1) .cse13 .cse14) (and (and .cse20 .cse23 .cse27 (and .cse22 .cse10 .cse11 .cse12 (and .cse2 .cse3 .cse5 .cse26 .cse14 .cse7 .cse0))) .cse13) (and .cse32 (and (and .cse3 .cse25 .cse0) .cse2 .cse22 .cse12)) (and (and .cse2 .cse3 .cse25 .cse7 .cse0) .cse22 .cse12) (and .cse5 (and .cse3 .cse20 .cse15 .cse16 .cse10 .cse14 .cse8 .cse11 .cse12)) (and (and (and .cse2 .cse18 .cse3 .cse4 .cse20 .cse7) .cse10 .cse11 .cse12) .cse13 .cse23 .cse14 .cse8 .cse0 .cse1) (and .cse13 (or (and .cse23 (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse10 .cse8 .cse12)) (and (and .cse24 .cse2 .cse3 .cse15 .cse5 .cse14 .cse8 .cse7 .cse0 .cse9) .cse10 .cse12) (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse23 .cse8 .cse0) (and .cse20 .cse8 (and (and .cse2 .cse3 .cse5 .cse14 .cse7 .cse0) .cse10 .cse11 .cse12)) (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse23 .cse11 .cse8)) .cse1) (and (and (and .cse28 .cse24 .cse2 .cse3 .cse20 .cse5 .cse26 .cse7) .cse10) .cse14 .cse12) (and .cse3 .cse14 .cse7 .cse33 .cse17 .cse4 .cse20 .cse21 .cse13 .cse26 .cse10 .cse23 .cse12 .cse1) (and (and .cse11 .cse12 (and (and .cse28 .cse3 .cse16 .cse5 .cse14 .cse0) .cse10)) .cse20 .cse8) (and (and .cse2 .cse32 (and .cse3 .cse15 .cse16) .cse5) .cse19 .cse20 .cse8) (and .cse3 .cse5 .cse22 .cse14 .cse6 .cse11 .cse7 .cse0 .cse33 .cse9 .cse21 .cse26 .cse10 .cse12 .cse1) (and .cse23 .cse8 (and .cse5 .cse21 .cse22 .cse14 .cse12 (and .cse2 .cse3 .cse20))) (and (and (and .cse3 .cse5 .cse22 .cse14 .cse11 .cse7 .cse20 .cse10 .cse12 .cse8) .cse1) .cse13) (and (and (and .cse28 .cse2 .cse3 .cse5 .cse21 .cse14 .cse0) .cse10) .cse20 .cse23 .cse8) (and (and (and (and .cse29 .cse28 .cse2 .cse18 .cse3 .cse21 .cse7) .cse10) .cse12) .cse19 .cse20 .cse8) (and .cse3 .cse6 .cse14 .cse7 .cse11 .cse0 .cse9 .cse17 .cse2 .cse4 .cse21 .cse13 .cse26 .cse10 .cse12 .cse1) (and .cse20 (and (and .cse28 .cse2 .cse24 .cse3 .cse5 .cse7) .cse14 .cse10) .cse8) (and (or (and .cse18 .cse3 .cse21 .cse22 .cse10 .cse11 .cse12 .cse29) (and (and .cse10 (and .cse29 .cse2 .cse18 .cse3 .cse21)) .cse22 .cse12)) .cse19 .cse20 .cse8) (and .cse22 .cse12 (and .cse3 .cse14 .cse6 .cse7 .cse0 .cse9 .cse2 .cse18 .cse21 .cse10 .cse8)) (and (and (and (and .cse2 .cse3 .cse20 .cse16 .cse26 .cse7) .cse5 .cse14 .cse10 .cse12) .cse1) .cse13) (and .cse34 .cse31 (and .cse18 .cse3 .cse6 .cse26) .cse14 .cse11 .cse7 .cse0 .cse9 .cse2 (or (= ~a19~0 1) (= ~a17~0 1) (not (= 2 ULTIMATE.start_calculate_output_~input))) .cse15 .cse13 .cse24 .cse10 .cse12 .cse27 .cse1) (and .cse3 .cse14 .cse6 .cse11 .cse7 .cse0 .cse9 .cse17 .cse2 .cse15 .cse21 .cse26 .cse10 .cse12 .cse27 .cse1) (and .cse13 (and .cse3 .cse19 .cse7 .cse11 .cse9 .cse2 .cse18 .cse4 .cse21 .cse10 .cse8 .cse12) .cse1) (and (and (and (and (and .cse2 .cse3 .cse4) .cse5 .cse10 .cse11 .cse12) .cse19 .cse23 .cse8) .cse20 .cse7 .cse1) .cse13) (and .cse13 (and (and .cse34 .cse31 (and .cse12 (and (and .cse2 .cse18 .cse3 .cse20 .cse15 .cse16 .cse14 .cse26 .cse7) .cse10)) .cse11 .cse0) .cse27 .cse1)) (and .cse13 (and (and .cse19 .cse20 (and .cse24 .cse18 .cse3 .cse22 .cse10 .cse7 .cse12) .cse23 .cse8) .cse1)) (and .cse20 (or (and .cse2 .cse5 .cse10 .cse14 (and .cse3 .cse15 .cse16 .cse8)) (and .cse10 (and .cse2 .cse3 .cse35)))) (and (and (and .cse2 .cse3 .cse25 .cse7) .cse10) .cse11 .cse12) (and .cse20 .cse23 (and (and .cse28 .cse24 .cse2 .cse18 .cse3 .cse14 .cse26 .cse10 .cse7 .cse0) .cse12)) (and .cse13 (or (and .cse14 .cse10 .cse12 (and .cse2 (and (and .cse3 .cse4 .cse16 .cse5 .cse26) .cse7 .cse0))) (and (and .cse5 .cse10 .cse12 (and .cse2 (and (and .cse3 .cse4 .cse16 .cse8) .cse7))) .cse19)) .cse1) (and (and (and .cse3 .cse6 .cse7 .cse0 .cse9 .cse2 .cse18 .cse4 .cse21 .cse10 .cse8) .cse12) .cse13 .cse14 .cse1) (and .cse3 .cse22 .cse14 .cse6 .cse11 .cse7 .cse0 .cse17 .cse18 .cse20 .cse10 .cse8 .cse12) (let ((.cse36 (or (and .cse3 .cse35 .cse7 .cse0 .cse9) (and .cse3 .cse35 .cse20 .cse7 .cse0)))) (or (and (and .cse10 .cse36) .cse22 .cse11 .cse12) (and (and (and .cse2 .cse36) .cse10) .cse22 .cse12))) (and (and (and (and .cse17 .cse10 .cse12 (and .cse2 .cse18 .cse3 .cse4 .cse26 .cse7 .cse9)) .cse19 .cse23) .cse1) .cse13) (and .cse21 .cse22 .cse14 .cse10 (and .cse29 .cse2 .cse18 .cse3 .cse7 .cse8 .cse9) .cse11 .cse12) (and .cse3 .cse5 .cse14 .cse11 .cse28 .cse24 .cse20 .cse26 .cse10 .cse23)))))) [2019-11-20 06:50:21,647 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,647 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,647 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,648 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-20 06:50:21,648 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-20 06:50:21,648 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,648 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,648 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 06:50:21,648 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1566) no Hoare annotation was computed. [2019-11-20 06:50:21,648 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,649 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-20 06:50:21,649 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,649 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,649 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,649 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,649 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,649 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,649 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-20 06:50:21,650 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-20 06:50:21,650 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,650 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,650 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,650 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,650 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,650 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,651 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,651 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,651 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,651 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-20 06:50:21,651 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-20 06:50:21,651 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,651 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,651 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-20 06:50:21,652 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-20 06:50:21,652 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,653 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse21 (= ~a12~0 1))) (let ((.cse24 (not .cse21)) (.cse29 (not (= 1 ~a11~0)))) (let ((.cse16 (and .cse24 .cse29)) (.cse15 (= 1 ~a3~0)) (.cse28 (<= ~a3~0 0)) (.cse20 (= ~a27~0 1)) (.cse5 (= 1 ~a6~0)) (.cse14 (= ~a5~0 1)) (.cse8 (= ~a26~0 1)) (.cse30 (= 1 ~a8~0)) (.cse23 (= ~a11~0 1))) (let ((.cse32 (or .cse30 .cse23)) (.cse33 (<= ~a7~0 0)) (.cse34 (not .cse30)) (.cse31 (= ~a4~0 1)) (.cse27 (<= ~a23~0 0)) (.cse25 (or (and .cse20 .cse15 .cse5 .cse21 .cse14 .cse8 .cse29) (and .cse28 .cse20 .cse5 .cse21 .cse14 .cse8 .cse29))) (.cse6 (not .cse23)) (.cse35 (and .cse28 .cse16 .cse5 .cse14 .cse8)) (.cse0 (= ~a15~0 1)) (.cse17 (= ~a12~0 ~a6~0)) (.cse4 (<= 2 ~a3~0)) (.cse19 (= 1 ~a5~0)) (.cse1 (<= ~a20~0 0)) (.cse13 (= ~a1~0 1)) (.cse22 (= 0 ~a3~0)) (.cse2 (not (= ~a7~0 1))) (.cse18 (<= ~a6~0 0)) (.cse7 (= ~a16~0 1)) (.cse9 (<= ~a27~0 0)) (.cse12 (= 1 ~a0~0)) (.cse3 (= ~a18~0 1)) (.cse11 (= 1 ~a22~0)) (.cse26 (<= ~a26~0 0)) (.cse10 (= ~a29~0 1))) (or (and (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12)) .cse13 .cse14) (and (and .cse2 .cse3 .cse15 .cse16 .cse8 .cse7 .cse9) .cse5 .cse14 .cse10 .cse11) (and .cse13 (and (or (and (and .cse17 (and .cse2 .cse18 .cse3 .cse15 .cse7 .cse8 .cse0 .cse9) .cse10 .cse11 .cse12) .cse19) (and .cse20 .cse8 (or (and .cse2 .cse18 .cse3 .cse15 .cse21 .cse14 .cse10 .cse11 .cse7 .cse12) (and .cse21 .cse22 .cse10 .cse11 .cse12 (and .cse2 .cse18 .cse3 .cse14 .cse7)))) (and (and .cse3 .cse7 .cse0 .cse9 .cse2 .cse18 .cse21 .cse10 .cse8) .cse19 .cse22 .cse11 .cse12) (and (and .cse17 (and .cse2 .cse18 .cse3 .cse20 .cse15 .cse8 .cse7 .cse0) .cse19 .cse10 .cse12) .cse23) (and .cse3 .cse22 .cse14 .cse7 .cse0 .cse9 .cse17 .cse2 .cse18 .cse10 .cse23 .cse8 .cse12)) .cse1)) (and (and (and .cse20 (and .cse24 .cse2 .cse18 .cse3 .cse4 .cse10 .cse7 .cse12) .cse23 .cse8) .cse1) .cse13 .cse14) (and .cse3 .cse25 .cse11 .cse0) (and (and (and (and (and .cse24 .cse2 .cse18 .cse3 .cse4 .cse20 .cse26 .cse7 .cse0) .cse10 .cse12) .cse23) .cse1) .cse13 .cse14) (and .cse8 (and .cse5 (and (and (and .cse3 .cse20 .cse16 .cse14 .cse10 .cse7) (<= ~a3~0 1)) .cse11 .cse12))) (and .cse13 (or (and (and .cse10 (and .cse2 .cse18 .cse3 .cse15 .cse16 .cse7 .cse8 .cse0 .cse9)) .cse19) (and .cse2 (and .cse18 .cse3 .cse15 .cse16 .cse8 .cse7 .cse9) .cse14 .cse10 .cse11)) .cse1) (and .cse3 .cse22 .cse14 .cse7 .cse11 .cse0 .cse9 .cse17 .cse2 .cse21 .cse13 .cse10 .cse23 .cse8 .cse12 .cse1) (and .cse13 .cse0 (and .cse19 (and .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse26 .cse7) .cse10 .cse11 .cse12) .cse27 .cse1) (and (and .cse28 .cse2 .cse3 .cse20 .cse5 .cse21 .cse14 .cse7) .cse23 .cse8) (and .cse28 .cse2 .cse18 .cse3 .cse21 .cse26 .cse14 .cse29 .cse9) (and .cse20 (and .cse22 (and .cse10 (and .cse2 .cse18 .cse3 .cse16 .cse14 .cse26 .cse7 .cse0)) .cse11 .cse12)) (and .cse13 (and (and (and .cse2 (and .cse24 .cse3 .cse4 .cse5 (not .cse20) .cse14 .cse8 .cse0)) .cse10 .cse12) .cse7 .cse27 .cse1)) (or (and (and .cse2 .cse3 .cse20 .cse5 .cse14 .cse10 .cse7 .cse8) .cse22 .cse12) (and .cse3 .cse25 .cse22 .cse10 .cse7 .cse11 .cse12)) (and .cse13 (or (and .cse19 .cse20 (and .cse21 .cse10 .cse12 (and .cse2 .cse18 .cse3 .cse6 .cse7 .cse0)) .cse8) (and .cse29 .cse3 .cse19 .cse7 .cse11 .cse2 .cse18 .cse20 .cse21 .cse10 .cse12 .cse8)) .cse1) (and .cse10 (and .cse2 .cse3 .cse15 .cse5 .cse16 .cse14 .cse7 .cse8 .cse0 .cse9)) (and (and .cse8 (and .cse21 (and (and .cse29 .cse2 .cse18 .cse3 .cse20 .cse15) .cse10) .cse14 .cse12)) .cse13 .cse1) (and .cse23 (and .cse22 .cse10 .cse12 (and .cse24 .cse2 .cse18 .cse3 .cse20 .cse26 .cse14 .cse7))) (and (and .cse28 .cse2 .cse18 .cse3 .cse20 .cse6 .cse10 .cse8 .cse0) .cse21 .cse14 .cse12) (and (and (and (or (and .cse18 .cse3 .cse15 .cse21 .cse8 .cse11 .cse7 .cse9) (and .cse28 .cse18 .cse3 .cse21 .cse8 .cse7 .cse11 (or .cse30 (and .cse31 .cse10 .cse0)) .cse9)) .cse23) .cse1) .cse13 .cse14) (and (and .cse20 .cse23 .cse27 (and .cse22 .cse10 .cse11 .cse12 (and .cse2 .cse3 .cse5 .cse26 .cse14 .cse7 .cse0))) .cse13) (and .cse32 (and (and .cse3 .cse25 .cse0) .cse2 .cse22 .cse12)) (and (and .cse2 .cse3 .cse25 .cse7 .cse0) .cse22 .cse12) (and .cse5 (and .cse3 .cse20 .cse15 .cse16 .cse10 .cse14 .cse8 .cse11 .cse12)) (and (and (and .cse2 .cse18 .cse3 .cse4 .cse20 .cse7) .cse10 .cse11 .cse12) .cse13 .cse23 .cse14 .cse8 .cse0 .cse1) (and .cse13 (or (and .cse23 (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse10 .cse8 .cse12)) (and (and .cse24 .cse2 .cse3 .cse15 .cse5 .cse14 .cse8 .cse7 .cse0 .cse9) .cse10 .cse12) (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse23 .cse8 .cse0) (and .cse20 .cse8 (and (and .cse2 .cse3 .cse5 .cse14 .cse7 .cse0) .cse10 .cse11 .cse12)) (and .cse24 .cse3 .cse20 .cse15 .cse5 .cse14 .cse23 .cse11 .cse8)) .cse1) (and (and (and .cse28 .cse24 .cse2 .cse3 .cse20 .cse5 .cse26 .cse7) .cse10) .cse14 .cse12) (and .cse3 .cse14 .cse7 .cse33 .cse17 .cse4 .cse20 .cse21 .cse13 .cse26 .cse10 .cse23 .cse12 .cse1) (and (and .cse11 .cse12 (and (and .cse28 .cse3 .cse16 .cse5 .cse14 .cse0) .cse10)) .cse20 .cse8) (and (and .cse2 .cse32 (and .cse3 .cse15 .cse16) .cse5) .cse19 .cse20 .cse8) (and .cse3 .cse5 .cse22 .cse14 .cse6 .cse11 .cse7 .cse0 .cse33 .cse9 .cse21 .cse26 .cse10 .cse12 .cse1) (and .cse23 .cse8 (and .cse5 .cse21 .cse22 .cse14 .cse12 (and .cse2 .cse3 .cse20))) (and (and (and .cse3 .cse5 .cse22 .cse14 .cse11 .cse7 .cse20 .cse10 .cse12 .cse8) .cse1) .cse13) (and (and (and .cse28 .cse2 .cse3 .cse5 .cse21 .cse14 .cse0) .cse10) .cse20 .cse23 .cse8) (and (and (and (and .cse29 .cse28 .cse2 .cse18 .cse3 .cse21 .cse7) .cse10) .cse12) .cse19 .cse20 .cse8) (and .cse3 .cse6 .cse14 .cse7 .cse11 .cse0 .cse9 .cse17 .cse2 .cse4 .cse21 .cse13 .cse26 .cse10 .cse12 .cse1) (and .cse20 (and (and .cse28 .cse2 .cse24 .cse3 .cse5 .cse7) .cse14 .cse10) .cse8) (and (or (and .cse18 .cse3 .cse21 .cse22 .cse10 .cse11 .cse12 .cse29) (and (and .cse10 (and .cse29 .cse2 .cse18 .cse3 .cse21)) .cse22 .cse12)) .cse19 .cse20 .cse8) (and .cse22 .cse12 (and .cse3 .cse14 .cse6 .cse7 .cse0 .cse9 .cse2 .cse18 .cse21 .cse10 .cse8)) (and (and (and (and .cse2 .cse3 .cse20 .cse16 .cse26 .cse7) .cse5 .cse14 .cse10 .cse12) .cse1) .cse13) (and .cse34 .cse31 (and .cse18 .cse3 .cse6 .cse26) .cse14 .cse11 .cse7 .cse0 .cse9 .cse2 (or (= ~a19~0 1) (= ~a17~0 1) (not (= 2 ULTIMATE.start_calculate_output_~input))) .cse15 .cse13 .cse24 .cse10 .cse12 .cse27 .cse1) (and .cse3 .cse14 .cse6 .cse11 .cse7 .cse0 .cse9 .cse17 .cse2 .cse15 .cse21 .cse26 .cse10 .cse12 .cse27 .cse1) (and .cse13 (and .cse3 .cse19 .cse7 .cse11 .cse9 .cse2 .cse18 .cse4 .cse21 .cse10 .cse8 .cse12) .cse1) (and (and (and (and (and .cse2 .cse3 .cse4) .cse5 .cse10 .cse11 .cse12) .cse19 .cse23 .cse8) .cse20 .cse7 .cse1) .cse13) (and .cse13 (and (and .cse34 .cse31 (and .cse12 (and (and .cse2 .cse18 .cse3 .cse20 .cse15 .cse16 .cse14 .cse26 .cse7) .cse10)) .cse11 .cse0) .cse27 .cse1)) (and .cse13 (and (and .cse19 .cse20 (and .cse24 .cse18 .cse3 .cse22 .cse10 .cse7 .cse12) .cse23 .cse8) .cse1)) (and .cse20 (or (and .cse2 .cse5 .cse10 .cse14 (and .cse3 .cse15 .cse16 .cse8)) (and .cse10 (and .cse2 .cse3 .cse35)))) (and (and (and .cse2 .cse3 .cse25 .cse7) .cse10) .cse11 .cse12) (and .cse20 .cse23 (and (and .cse28 .cse24 .cse2 .cse18 .cse3 .cse14 .cse26 .cse10 .cse7 .cse0) .cse12)) (and .cse13 (or (and .cse14 .cse10 .cse12 (and .cse2 (and (and .cse3 .cse4 .cse16 .cse5 .cse26) .cse7 .cse0))) (and (and .cse5 .cse10 .cse12 (and .cse2 (and (and .cse3 .cse4 .cse16 .cse8) .cse7))) .cse19)) .cse1) (and (and (and .cse3 .cse6 .cse7 .cse0 .cse9 .cse2 .cse18 .cse4 .cse21 .cse10 .cse8) .cse12) .cse13 .cse14 .cse1) (and .cse3 .cse22 .cse14 .cse6 .cse11 .cse7 .cse0 .cse17 .cse18 .cse20 .cse10 .cse8 .cse12) (let ((.cse36 (or (and .cse3 .cse35 .cse7 .cse0 .cse9) (and .cse3 .cse35 .cse20 .cse7 .cse0)))) (or (and (and .cse10 .cse36) .cse22 .cse11 .cse12) (and (and (and .cse2 .cse36) .cse10) .cse22 .cse12))) (and (and (and (and .cse17 .cse10 .cse12 (and .cse2 .cse18 .cse3 .cse4 .cse26 .cse7 .cse9)) .cse19 .cse23) .cse1) .cse13) (and .cse21 .cse22 .cse14 .cse10 (and .cse29 .cse2 .cse18 .cse3 .cse7 .cse8 .cse9) .cse11 .cse12) (and .cse3 .cse5 .cse14 .cse11 .cse28 .cse24 .cse20 .cse26 .cse10 .cse23)))))) [2019-11-20 06:50:21,653 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,653 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,654 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,655 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,656 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-20 06:50:21,657 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-20 06:50:21,658 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-20 06:50:21,659 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,659 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,659 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,659 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,659 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,659 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-20 06:50:21,659 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-20 06:50:21,659 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,660 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,660 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,660 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-20 06:50:21,660 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-20 06:50:21,660 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,660 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-20 06:50:21,660 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,661 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,661 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,661 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,661 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,661 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,661 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,661 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,661 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,662 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-20 06:50:21,663 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-20 06:50:21,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:50:21 BoogieIcfgContainer [2019-11-20 06:50:21,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:50:21,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:50:21,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:50:21,762 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:50:21,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:45:54" (3/4) ... [2019-11-20 06:50:21,765 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 06:50:21,793 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 06:50:21,797 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 06:50:22,016 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5ed1961d-e549-4ba8-b2d1-76626b4fa592/bin/uautomizer/witness.graphml [2019-11-20 06:50:22,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:50:22,018 INFO L168 Benchmark]: Toolchain (without parser) took 271293.78 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 938.1 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-11-20 06:50:22,018 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:50:22,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 990.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-20 06:50:22,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:50:22,019 INFO L168 Benchmark]: Boogie Preprocessor took 105.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-20 06:50:22,019 INFO L168 Benchmark]: RCFGBuilder took 2296.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.7 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:50:22,020 INFO L168 Benchmark]: TraceAbstraction took 267508.01 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2019-11-20 06:50:22,020 INFO L168 Benchmark]: Witness Printer took 255.11 ms. Allocated memory is still 6.4 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 84.1 MB). Peak memory consumption was 84.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:50:22,022 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 990.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2296.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.7 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 267508.01 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 255.11 ms. Allocated memory is still 6.4 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 84.1 MB). Peak memory consumption was 84.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1566]: 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: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a15 == 1 && a20 <= 0) && (((((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && !(a11 == 1)) && a16 == 1) && a26 == 1) && a27 <= 0) && a29 == 1) && 1 == a22) && 1 == a0) && a1 == 1) && a5 == 1) || ((((((((((!(a7 == 1) && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && a27 <= 0) && 1 == a6) && a5 == 1) && a29 == 1) && 1 == a22)) || (a1 == 1 && (((((((((a12 == a6 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) && a29 == 1) && 1 == a22) && 1 == a0) && 1 == a5) || ((a27 == 1 && a26 == 1) && ((((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a12 == 1) && a5 == 1) && a29 == 1) && 1 == a22) && a16 == 1) && 1 == a0) || (((((a12 == 1 && 0 == a3) && a29 == 1) && 1 == a22) && 1 == a0) && (((!(a7 == 1) && a6 <= 0) && a18 == 1) && a5 == 1) && a16 == 1)))) || ((((((((((((a18 == 1 && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a5) && 0 == a3) && 1 == a22) && 1 == a0)) || (((((a12 == a6 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && a26 == 1) && a16 == 1) && a15 == 1) && 1 == a5) && a29 == 1) && 1 == a0) && a11 == 1)) || ((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && a6 <= 0) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) && a20 <= 0)) || ((((((a27 == 1 && ((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && 2 <= a3) && a29 == 1) && a16 == 1) && 1 == a0) && a11 == 1) && a26 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || (((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && 1 == a22) && a15 == 1)) || ((((((((((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && 2 <= a3) && a27 == 1) && a26 <= 0) && a16 == 1) && a15 == 1) && a29 == 1) && 1 == a0) && a11 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || (a26 == 1 && 1 == a6 && (((((((a18 == 1 && a27 == 1) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a29 == 1) && a16 == 1) && a3 <= 1) && 1 == a22) && 1 == a0)) || ((a1 == 1 && (((a29 == 1 && (((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) && 1 == a5) || ((((!(a7 == 1) && (((((a6 <= 0 && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && a27 <= 0) && a5 == 1) && a29 == 1) && 1 == a22))) && a20 <= 0)) || (((((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && a16 == 1) && 1 == a22) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && a12 == 1) && a1 == 1) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((a1 == 1 && a15 == 1) && (((1 == a5 && ((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && 1 == a6) && !(a11 == 1)) && a26 <= 0) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1)) || ((((((((a3 <= 0 && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11)) && a27 <= 0)) || (a27 == 1 && ((0 == a3 && a29 == 1 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a26 <= 0) && a16 == 1) && a15 == 1) && 1 == a22) && 1 == a0)) || (a1 == 1 && (((((!(a7 == 1) && ((((((!(a12 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && !(a27 == 1)) && a5 == 1) && a26 == 1) && a15 == 1) && a29 == 1) && 1 == a0) && a16 == 1) && a23 <= 0) && a20 <= 0)) || (((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && a5 == 1) && a29 == 1) && a16 == 1) && a26 == 1) && 0 == a3) && 1 == a0) || ((((((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && 0 == a3) && a29 == 1) && a16 == 1) && 1 == a22) && 1 == a0)) || ((a1 == 1 && ((((1 == a5 && a27 == 1) && ((a12 == 1 && a29 == 1) && 1 == a0) && ((((!(a7 == 1) && a6 <= 0) && a18 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a26 == 1) || (((((((((((!(1 == a11) && a18 == 1) && 1 == a5) && a16 == 1) && 1 == a22) && !(a7 == 1)) && a6 <= 0) && a27 == 1) && a12 == 1) && a29 == 1) && 1 == a0) && a26 == 1))) && a20 <= 0)) || (a29 == 1 && ((((((((!(a7 == 1) && a18 == 1) && 1 == a3) && 1 == a6) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0)) || (((a26 == 1 && ((a12 == 1 && (((((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && a29 == 1) && a5 == 1) && 1 == a0) && a1 == 1) && a20 <= 0)) || (a11 == 1 && ((0 == a3 && a29 == 1) && 1 == a0) && ((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((((((((((a3 <= 0 && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a15 == 1) && a12 == 1) && a5 == 1) && 1 == a0)) || ((((((((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a26 == 1) && 1 == a22) && a16 == 1) && a27 <= 0) || ((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && a12 == 1) && a26 == 1) && a16 == 1) && 1 == a22) && (1 == a8 || ((a4 == 1 && a29 == 1) && a15 == 1))) && a27 <= 0)) && a11 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || ((((a27 == 1 && a11 == 1) && a23 <= 0) && (((0 == a3 && a29 == 1) && 1 == a22) && 1 == a0) && (((((!(a7 == 1) && a18 == 1) && 1 == a6) && a26 <= 0) && a5 == 1) && a16 == 1) && a15 == 1) && a1 == 1)) || ((1 == a8 || a11 == 1) && ((((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a15 == 1) && !(a7 == 1)) && 0 == a3) && 1 == a0)) || ((((((!(a7 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a16 == 1) && a15 == 1) && 0 == a3) && 1 == a0)) || (1 == a6 && (((((((a18 == 1 && a27 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a29 == 1) && a5 == 1) && a26 == 1) && 1 == a22) && 1 == a0)) || ((((((((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 2 <= a3) && a27 == 1) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0) && a1 == 1) && a11 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && a20 <= 0)) || ((a1 == 1 && (((((a11 == 1 && (((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a29 == 1) && a26 == 1) && 1 == a0) || (((((((((((!(a12 == 1) && !(a7 == 1)) && a18 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) && a29 == 1) && 1 == a0)) || ((((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((a27 == 1 && a26 == 1) && (((((((!(a7 == 1) && a18 == 1) && 1 == a6) && a5 == 1) && a16 == 1) && a15 == 1) && a29 == 1) && 1 == a22) && 1 == a0)) || ((((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a22) && a26 == 1))) && a20 <= 0)) || ((((((((((a3 <= 0 && !(a12 == 1)) && !(a7 == 1)) && a18 == 1) && a27 == 1) && 1 == a6) && a26 <= 0) && a16 == 1) && a29 == 1) && a5 == 1) && 1 == a0)) || (((((((((((((a18 == 1 && a5 == 1) && a16 == 1) && a7 <= 0) && a12 == a6) && 2 <= a3) && a27 == 1) && a12 == 1) && a1 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a20 <= 0)) || ((((1 == a22 && 1 == a0) && (((((a3 <= 0 && a18 == 1) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a15 == 1) && a29 == 1) && a27 == 1) && a26 == 1)) || ((((((!(a7 == 1) && (1 == a8 || a11 == 1)) && (a18 == 1 && 1 == a3) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && 1 == a5) && a27 == 1) && a26 == 1)) || ((((((((((((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a7 <= 0) && a27 <= 0) && a12 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((a11 == 1 && a26 == 1) && ((((1 == a6 && a12 == 1) && 0 == a3) && a5 == 1) && 1 == a0) && (!(a7 == 1) && a18 == 1) && a27 == 1)) || (((((((((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && 1 == a22) && a16 == 1) && a27 == 1) && a29 == 1) && 1 == a0) && a26 == 1) && a20 <= 0) && a1 == 1)) || ((((((((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a15 == 1) && a29 == 1) && a27 == 1) && a11 == 1) && a26 == 1)) || (((((((((((!(1 == a11) && a3 <= 0) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && a16 == 1) && a29 == 1) && 1 == a0) && 1 == a5) && a27 == 1) && a26 == 1)) || (((((((((((((((a18 == 1 && !(a11 == 1)) && a5 == 1) && a16 == 1) && 1 == a22) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && 2 <= a3) && a12 == 1) && a1 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((a27 == 1 && ((((((a3 <= 0 && !(a7 == 1)) && !(a12 == 1)) && a18 == 1) && 1 == a6) && a16 == 1) && a5 == 1) && a29 == 1) && a26 == 1)) || (((((((((((a6 <= 0 && a18 == 1) && a12 == 1) && 0 == a3) && a29 == 1) && 1 == a22) && 1 == a0) && !(1 == a11)) || (((a29 == 1 && (((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && 0 == a3) && 1 == a0)) && 1 == a5) && a27 == 1) && a26 == 1)) || ((0 == a3 && 1 == a0) && (((((((((a18 == 1 && a5 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1)) || (((((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && !(a12 == 1) && !(1 == a11)) && a26 <= 0) && a16 == 1) && 1 == a6) && a5 == 1) && a29 == 1) && 1 == a0) && a20 <= 0) && a1 == 1)) || ((((((((((((((((!(1 == a8) && a4 == 1) && ((a6 <= 0 && a18 == 1) && !(a11 == 1)) && a26 <= 0) && a5 == 1) && 1 == a22) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && ((a19 == 1 || a17 == 1) || !(2 == input))) && 1 == a3) && a1 == 1) && !(a12 == 1)) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((((((((a18 == 1 && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && 1 == a3) && a12 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || ((a1 == 1 && ((((((((((a18 == 1 && 1 == a5) && a16 == 1) && 1 == a22) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && a29 == 1) && 1 == a22) && 1 == a0) && 1 == a5) && a11 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a20 <= 0) && a1 == 1)) || (a1 == 1 && (((((!(1 == a8) && a4 == 1) && 1 == a0 && ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a26 <= 0) && a16 == 1) && a29 == 1) && 1 == a22) && a15 == 1) && a23 <= 0) && a20 <= 0)) || (a1 == 1 && ((((1 == a5 && a27 == 1) && (((((!(a12 == 1) && a6 <= 0) && a18 == 1) && 0 == a3) && a29 == 1) && a16 == 1) && 1 == a0) && a11 == 1) && a26 == 1) && a20 <= 0)) || (a27 == 1 && (((((!(a7 == 1) && 1 == a6) && a29 == 1) && a5 == 1) && ((a18 == 1 && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) || (a29 == 1 && (!(a7 == 1) && a18 == 1) && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1)))) || ((((((!(a7 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0)) || ((a27 == 1 && a11 == 1) && (((((((((a3 <= 0 && !(a12 == 1)) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a5 == 1) && a26 <= 0) && a29 == 1) && a16 == 1) && a15 == 1) && 1 == a0)) || ((a1 == 1 && ((((a5 == 1 && a29 == 1) && 1 == a0) && !(a7 == 1) && (((((a18 == 1 && 2 <= a3) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a16 == 1) && a15 == 1) || ((((1 == a6 && a29 == 1) && 1 == a0) && !(a7 == 1) && (((a18 == 1 && 2 <= a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && 1 == a5))) && a20 <= 0)) || ((((((((((((((a18 == 1 && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a1 == 1) && a5 == 1) && a20 <= 0)) || ((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a12 == a6) && a6 <= 0) && a27 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((a29 == 1 && (((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || ((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a15 == 1))) && 0 == a3) && 1 == a22) && 1 == a0) || ((((!(a7 == 1) && (((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || ((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a15 == 1))) && a29 == 1) && 0 == a3) && 1 == a0)) || (((((((a12 == a6 && a29 == 1) && 1 == a0) && (((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 2 <= a3) && a26 <= 0) && a16 == 1) && a27 <= 0) && 1 == a5) && a11 == 1) && a20 <= 0) && a1 == 1)) || ((((((a12 == 1 && 0 == a3) && a5 == 1) && a29 == 1) && (((((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a16 == 1) && a26 == 1) && a27 <= 0) && 1 == a22) && 1 == a0)) || (((((((((a18 == 1 && 1 == a6) && a5 == 1) && 1 == a22) && a3 <= 0) && !(a12 == 1)) && a27 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a15 == 1 && a20 <= 0) && (((((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && !(a11 == 1)) && a16 == 1) && a26 == 1) && a27 <= 0) && a29 == 1) && 1 == a22) && 1 == a0) && a1 == 1) && a5 == 1) || ((((((((((!(a7 == 1) && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && a27 <= 0) && 1 == a6) && a5 == 1) && a29 == 1) && 1 == a22)) || (a1 == 1 && (((((((((a12 == a6 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) && a29 == 1) && 1 == a22) && 1 == a0) && 1 == a5) || ((a27 == 1 && a26 == 1) && ((((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && a12 == 1) && a5 == 1) && a29 == 1) && 1 == a22) && a16 == 1) && 1 == a0) || (((((a12 == 1 && 0 == a3) && a29 == 1) && 1 == a22) && 1 == a0) && (((!(a7 == 1) && a6 <= 0) && a18 == 1) && a5 == 1) && a16 == 1)))) || ((((((((((((a18 == 1 && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a5) && 0 == a3) && 1 == a22) && 1 == a0)) || (((((a12 == a6 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && a26 == 1) && a16 == 1) && a15 == 1) && 1 == a5) && a29 == 1) && 1 == a0) && a11 == 1)) || ((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && a6 <= 0) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) && a20 <= 0)) || ((((((a27 == 1 && ((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && 2 <= a3) && a29 == 1) && a16 == 1) && 1 == a0) && a11 == 1) && a26 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || (((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && 1 == a22) && a15 == 1)) || ((((((((((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && 2 <= a3) && a27 == 1) && a26 <= 0) && a16 == 1) && a15 == 1) && a29 == 1) && 1 == a0) && a11 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || (a26 == 1 && 1 == a6 && (((((((a18 == 1 && a27 == 1) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a29 == 1) && a16 == 1) && a3 <= 1) && 1 == a22) && 1 == a0)) || ((a1 == 1 && (((a29 == 1 && (((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) && 1 == a5) || ((((!(a7 == 1) && (((((a6 <= 0 && a18 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && a27 <= 0) && a5 == 1) && a29 == 1) && 1 == a22))) && a20 <= 0)) || (((((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && a16 == 1) && 1 == a22) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && a12 == 1) && a1 == 1) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((a1 == 1 && a15 == 1) && (((1 == a5 && ((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && 1 == a6) && !(a11 == 1)) && a26 <= 0) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1)) || ((((((((a3 <= 0 && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && a26 <= 0) && a5 == 1) && !(1 == a11)) && a27 <= 0)) || (a27 == 1 && ((0 == a3 && a29 == 1 && ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a26 <= 0) && a16 == 1) && a15 == 1) && 1 == a22) && 1 == a0)) || (a1 == 1 && (((((!(a7 == 1) && ((((((!(a12 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && !(a27 == 1)) && a5 == 1) && a26 == 1) && a15 == 1) && a29 == 1) && 1 == a0) && a16 == 1) && a23 <= 0) && a20 <= 0)) || (((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && 1 == a6) && a5 == 1) && a29 == 1) && a16 == 1) && a26 == 1) && 0 == a3) && 1 == a0) || ((((((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && 0 == a3) && a29 == 1) && a16 == 1) && 1 == a22) && 1 == a0)) || ((a1 == 1 && ((((1 == a5 && a27 == 1) && ((a12 == 1 && a29 == 1) && 1 == a0) && ((((!(a7 == 1) && a6 <= 0) && a18 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a26 == 1) || (((((((((((!(1 == a11) && a18 == 1) && 1 == a5) && a16 == 1) && 1 == a22) && !(a7 == 1)) && a6 <= 0) && a27 == 1) && a12 == 1) && a29 == 1) && 1 == a0) && a26 == 1))) && a20 <= 0)) || (a29 == 1 && ((((((((!(a7 == 1) && a18 == 1) && 1 == a3) && 1 == a6) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0)) || (((a26 == 1 && ((a12 == 1 && (((((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && a29 == 1) && a5 == 1) && 1 == a0) && a1 == 1) && a20 <= 0)) || (a11 == 1 && ((0 == a3 && a29 == 1) && 1 == a0) && ((((((!(a12 == 1) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((((((((((a3 <= 0 && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a27 == 1) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a15 == 1) && a12 == 1) && a5 == 1) && 1 == a0)) || ((((((((((((a6 <= 0 && a18 == 1) && 1 == a3) && a12 == 1) && a26 == 1) && 1 == a22) && a16 == 1) && a27 <= 0) || ((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && a12 == 1) && a26 == 1) && a16 == 1) && 1 == a22) && (1 == a8 || ((a4 == 1 && a29 == 1) && a15 == 1))) && a27 <= 0)) && a11 == 1) && a20 <= 0) && a1 == 1) && a5 == 1)) || ((((a27 == 1 && a11 == 1) && a23 <= 0) && (((0 == a3 && a29 == 1) && 1 == a22) && 1 == a0) && (((((!(a7 == 1) && a18 == 1) && 1 == a6) && a26 <= 0) && a5 == 1) && a16 == 1) && a15 == 1) && a1 == 1)) || ((1 == a8 || a11 == 1) && ((((a18 == 1 && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a15 == 1) && !(a7 == 1)) && 0 == a3) && 1 == a0)) || ((((((!(a7 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a16 == 1) && a15 == 1) && 0 == a3) && 1 == a0)) || (1 == a6 && (((((((a18 == 1 && a27 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a29 == 1) && a5 == 1) && a26 == 1) && 1 == a22) && 1 == a0)) || ((((((((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 2 <= a3) && a27 == 1) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0) && a1 == 1) && a11 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && a20 <= 0)) || ((a1 == 1 && (((((a11 == 1 && (((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a29 == 1) && a26 == 1) && 1 == a0) || (((((((((((!(a12 == 1) && !(a7 == 1)) && a18 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) && a29 == 1) && 1 == a0)) || ((((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((a27 == 1 && a26 == 1) && (((((((!(a7 == 1) && a18 == 1) && 1 == a6) && a5 == 1) && a16 == 1) && a15 == 1) && a29 == 1) && 1 == a22) && 1 == a0)) || ((((((((!(a12 == 1) && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a22) && a26 == 1))) && a20 <= 0)) || ((((((((((a3 <= 0 && !(a12 == 1)) && !(a7 == 1)) && a18 == 1) && a27 == 1) && 1 == a6) && a26 <= 0) && a16 == 1) && a29 == 1) && a5 == 1) && 1 == a0)) || (((((((((((((a18 == 1 && a5 == 1) && a16 == 1) && a7 <= 0) && a12 == a6) && 2 <= a3) && a27 == 1) && a12 == 1) && a1 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a20 <= 0)) || ((((1 == a22 && 1 == a0) && (((((a3 <= 0 && a18 == 1) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a15 == 1) && a29 == 1) && a27 == 1) && a26 == 1)) || ((((((!(a7 == 1) && (1 == a8 || a11 == 1)) && (a18 == 1 && 1 == a3) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && 1 == a5) && a27 == 1) && a26 == 1)) || ((((((((((((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a7 <= 0) && a27 <= 0) && a12 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((a11 == 1 && a26 == 1) && ((((1 == a6 && a12 == 1) && 0 == a3) && a5 == 1) && 1 == a0) && (!(a7 == 1) && a18 == 1) && a27 == 1)) || (((((((((((a18 == 1 && 1 == a6) && 0 == a3) && a5 == 1) && 1 == a22) && a16 == 1) && a27 == 1) && a29 == 1) && 1 == a0) && a26 == 1) && a20 <= 0) && a1 == 1)) || ((((((((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a15 == 1) && a29 == 1) && a27 == 1) && a11 == 1) && a26 == 1)) || (((((((((((!(1 == a11) && a3 <= 0) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && a16 == 1) && a29 == 1) && 1 == a0) && 1 == a5) && a27 == 1) && a26 == 1)) || (((((((((((((((a18 == 1 && !(a11 == 1)) && a5 == 1) && a16 == 1) && 1 == a22) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && 2 <= a3) && a12 == 1) && a1 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((a27 == 1 && ((((((a3 <= 0 && !(a7 == 1)) && !(a12 == 1)) && a18 == 1) && 1 == a6) && a16 == 1) && a5 == 1) && a29 == 1) && a26 == 1)) || (((((((((((a6 <= 0 && a18 == 1) && a12 == 1) && 0 == a3) && a29 == 1) && 1 == a22) && 1 == a0) && !(1 == a11)) || (((a29 == 1 && (((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a12 == 1) && 0 == a3) && 1 == a0)) && 1 == a5) && a27 == 1) && a26 == 1)) || ((0 == a3 && 1 == a0) && (((((((((a18 == 1 && a5 == 1) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1)) || (((((((((((!(a7 == 1) && a18 == 1) && a27 == 1) && !(a12 == 1) && !(1 == a11)) && a26 <= 0) && a16 == 1) && 1 == a6) && a5 == 1) && a29 == 1) && 1 == a0) && a20 <= 0) && a1 == 1)) || ((((((((((((((((!(1 == a8) && a4 == 1) && ((a6 <= 0 && a18 == 1) && !(a11 == 1)) && a26 <= 0) && a5 == 1) && 1 == a22) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && ((a19 == 1 || a17 == 1) || !(2 == input))) && 1 == a3) && a1 == 1) && !(a12 == 1)) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((((((((a18 == 1 && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && !(a7 == 1)) && 1 == a3) && a12 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || ((a1 == 1 && ((((((((((a18 == 1 && 1 == a5) && a16 == 1) && 1 == a22) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((!(a7 == 1) && a18 == 1) && 2 <= a3) && 1 == a6) && a29 == 1) && 1 == a22) && 1 == a0) && 1 == a5) && a11 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a20 <= 0) && a1 == 1)) || (a1 == 1 && (((((!(1 == a8) && a4 == 1) && 1 == a0 && ((((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a5 == 1) && a26 <= 0) && a16 == 1) && a29 == 1) && 1 == a22) && a15 == 1) && a23 <= 0) && a20 <= 0)) || (a1 == 1 && ((((1 == a5 && a27 == 1) && (((((!(a12 == 1) && a6 <= 0) && a18 == 1) && 0 == a3) && a29 == 1) && a16 == 1) && 1 == a0) && a11 == 1) && a26 == 1) && a20 <= 0)) || (a27 == 1 && (((((!(a7 == 1) && 1 == a6) && a29 == 1) && a5 == 1) && ((a18 == 1 && 1 == a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) || (a29 == 1 && (!(a7 == 1) && a18 == 1) && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1)))) || ((((((!(a7 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)) || ((((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a26 == 1) && !(1 == a11)))) && a16 == 1) && a29 == 1) && 1 == a22) && 1 == a0)) || ((a27 == 1 && a11 == 1) && (((((((((a3 <= 0 && !(a12 == 1)) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a5 == 1) && a26 <= 0) && a29 == 1) && a16 == 1) && a15 == 1) && 1 == a0)) || ((a1 == 1 && ((((a5 == 1 && a29 == 1) && 1 == a0) && !(a7 == 1) && (((((a18 == 1 && 2 <= a3) && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a26 <= 0) && a16 == 1) && a15 == 1) || ((((1 == a6 && a29 == 1) && 1 == a0) && !(a7 == 1) && (((a18 == 1 && 2 <= a3) && !(a12 == 1) && !(1 == a11)) && a26 == 1) && a16 == 1) && 1 == a5))) && a20 <= 0)) || ((((((((((((((a18 == 1 && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && !(a7 == 1)) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a1 == 1) && a5 == 1) && a20 <= 0)) || ((((((((((((a18 == 1 && 0 == a3) && a5 == 1) && !(a11 == 1)) && 1 == a22) && a16 == 1) && a15 == 1) && a12 == a6) && a6 <= 0) && a27 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((a29 == 1 && (((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || ((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a15 == 1))) && 0 == a3) && 1 == a22) && 1 == a0) || ((((!(a7 == 1) && (((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || ((((a18 == 1 && (((a3 <= 0 && !(a12 == 1) && !(1 == a11)) && 1 == a6) && a5 == 1) && a26 == 1) && a27 == 1) && a16 == 1) && a15 == 1))) && a29 == 1) && 0 == a3) && 1 == a0)) || (((((((a12 == a6 && a29 == 1) && 1 == a0) && (((((!(a7 == 1) && a6 <= 0) && a18 == 1) && 2 <= a3) && a26 <= 0) && a16 == 1) && a27 <= 0) && 1 == a5) && a11 == 1) && a20 <= 0) && a1 == 1)) || ((((((a12 == 1 && 0 == a3) && a5 == 1) && a29 == 1) && (((((!(1 == a11) && !(a7 == 1)) && a6 <= 0) && a18 == 1) && a16 == 1) && a26 == 1) && a27 <= 0) && 1 == a22) && 1 == a0)) || (((((((((a18 == 1 && 1 == a6) && a5 == 1) && 1 == a22) && a3 <= 0) && !(a12 == 1)) && a27 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 267.3s, OverallIterations: 38, TraceHistogramMax: 12, AutomataDifference: 71.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 93.7s, HoareTripleCheckerStatistics: 5687 SDtfs, 15886 SDslu, 3953 SDs, 0 SdLazy, 28998 SolverSat, 4912 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5643 GetRequests, 5475 SyntacticMatches, 17 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317003occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 65.6s AutomataMinimizationTime, 38 MinimizatonAttempts, 372947 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 342 NumberOfFragments, 6803 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1223844 FormulaSimplificationTreeSizeReduction, 23.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2041464 FormulaSimplificationTreeSizeReductionInter, 69.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 22001 NumberOfCodeBlocks, 22001 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 21951 ConstructedInterpolants, 0 QuantifiedInterpolants, 50286451 SizeOfPredicates, 30 NumberOfNonLiveVariables, 8848 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 50 InterpolantComputations, 37 PerfectInterpolantSequences, 32421/33408 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...