./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label57.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_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c -s /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/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 17a767ebf51f6a233211ab82288cb9185242fdcf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:16:02,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:16:02,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:16:02,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:16:02,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:16:02,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:16:02,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:16:02,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:16:02,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:16:02,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:16:02,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:16:02,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:16:02,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:16:02,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:16:02,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:16:02,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:16:02,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:16:02,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:16:02,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:16:02,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:16:02,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:16:02,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:16:02,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:16:02,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:16:02,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:16:02,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:16:02,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:16:02,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:16:02,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:16:02,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:16:02,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:16:02,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:16:02,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:16:02,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:16:02,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:16:02,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:16:02,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:16:02,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:16:02,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:16:02,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:16:02,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:16:02,544 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:16:02,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:16:02,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:16:02,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:16:02,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:16:02,567 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:16:02,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:16:02,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:16:02,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:16:02,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:16:02,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:16:02,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:16:02,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:16:02,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:16:02,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:16:02,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:16:02,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:16:02,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:16:02,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:16:02,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:16:02,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:16:02,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:16:02,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:16:02,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:16:02,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:16:02,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:16:02,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:16:02,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:16:02,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:16:02,572 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_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/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 -> 17a767ebf51f6a233211ab82288cb9185242fdcf [2019-11-20 10:16:02,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:16:02,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:16:02,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:16:02,752 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:16:02,752 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:16:02,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c [2019-11-20 10:16:02,802 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/data/32f55cafd/db30dfd84f47417e99c98a0486bb07ca/FLAG5f8aa5155 [2019-11-20 10:16:03,421 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:16:03,421 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/sv-benchmarks/c/eca-rers2012/Problem03_label57.c [2019-11-20 10:16:03,444 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/data/32f55cafd/db30dfd84f47417e99c98a0486bb07ca/FLAG5f8aa5155 [2019-11-20 10:16:03,822 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/data/32f55cafd/db30dfd84f47417e99c98a0486bb07ca [2019-11-20 10:16:03,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:16:03,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:16:03,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:16:03,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:16:03,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:16:03,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:16:03" (1/1) ... [2019-11-20 10:16:03,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a0443a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:03, skipping insertion in model container [2019-11-20 10:16:03,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:16:03" (1/1) ... [2019-11-20 10:16:03,839 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:16:03,922 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:16:04,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:16:04,644 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:16:04,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:16:04,905 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:16:04,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04 WrapperNode [2019-11-20 10:16:04,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:16:04,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:16:04,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:16:04,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:16:04,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:04,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:05,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:16:05,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:16:05,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:16:05,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:16:05,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:05,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:05,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:05,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:05,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:05,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:05,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... [2019-11-20 10:16:05,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:16:05,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:16:05,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:16:05,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:16:05,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:16:05,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:16:05,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:16:07,288 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:16:07,288 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:16:07,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:16:07 BoogieIcfgContainer [2019-11-20 10:16:07,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:16:07,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:16:07,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:16:07,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:16:07,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:16:03" (1/3) ... [2019-11-20 10:16:07,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58925df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:16:07, skipping insertion in model container [2019-11-20 10:16:07,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:16:04" (2/3) ... [2019-11-20 10:16:07,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58925df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:16:07, skipping insertion in model container [2019-11-20 10:16:07,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:16:07" (3/3) ... [2019-11-20 10:16:07,300 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label57.c [2019-11-20 10:16:07,309 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:16:07,317 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:16:07,326 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:16:07,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:16:07,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:16:07,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:16:07,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:16:07,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:16:07,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:16:07,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:16:07,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:16:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-20 10:16:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 10:16:07,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:07,411 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] [2019-11-20 10:16:07,412 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash -10226053, now seen corresponding path program 1 times [2019-11-20 10:16:07,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:07,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728421933] [2019-11-20 10:16:07,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:16:08,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728421933] [2019-11-20 10:16:08,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:08,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:16:08,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206151121] [2019-11-20 10:16:08,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:08,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:08,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:08,087 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-20 10:16:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:09,406 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-20 10:16:09,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:09,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-20 10:16:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:09,435 INFO L225 Difference]: With dead ends: 829 [2019-11-20 10:16:09,435 INFO L226 Difference]: Without dead ends: 463 [2019-11-20 10:16:09,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-20 10:16:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-20 10:16:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-20 10:16:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-20 10:16:09,534 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 161 [2019-11-20 10:16:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:09,537 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-20 10:16:09,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-20 10:16:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-20 10:16:09,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:09,551 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] [2019-11-20 10:16:09,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1203029931, now seen corresponding path program 1 times [2019-11-20 10:16:09,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:09,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144555913] [2019-11-20 10:16:09,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:09,665 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 10:16:09,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144555913] [2019-11-20 10:16:09,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:09,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:09,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721672955] [2019-11-20 10:16:09,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:16:09,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:16:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:16:09,669 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-20 10:16:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:11,226 INFO L93 Difference]: Finished difference Result 1735 states and 2827 transitions. [2019-11-20 10:16:11,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:16:11,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-20 10:16:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:11,237 INFO L225 Difference]: With dead ends: 1735 [2019-11-20 10:16:11,238 INFO L226 Difference]: Without dead ends: 1288 [2019-11-20 10:16:11,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:16:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-11-20 10:16:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 859. [2019-11-20 10:16:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-20 10:16:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-20 10:16:11,278 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 166 [2019-11-20 10:16:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:11,278 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-20 10:16:11,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:16:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-20 10:16:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 10:16:11,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:11,282 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:11,283 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash -938777153, now seen corresponding path program 1 times [2019-11-20 10:16:11,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:11,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974373840] [2019-11-20 10:16:11,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:16:11,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974373840] [2019-11-20 10:16:11,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:11,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:16:11,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2695206] [2019-11-20 10:16:11,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:11,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:11,405 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-20 10:16:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:11,899 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-20 10:16:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:11,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-20 10:16:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:11,904 INFO L225 Difference]: With dead ends: 1695 [2019-11-20 10:16:11,904 INFO L226 Difference]: Without dead ends: 838 [2019-11-20 10:16:11,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-20 10:16:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-20 10:16:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-20 10:16:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-20 10:16:11,923 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 174 [2019-11-20 10:16:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:11,923 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-20 10:16:11,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-20 10:16:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 10:16:11,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:11,934 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:11,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 133702577, now seen corresponding path program 1 times [2019-11-20 10:16:11,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:11,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551818803] [2019-11-20 10:16:11,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 10:16:12,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551818803] [2019-11-20 10:16:12,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:12,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:12,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679297069] [2019-11-20 10:16:12,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:16:12,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:12,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:16:12,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:16:12,028 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-20 10:16:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:13,495 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-11-20 10:16:13,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:16:13,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-11-20 10:16:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:13,509 INFO L225 Difference]: With dead ends: 3313 [2019-11-20 10:16:13,509 INFO L226 Difference]: Without dead ends: 2477 [2019-11-20 10:16:13,510 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 10:16:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-11-20 10:16:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-11-20 10:16:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-20 10:16:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-11-20 10:16:13,546 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 175 [2019-11-20 10:16:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:13,546 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-11-20 10:16:13,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:16:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-11-20 10:16:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 10:16:13,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:13,550 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-20 10:16:13,550 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1756622090, now seen corresponding path program 1 times [2019-11-20 10:16:13,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:13,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289511011] [2019-11-20 10:16:13,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 10:16:13,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289511011] [2019-11-20 10:16:13,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:13,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:16:13,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302281311] [2019-11-20 10:16:13,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:13,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:13,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:13,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:13,647 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-11-20 10:16:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:14,415 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-11-20 10:16:14,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:14,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-11-20 10:16:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:14,428 INFO L225 Difference]: With dead ends: 4133 [2019-11-20 10:16:14,428 INFO L226 Difference]: Without dead ends: 2480 [2019-11-20 10:16:14,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-20 10:16:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-11-20 10:16:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-20 10:16:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-11-20 10:16:14,477 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 178 [2019-11-20 10:16:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:14,477 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-11-20 10:16:14,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-11-20 10:16:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 10:16:14,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:14,482 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:14,483 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash -198454923, now seen corresponding path program 1 times [2019-11-20 10:16:14,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:14,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453239539] [2019-11-20 10:16:14,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:16:14,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453239539] [2019-11-20 10:16:14,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:14,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:16:14,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721142010] [2019-11-20 10:16:14,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:14,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:14,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:14,554 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-11-20 10:16:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:15,045 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-11-20 10:16:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:15,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-20 10:16:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:15,070 INFO L225 Difference]: With dead ends: 7424 [2019-11-20 10:16:15,070 INFO L226 Difference]: Without dead ends: 4947 [2019-11-20 10:16:15,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-11-20 10:16:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-11-20 10:16:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-11-20 10:16:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-11-20 10:16:15,173 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 181 [2019-11-20 10:16:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:15,173 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-11-20 10:16:15,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-11-20 10:16:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 10:16:15,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:15,181 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-11-20 10:16:15,182 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:15,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1859199098, now seen corresponding path program 1 times [2019-11-20 10:16:15,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:15,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835535232] [2019-11-20 10:16:15,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:16:15,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835535232] [2019-11-20 10:16:15,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:15,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:15,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386616397] [2019-11-20 10:16:15,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:15,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:15,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:15,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:15,263 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-11-20 10:16:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:16,017 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-11-20 10:16:16,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:16,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-20 10:16:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:16,052 INFO L225 Difference]: With dead ends: 14560 [2019-11-20 10:16:16,052 INFO L226 Difference]: Without dead ends: 9617 [2019-11-20 10:16:16,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-11-20 10:16:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-11-20 10:16:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-11-20 10:16:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12493 transitions. [2019-11-20 10:16:16,233 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12493 transitions. Word has length 183 [2019-11-20 10:16:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:16,234 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12493 transitions. [2019-11-20 10:16:16,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12493 transitions. [2019-11-20 10:16:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 10:16:16,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:16,243 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2019-11-20 10:16:16,243 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1527292661, now seen corresponding path program 2 times [2019-11-20 10:16:16,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:16,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129166107] [2019-11-20 10:16:16,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:16:16,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129166107] [2019-11-20 10:16:16,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:16,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:16,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050752890] [2019-11-20 10:16:16,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:16,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:16,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:16,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:16,327 INFO L87 Difference]: Start difference. First operand 9615 states and 12493 transitions. Second operand 3 states. [2019-11-20 10:16:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:17,340 INFO L93 Difference]: Finished difference Result 26540 states and 34559 transitions. [2019-11-20 10:16:17,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:17,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-20 10:16:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:17,402 INFO L225 Difference]: With dead ends: 26540 [2019-11-20 10:16:17,402 INFO L226 Difference]: Without dead ends: 16927 [2019-11-20 10:16:17,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-11-20 10:16:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-11-20 10:16:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-20 10:16:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20089 transitions. [2019-11-20 10:16:17,829 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20089 transitions. Word has length 185 [2019-11-20 10:16:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:17,830 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20089 transitions. [2019-11-20 10:16:17,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20089 transitions. [2019-11-20 10:16:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-20 10:16:17,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:17,846 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:17,847 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash 899468712, now seen corresponding path program 1 times [2019-11-20 10:16:17,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:17,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628861420] [2019-11-20 10:16:17,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 10:16:17,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628861420] [2019-11-20 10:16:17,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:17,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:17,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202089012] [2019-11-20 10:16:17,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:16:17,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:16:17,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:16:17,942 INFO L87 Difference]: Start difference. First operand 16923 states and 20089 transitions. Second operand 4 states. [2019-11-20 10:16:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:18,820 INFO L93 Difference]: Finished difference Result 33846 states and 40180 transitions. [2019-11-20 10:16:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:18,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-20 10:16:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:18,843 INFO L225 Difference]: With dead ends: 33846 [2019-11-20 10:16:18,843 INFO L226 Difference]: Without dead ends: 16925 [2019-11-20 10:16:18,858 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 10:16:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16925 states. [2019-11-20 10:16:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16925 to 16923. [2019-11-20 10:16:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-20 10:16:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 19544 transitions. [2019-11-20 10:16:19,090 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 19544 transitions. Word has length 203 [2019-11-20 10:16:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:19,090 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 19544 transitions. [2019-11-20 10:16:19,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:16:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 19544 transitions. [2019-11-20 10:16:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-20 10:16:19,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:19,109 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:19,110 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash -361443703, now seen corresponding path program 1 times [2019-11-20 10:16:19,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:19,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892502884] [2019-11-20 10:16:19,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 10:16:19,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892502884] [2019-11-20 10:16:19,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:19,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:16:19,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848500457] [2019-11-20 10:16:19,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:16:19,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:16:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:16:19,277 INFO L87 Difference]: Start difference. First operand 16923 states and 19544 transitions. Second operand 5 states. [2019-11-20 10:16:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:20,960 INFO L93 Difference]: Finished difference Result 77631 states and 89804 transitions. [2019-11-20 10:16:20,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:16:20,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2019-11-20 10:16:20,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:21,068 INFO L225 Difference]: With dead ends: 77631 [2019-11-20 10:16:21,068 INFO L226 Difference]: Without dead ends: 60710 [2019-11-20 10:16:21,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:16:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60710 states. [2019-11-20 10:16:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60710 to 60704. [2019-11-20 10:16:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60704 states. [2019-11-20 10:16:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60704 states to 60704 states and 70206 transitions. [2019-11-20 10:16:21,907 INFO L78 Accepts]: Start accepts. Automaton has 60704 states and 70206 transitions. Word has length 228 [2019-11-20 10:16:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:21,907 INFO L462 AbstractCegarLoop]: Abstraction has 60704 states and 70206 transitions. [2019-11-20 10:16:21,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:16:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 60704 states and 70206 transitions. [2019-11-20 10:16:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-20 10:16:21,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:21,931 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:21,932 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1215433345, now seen corresponding path program 1 times [2019-11-20 10:16:21,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:21,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219440860] [2019-11-20 10:16:21,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:16:22,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219440860] [2019-11-20 10:16:22,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:22,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:22,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327669865] [2019-11-20 10:16:22,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:22,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:22,091 INFO L87 Difference]: Start difference. First operand 60704 states and 70206 transitions. Second operand 3 states. [2019-11-20 10:16:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:23,501 INFO L93 Difference]: Finished difference Result 143587 states and 166565 transitions. [2019-11-20 10:16:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:23,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-20 10:16:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:23,576 INFO L225 Difference]: With dead ends: 143587 [2019-11-20 10:16:23,576 INFO L226 Difference]: Without dead ends: 82885 [2019-11-20 10:16:23,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82885 states. [2019-11-20 10:16:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82885 to 82831. [2019-11-20 10:16:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82831 states. [2019-11-20 10:16:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82831 states to 82831 states and 95030 transitions. [2019-11-20 10:16:24,925 INFO L78 Accepts]: Start accepts. Automaton has 82831 states and 95030 transitions. Word has length 231 [2019-11-20 10:16:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:24,925 INFO L462 AbstractCegarLoop]: Abstraction has 82831 states and 95030 transitions. [2019-11-20 10:16:24,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 82831 states and 95030 transitions. [2019-11-20 10:16:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-20 10:16:24,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:24,971 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 10:16:24,972 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1616179030, now seen corresponding path program 1 times [2019-11-20 10:16:24,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:24,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149377576] [2019-11-20 10:16:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 10:16:25,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149377576] [2019-11-20 10:16:25,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761219023] [2019-11-20 10:16:25,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:25,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:16:25,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 10:16:25,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:16:25,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 10:16:25,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415106193] [2019-11-20 10:16:25,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:25,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:25,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:25,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:16:25,412 INFO L87 Difference]: Start difference. First operand 82831 states and 95030 transitions. Second operand 3 states. [2019-11-20 10:16:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:26,527 INFO L93 Difference]: Finished difference Result 161604 states and 185369 transitions. [2019-11-20 10:16:26,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:26,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-20 10:16:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:26,592 INFO L225 Difference]: With dead ends: 161604 [2019-11-20 10:16:26,592 INFO L226 Difference]: Without dead ends: 78775 [2019-11-20 10:16:26,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 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 10:16:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78775 states. [2019-11-20 10:16:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78775 to 72876. [2019-11-20 10:16:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72876 states. [2019-11-20 10:16:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72876 states to 72876 states and 81916 transitions. [2019-11-20 10:16:27,847 INFO L78 Accepts]: Start accepts. Automaton has 72876 states and 81916 transitions. Word has length 239 [2019-11-20 10:16:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:27,847 INFO L462 AbstractCegarLoop]: Abstraction has 72876 states and 81916 transitions. [2019-11-20 10:16:27,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 72876 states and 81916 transitions. [2019-11-20 10:16:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-20 10:16:27,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:27,869 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:16:28,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:28,070 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1709211579, now seen corresponding path program 1 times [2019-11-20 10:16:28,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:28,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151578920] [2019-11-20 10:16:28,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:16:28,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151578920] [2019-11-20 10:16:28,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:28,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:16:28,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839028399] [2019-11-20 10:16:28,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:28,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:28,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:28,259 INFO L87 Difference]: Start difference. First operand 72876 states and 81916 transitions. Second operand 3 states. [2019-11-20 10:16:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:29,279 INFO L93 Difference]: Finished difference Result 164423 states and 185526 transitions. [2019-11-20 10:16:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:29,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-20 10:16:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:29,379 INFO L225 Difference]: With dead ends: 164423 [2019-11-20 10:16:29,379 INFO L226 Difference]: Without dead ends: 91549 [2019-11-20 10:16:29,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:16:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91549 states. [2019-11-20 10:16:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91549 to 91549. [2019-11-20 10:16:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91549 states. [2019-11-20 10:16:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91549 states to 91549 states and 100388 transitions. [2019-11-20 10:16:31,210 INFO L78 Accepts]: Start accepts. Automaton has 91549 states and 100388 transitions. Word has length 272 [2019-11-20 10:16:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:31,210 INFO L462 AbstractCegarLoop]: Abstraction has 91549 states and 100388 transitions. [2019-11-20 10:16:31,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 91549 states and 100388 transitions. [2019-11-20 10:16:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-11-20 10:16:31,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:31,229 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:31,229 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1997086450, now seen corresponding path program 1 times [2019-11-20 10:16:31,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:31,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644294642] [2019-11-20 10:16:31,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-20 10:16:31,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644294642] [2019-11-20 10:16:31,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314237114] [2019-11-20 10:16:31,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:31,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:16:31,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 10:16:31,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:16:31,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-20 10:16:31,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820662697] [2019-11-20 10:16:31,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:31,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:31,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:16:31,734 INFO L87 Difference]: Start difference. First operand 91549 states and 100388 transitions. Second operand 3 states. [2019-11-20 10:16:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:32,216 INFO L93 Difference]: Finished difference Result 268117 states and 293771 transitions. [2019-11-20 10:16:32,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:32,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-11-20 10:16:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:32,358 INFO L225 Difference]: With dead ends: 268117 [2019-11-20 10:16:32,358 INFO L226 Difference]: Without dead ends: 176570 [2019-11-20 10:16:32,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:16:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176570 states. [2019-11-20 10:16:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176570 to 176566. [2019-11-20 10:16:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176566 states. [2019-11-20 10:16:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176566 states to 176566 states and 193374 transitions. [2019-11-20 10:16:37,396 INFO L78 Accepts]: Start accepts. Automaton has 176566 states and 193374 transitions. Word has length 329 [2019-11-20 10:16:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:37,396 INFO L462 AbstractCegarLoop]: Abstraction has 176566 states and 193374 transitions. [2019-11-20 10:16:37,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 176566 states and 193374 transitions. [2019-11-20 10:16:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-20 10:16:37,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:37,432 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:37,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:37,648 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:37,649 INFO L82 PathProgramCache]: Analyzing trace with hash -731096947, now seen corresponding path program 1 times [2019-11-20 10:16:37,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:37,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042538685] [2019-11-20 10:16:37,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-20 10:16:37,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042538685] [2019-11-20 10:16:37,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:37,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:37,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136916590] [2019-11-20 10:16:37,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:16:37,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:16:37,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:16:37,885 INFO L87 Difference]: Start difference. First operand 176566 states and 193374 transitions. Second operand 4 states. [2019-11-20 10:16:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:39,750 INFO L93 Difference]: Finished difference Result 359920 states and 393955 transitions. [2019-11-20 10:16:39,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:39,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-11-20 10:16:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:39,913 INFO L225 Difference]: With dead ends: 359920 [2019-11-20 10:16:39,913 INFO L226 Difference]: Without dead ends: 183356 [2019-11-20 10:16:39,971 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 10:16:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183356 states. [2019-11-20 10:16:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183356 to 176160. [2019-11-20 10:16:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176160 states. [2019-11-20 10:16:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176160 states to 176160 states and 192548 transitions. [2019-11-20 10:16:41,454 INFO L78 Accepts]: Start accepts. Automaton has 176160 states and 192548 transitions. Word has length 387 [2019-11-20 10:16:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:41,454 INFO L462 AbstractCegarLoop]: Abstraction has 176160 states and 192548 transitions. [2019-11-20 10:16:41,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:16:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 176160 states and 192548 transitions. [2019-11-20 10:16:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-20 10:16:41,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:41,497 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:41,497 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1850717027, now seen corresponding path program 1 times [2019-11-20 10:16:41,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:41,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891971739] [2019-11-20 10:16:41,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-20 10:16:41,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891971739] [2019-11-20 10:16:41,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:16:41,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:16:41,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992461615] [2019-11-20 10:16:41,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:16:41,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:16:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:16:41,759 INFO L87 Difference]: Start difference. First operand 176160 states and 192548 transitions. Second operand 4 states. [2019-11-20 10:16:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:44,531 INFO L93 Difference]: Finished difference Result 361734 states and 395668 transitions. [2019-11-20 10:16:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:16:44,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-11-20 10:16:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:44,687 INFO L225 Difference]: With dead ends: 361734 [2019-11-20 10:16:44,687 INFO L226 Difference]: Without dead ends: 185576 [2019-11-20 10:16:44,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:16:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185576 states. [2019-11-20 10:16:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185576 to 172114. [2019-11-20 10:16:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172114 states. [2019-11-20 10:16:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172114 states to 172114 states and 188084 transitions. [2019-11-20 10:16:46,239 INFO L78 Accepts]: Start accepts. Automaton has 172114 states and 188084 transitions. Word has length 408 [2019-11-20 10:16:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:46,239 INFO L462 AbstractCegarLoop]: Abstraction has 172114 states and 188084 transitions. [2019-11-20 10:16:46,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:16:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 172114 states and 188084 transitions. [2019-11-20 10:16:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-20 10:16:46,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:16:46,269 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:16:46,269 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:16:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:16:46,270 INFO L82 PathProgramCache]: Analyzing trace with hash 613897899, now seen corresponding path program 1 times [2019-11-20 10:16:46,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:16:46,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860185560] [2019-11-20 10:16:46,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:16:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 146 proven. 3 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-20 10:16:47,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860185560] [2019-11-20 10:16:47,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398962109] [2019-11-20 10:16:47,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:16:47,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:16:47,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:16:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-20 10:16:47,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 10:16:47,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 10:16:47,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664671144] [2019-11-20 10:16:47,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:16:47,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:16:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:16:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:16:47,541 INFO L87 Difference]: Start difference. First operand 172114 states and 188084 transitions. Second operand 3 states. [2019-11-20 10:16:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:16:49,335 INFO L93 Difference]: Finished difference Result 341404 states and 372971 transitions. [2019-11-20 10:16:49,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:16:49,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-11-20 10:16:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:16:49,336 INFO L225 Difference]: With dead ends: 341404 [2019-11-20 10:16:49,337 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:16:49,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:16:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:16:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:16:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:16:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:16:49,436 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 420 [2019-11-20 10:16:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:16:49,436 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:16:49,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:16:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:16:49,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:16:49,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:16:49,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 10:16:55,687 WARN L191 SmtUtils]: Spent 6.03 s on a formula simplification. DAG size of input: 1057 DAG size of output: 403 [2019-11-20 10:16:59,648 WARN L191 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 1057 DAG size of output: 403 [2019-11-20 10:17:04,205 WARN L191 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 378 DAG size of output: 79 [2019-11-20 10:17:08,555 WARN L191 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 378 DAG size of output: 79 [2019-11-20 10:17:08,557 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-20 10:17:08,557 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,558 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,559 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-20 10:17:08,560 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,561 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,562 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,563 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,564 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,565 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-20 10:17:08,566 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,567 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-20 10:17:08,567 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,567 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-20 10:17:08,567 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,567 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,567 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 10:17:08,567 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 10:17:08,568 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 10:17:08,568 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 10:17:08,568 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-20 10:17:08,568 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-20 10:17:08,568 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-20 10:17:08,568 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,568 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,568 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,569 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse7 (= ~a12~0 1))) (let ((.cse6 (= 1 ~a6~0)) (.cse5 (= ~a27~0 1)) (.cse11 (not .cse7))) (let ((.cse0 (and .cse5 .cse11)) (.cse20 (not .cse6)) (.cse1 (= ~a5~0 1))) (let ((.cse16 (= ~a13~0 1)) (.cse15 (and .cse0 .cse20 .cse1)) (.cse4 (<= ~a3~0 0)) (.cse13 (and .cse20 .cse1)) (.cse14 (<= 2 ~a3~0)) (.cse2 (= ~a11~0 1)) (.cse18 (not (= ~a7~0 1))) (.cse17 (= 1 ~a10~0)) (.cse3 (<= ~a26~0 0)) (.cse12 (= ~a16~0 1)) (.cse19 (and .cse11 .cse20 .cse1)) (.cse8 (= 1 ~a3~0)) (.cse9 (<= ~a11~0 0)) (.cse10 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse2) (and .cse8 .cse6 .cse9 .cse1 .cse10) (and .cse11 .cse9 .cse1 .cse10 .cse12) (and .cse4 .cse9 .cse10 .cse12 .cse13) (and .cse9 .cse0 .cse3 .cse1) (and .cse8 .cse6 .cse0 .cse1 .cse2) (and .cse11 .cse8 .cse1 .cse2 .cse10) (and .cse6 .cse0 .cse1 .cse2 .cse12) (and .cse14 .cse5 .cse9 .cse1 .cse10) (and .cse15 .cse14 .cse2 .cse10) (and .cse11 .cse14 .cse6 .cse9 .cse3 .cse1) (and .cse8 .cse2 .cse10 .cse13) (and .cse5 .cse7 .cse9 .cse1 .cse10) (and .cse4 .cse6 .cse1 .cse2 .cse10) (and .cse14 .cse5 .cse1 .cse2 .cse10 .cse12) (and .cse16 .cse11 .cse6 .cse1 .cse2 .cse10) (and .cse11 .cse6 .cse17 .cse9 .cse1 .cse10) (and .cse14 .cse2 .cse10 .cse12 .cse13) (and .cse4 .cse5 .cse17 .cse7 .cse1 .cse2 .cse10) (and .cse16 .cse8 .cse6 .cse3 .cse1 .cse2 .cse12) (and .cse18 .cse5 .cse6 .cse17 .cse1 .cse2 .cse12) (and .cse4 .cse18 .cse17 .cse9 .cse1 .cse10 .cse12) (and .cse4 .cse9 .cse3 .cse1 .cse12) (and .cse11 .cse1 .cse2 .cse10 .cse12) (and .cse17 .cse2 .cse10 .cse12 .cse13) (and .cse14 .cse9 .cse1 .cse10 .cse12) (and .cse19 .cse8 .cse17 .cse9 .cse3) (and .cse4 .cse6 .cse17 .cse0 .cse1 .cse2) (and .cse18 .cse14 .cse17 .cse9 .cse1 .cse10) (and .cse14 .cse5 .cse17 .cse9 .cse3 .cse1) (and .cse14 .cse9 .cse10 .cse13) (and .cse14 .cse5 .cse9 .cse3 .cse13) (and .cse15 .cse17 .cse9 .cse10) (and .cse18 .cse8 .cse6 .cse17 .cse9 .cse3 .cse1) (and .cse14 .cse17 .cse2 .cse10 .cse13) (and .cse5 .cse17 .cse1 .cse2 .cse10 .cse12) (and .cse4 .cse9 .cse3 .cse13) (and .cse5 .cse2 .cse10 .cse12 .cse13) (and .cse19 .cse14 .cse3 .cse2) (and .cse18 .cse6 .cse17 .cse9 .cse3 .cse1 .cse12) (and .cse19 .cse8 .cse9 .cse10)))))) [2019-11-20 10:17:08,569 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,569 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,569 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,569 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-20 10:17:08,569 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-20 10:17:08,569 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1518) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,570 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-20 10:17:08,571 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,572 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse7 (= ~a12~0 1))) (let ((.cse6 (= 1 ~a6~0)) (.cse5 (= ~a27~0 1)) (.cse11 (not .cse7))) (let ((.cse0 (and .cse5 .cse11)) (.cse20 (not .cse6)) (.cse1 (= ~a5~0 1))) (let ((.cse16 (= ~a13~0 1)) (.cse15 (and .cse0 .cse20 .cse1)) (.cse4 (<= ~a3~0 0)) (.cse13 (and .cse20 .cse1)) (.cse14 (<= 2 ~a3~0)) (.cse2 (= ~a11~0 1)) (.cse18 (not (= ~a7~0 1))) (.cse17 (= 1 ~a10~0)) (.cse3 (<= ~a26~0 0)) (.cse12 (= ~a16~0 1)) (.cse19 (and .cse11 .cse20 .cse1)) (.cse8 (= 1 ~a3~0)) (.cse9 (<= ~a11~0 0)) (.cse10 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse2) (and .cse8 .cse6 .cse9 .cse1 .cse10) (and .cse11 .cse9 .cse1 .cse10 .cse12) (and .cse4 .cse9 .cse10 .cse12 .cse13) (and .cse9 .cse0 .cse3 .cse1) (and .cse8 .cse6 .cse0 .cse1 .cse2) (and .cse11 .cse8 .cse1 .cse2 .cse10) (and .cse6 .cse0 .cse1 .cse2 .cse12) (and .cse14 .cse5 .cse9 .cse1 .cse10) (and .cse15 .cse14 .cse2 .cse10) (and .cse11 .cse14 .cse6 .cse9 .cse3 .cse1) (and .cse8 .cse2 .cse10 .cse13) (and .cse5 .cse7 .cse9 .cse1 .cse10) (and .cse4 .cse6 .cse1 .cse2 .cse10) (and .cse14 .cse5 .cse1 .cse2 .cse10 .cse12) (and .cse16 .cse11 .cse6 .cse1 .cse2 .cse10) (and .cse11 .cse6 .cse17 .cse9 .cse1 .cse10) (and .cse14 .cse2 .cse10 .cse12 .cse13) (and .cse4 .cse5 .cse17 .cse7 .cse1 .cse2 .cse10) (and .cse16 .cse8 .cse6 .cse3 .cse1 .cse2 .cse12) (and .cse18 .cse5 .cse6 .cse17 .cse1 .cse2 .cse12) (and .cse4 .cse18 .cse17 .cse9 .cse1 .cse10 .cse12) (and .cse4 .cse9 .cse3 .cse1 .cse12) (and .cse11 .cse1 .cse2 .cse10 .cse12) (and .cse17 .cse2 .cse10 .cse12 .cse13) (and .cse14 .cse9 .cse1 .cse10 .cse12) (and .cse19 .cse8 .cse17 .cse9 .cse3) (and .cse4 .cse6 .cse17 .cse0 .cse1 .cse2) (and .cse18 .cse14 .cse17 .cse9 .cse1 .cse10) (and .cse14 .cse5 .cse17 .cse9 .cse3 .cse1) (and .cse14 .cse9 .cse10 .cse13) (and .cse14 .cse5 .cse9 .cse3 .cse13) (and .cse15 .cse17 .cse9 .cse10) (and .cse18 .cse8 .cse6 .cse17 .cse9 .cse3 .cse1) (and .cse14 .cse17 .cse2 .cse10 .cse13) (and .cse5 .cse17 .cse1 .cse2 .cse10 .cse12) (and .cse4 .cse9 .cse3 .cse13) (and .cse5 .cse2 .cse10 .cse12 .cse13) (and .cse19 .cse14 .cse3 .cse2) (and .cse18 .cse6 .cse17 .cse9 .cse3 .cse1 .cse12) (and .cse19 .cse8 .cse9 .cse10)))))) [2019-11-20 10:17:08,572 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,572 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,572 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,572 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,573 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,574 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,575 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,576 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-20 10:17:08,576 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,576 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-20 10:17:08,576 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-20 10:17:08,576 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-20 10:17:08,576 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,576 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,577 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,577 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,577 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,577 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,577 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,577 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,577 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 10:17:08,577 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,578 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,579 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,579 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,579 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,579 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,579 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,579 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,579 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,579 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,580 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,581 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,582 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,582 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-20 10:17:08,582 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-20 10:17:08,582 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,582 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,582 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,582 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-20 10:17:08,583 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-20 10:17:08,583 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,583 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-20 10:17:08,583 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,583 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,583 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,583 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,583 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-20 10:17:08,584 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,585 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,586 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 10:17:08,586 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,586 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-20 10:17:08,586 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-20 10:17:08,586 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,586 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-20 10:17:08,586 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-20 10:17:08,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:17:08 BoogieIcfgContainer [2019-11-20 10:17:08,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:17:08,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:17:08,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:17:08,629 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:17:08,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:16:07" (3/4) ... [2019-11-20 10:17:08,632 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:17:08,663 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 10:17:08,667 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 10:17:08,856 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_02892d18-ce2c-4cc7-a73a-e8bc99ad032b/bin/uautomizer/witness.graphml [2019-11-20 10:17:08,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:17:08,858 INFO L168 Benchmark]: Toolchain (without parser) took 65032.34 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -76.7 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-11-20 10:17:08,858 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:17:08,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1080.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:08,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.40 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:08,859 INFO L168 Benchmark]: Boogie Preprocessor took 113.26 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:08,859 INFO L168 Benchmark]: RCFGBuilder took 2137.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.5 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:08,860 INFO L168 Benchmark]: TraceAbstraction took 61337.86 ms. Allocated memory was 1.3 GB in the beginning and 5.3 GB in the end (delta: 4.0 GB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 111.9 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-11-20 10:17:08,860 INFO L168 Benchmark]: Witness Printer took 227.70 ms. Allocated memory is still 5.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:17:08,862 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1080.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 132.40 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.26 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2137.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.5 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61337.86 ms. Allocated memory was 1.3 GB in the beginning and 5.3 GB in the end (delta: 4.0 GB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 111.9 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 227.70 ms. Allocated memory is still 5.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1518]: 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: ((((((((((((((((((((((((((((((((((((((((((((a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a26 <= 0) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1)) || ((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 <= 0) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || (((a11 <= 0 && a27 == 1 && !(a12 == 1)) && a26 <= 0) && a5 == 1)) || ((((1 == a3 && 1 == a6) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || ((((!(a12 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((1 == a6 && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((2 <= a3 && a27 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && 2 <= a3) && a11 == 1) && a26 == 1)) || (((((!(a12 == 1) && 2 <= a3) && 1 == a6) && a11 <= 0) && a26 <= 0) && a5 == 1)) || (((1 == a3 && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((a13 == 1 && !(a12 == 1)) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((!(a12 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((2 <= a3 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((a13 == 1 && 1 == a3) && 1 == a6) && a26 <= 0) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 <= 0) && a26 <= 0) && a5 == 1) && a16 == 1)) || ((((!(a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((1 == a10 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((2 <= a3 && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && 1 == a10) && a11 <= 0) && a26 <= 0)) || (((((a3 <= 0 && 1 == a6) && 1 == a10) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || (((((!(a7 == 1) && 2 <= a3) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1)) || (((2 <= a3 && a11 <= 0) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((2 <= a3 && a27 == 1) && a11 <= 0) && a26 <= 0) && !(1 == a6) && a5 == 1)) || ((((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && 1 == a10) && a11 <= 0) && a26 == 1)) || ((((((!(a7 == 1) && 1 == a3) && 1 == a6) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1)) || ((((2 <= a3 && 1 == a10) && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1)) || (((((a27 == 1 && 1 == a10) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((a3 <= 0 && a11 <= 0) && a26 <= 0) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 2 <= a3) && a26 <= 0) && a11 == 1)) || ((((((!(a7 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a26 <= 0) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a12 == 1) && a5 == 1) && a11 == 1)) || ((((1 == a3 && 1 == a6) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 <= 0) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || (((a11 <= 0 && a27 == 1 && !(a12 == 1)) && a26 <= 0) && a5 == 1)) || ((((1 == a3 && 1 == a6) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || ((((!(a12 == 1) && 1 == a3) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((1 == a6 && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((2 <= a3 && a27 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && 2 <= a3) && a11 == 1) && a26 == 1)) || (((((!(a12 == 1) && 2 <= a3) && 1 == a6) && a11 <= 0) && a26 <= 0) && a5 == 1)) || (((1 == a3 && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((a13 == 1 && !(a12 == 1)) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((!(a12 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((2 <= a3 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a27 == 1) && 1 == a10) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((a13 == 1 && 1 == a3) && 1 == a6) && a26 <= 0) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && 1 == a10) && a5 == 1) && a11 == 1) && a16 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 <= 0) && a26 <= 0) && a5 == 1) && a16 == 1)) || ((((!(a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((1 == a10 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((2 <= a3 && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && 1 == a10) && a11 <= 0) && a26 <= 0)) || (((((a3 <= 0 && 1 == a6) && 1 == a10) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || (((((!(a7 == 1) && 2 <= a3) && 1 == a10) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1)) || (((2 <= a3 && a11 <= 0) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((2 <= a3 && a27 == 1) && a11 <= 0) && a26 <= 0) && !(1 == a6) && a5 == 1)) || ((((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && 1 == a10) && a11 <= 0) && a26 == 1)) || ((((((!(a7 == 1) && 1 == a3) && 1 == a6) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1)) || ((((2 <= a3 && 1 == a10) && a11 == 1) && a26 == 1) && !(1 == a6) && a5 == 1)) || (((((a27 == 1 && 1 == a10) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((a3 <= 0 && a11 <= 0) && a26 <= 0) && !(1 == a6) && a5 == 1)) || ((((a27 == 1 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 2 <= a3) && a26 <= 0) && a11 == 1)) || ((((((!(a7 == 1) && 1 == a6) && 1 == a10) && a11 <= 0) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && 1 == a3) && a11 <= 0) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 61.2s, OverallIterations: 17, TraceHistogramMax: 7, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.9s, HoareTripleCheckerStatistics: 3031 SDtfs, 5702 SDslu, 1478 SDs, 0 SdLazy, 10453 SolverSat, 2075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 1002 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176566occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 27897 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1559 NumberOfFragments, 1687 HoareAnnotationTreeSize, 3 FomulaSimplifications, 55110 FormulaSimplificationTreeSizeReduction, 9.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 27976 FormulaSimplificationTreeSizeReductionInter, 8.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5108 NumberOfCodeBlocks, 5108 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5088 ConstructedInterpolants, 0 QuantifiedInterpolants, 2521650 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1793 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 3042/3051 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...